Proof Assistant Projects
Collection
Digesting proof assistant libraries for AI ingestion. • 103 items • Updated • 3
statement stringlengths 1 33.2k | proof stringlengths 0 198k | type stringclasses 14
values | symbolic_name stringlengths 1 92 | library stringclasses 345
values | filename stringlengths 17 103 | imports listlengths 0 0 | deps listlengths 0 64 | docstring stringclasses 1
value | source_url stringclasses 1
value | commit stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|
(~p = F) = p | REWRITE_TAC [] | prove | NEG_EQ_F | examples | examples/dpll.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
divides_def:
a divides b <=> ?x. b = a * x | Definition | divides_def | examples | examples/euclid.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
prime_def:
prime p <=> p <> 1 /\ !x. x divides p ==> (x = 1) \/ (x = p) | Definition | prime_def | examples | examples/euclid.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
DIVIDES_ZERO:
!x. x divides 0 | Proof
metis_tac [divides_def,MULT_CLAUSES] | Theorem | DIVIDES_ZERO | examples | examples/euclid.sml | [] | [
"MULT_CLAUSES",
"divides_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
ZERO_DIVIDES:
!x. 0 divides x <=> x = 0 | Proof
metis_tac [divides_def,MULT_CLAUSES] | Theorem | ZERO_DIVIDES | examples | examples/euclid.sml | [] | [
"MULT_CLAUSES",
"divides_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_ONE:
!x. x divides 1 <=> x = 1 | Proof
metis_tac [divides_def,MULT_CLAUSES,MULT_EQ_1] | Theorem | DIVIDES_ONE | examples | examples/euclid.sml | [] | [
"MULT_CLAUSES",
"MULT_EQ_1",
"divides_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_REFL :
!x. x divides x | Proof
metis_tac [divides_def,MULT_CLAUSES] | Theorem | DIVIDES_REFL | examples | examples/euclid.sml | [] | [
"MULT_CLAUSES",
"divides_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_TRANS :
!a b c. a divides b /\ b divides c ==> a divides c | Proof
metis_tac [divides_def,MULT_ASSOC] | Theorem | DIVIDES_TRANS | examples | examples/euclid.sml | [] | [
"MULT_ASSOC",
"divides_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_ADD :
!d a b. d divides a /\ d divides b ==> d divides (a + b) | Proof
metis_tac[divides_def,LEFT_ADD_DISTRIB] | Theorem | DIVIDES_ADD | examples | examples/euclid.sml | [] | [
"LEFT_ADD_DISTRIB",
"divides_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_SUB :
!d a b. d divides a /\ d divides b ==> d divides (a - b) | Proof
metis_tac [divides_def,LEFT_SUB_DISTRIB] | Theorem | DIVIDES_SUB | examples | examples/euclid.sml | [] | [
"LEFT_SUB_DISTRIB",
"divides_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_ADDL :
!d a b. d divides a /\ d divides (a + b) ==> d divides b | Proof
metis_tac [ADD_SUB,ADD_SYM,DIVIDES_SUB] | Theorem | DIVIDES_ADDL | examples | examples/euclid.sml | [] | [
"ADD_SUB",
"ADD_SYM",
"DIVIDES_SUB"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_LMUL :
!d a x. d divides a ==> d divides (x * a) | Proof
metis_tac [divides_def,MULT_ASSOC,MULT_SYM] | Theorem | DIVIDES_LMUL | examples | examples/euclid.sml | [] | [
"MULT_ASSOC",
"MULT_SYM",
"divides_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_RMUL :
!d a x. d divides a ==> d divides (a * x) | Proof
metis_tac [MULT_SYM,DIVIDES_LMUL] | Theorem | DIVIDES_RMUL | examples | examples/euclid.sml | [] | [
"DIVIDES_LMUL",
"MULT_SYM"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_LE :
!a b. a divides b ==> (0 < a ∧ a <= b) \/ b = 0 | Proof
rw [divides_def] >> rw[] | Theorem | DIVIDES_LE | examples | examples/euclid.sml | [] | [
"divides_def",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
LE_DIVIDES_FACT :
!m n. 0 < m /\ m <= n ==> m divides (FACT n) | Proof
rw [LESS_EQ_EXISTS]
>> Induct_on `p`
>> rw [FACT,ADD_CLAUSES]
>> Cases_on `m`
>> metis_tac [FACT, DECIDE ``!x. ~(x < x)``,
DIVIDES_RMUL, DIVIDES_LMUL, DIVIDES_REFL] | Theorem | LE_DIVIDES_FACT | examples | examples/euclid.sml | [] | [
"ADD_CLAUSES",
"DIVIDES_LMUL",
"DIVIDES_REFL",
"DIVIDES_RMUL",
"FACT",
"LESS_EQ_EXISTS",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
DIVIDES_FACT:
∀n. 0 < n ==> n divides (FACT n) | Proof
Cases
>> rw[FACT]
>> rename1 ‘SUC n’
>> irule DIVIDES_LMUL
>> metis_tac [DIVIDES_REFL] | Theorem | DIVIDES_FACT | examples | examples/euclid.sml | [] | [
"DIVIDES_LMUL",
"DIVIDES_REFL",
"FACT",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
LE_DIVIDES_FACT :
!m n. 0 < m /\ m <= n ==> m divides (FACT n) | Proof
rw [LESS_EQ_EXISTS]
>> Induct_on `p`
>> fs [FACT,ADD_CLAUSES]
>- metis_tac [DIVIDES_FACT]
>- metis_tac [DIVIDES_RMUL] | Theorem | LE_DIVIDES_FACT | examples | examples/euclid.sml | [] | [
"ADD_CLAUSES",
"DIVIDES_FACT",
"DIVIDES_RMUL",
"FACT",
"LESS_EQ_EXISTS",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
LE_DIVIDES_FACT :
!m n. 0 < m /\ m <= n ==> m divides (FACT n) | Proof
`!m p. 0 < m ==> m divides FACT (m + p)`
suffices_by metis_tac[LESS_EQ_EXISTS]
>> Induct_on `p`
>> rw [FACT,ADD_CLAUSES]
>> metis_tac [FACT, DECIDE ``!x. ~(x < x)``, num_CASES,
DIVIDES_RMUL, DIVIDES_LMUL, DIVIDES_REFL] | Theorem | LE_DIVIDES_FACT | examples | examples/euclid.sml | [] | [
"ADD_CLAUSES",
"DIVIDES_LMUL",
"DIVIDES_REFL",
"DIVIDES_RMUL",
"FACT",
"LESS_EQ_EXISTS",
"num_CASES",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
LE_DIVIDES_FACT :
!m n. 0 < m /\ m <= n ==> m divides (FACT n) | Proof
rw [LESS_EQ_EXISTS]
>> Induct_on `p`
>> metis_tac [FACT, DECIDE ``!x. ~(x < x)``, num_CASES,
DIVIDES_RMUL,DIVIDES_LMUL,DIVIDES_REFL,ADD_CLAUSES] | Theorem | LE_DIVIDES_FACT | examples | examples/euclid.sml | [] | [
"ADD_CLAUSES",
"DIVIDES_LMUL",
"DIVIDES_REFL",
"DIVIDES_RMUL",
"FACT",
"LESS_EQ_EXISTS",
"num_CASES",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
LE_DIVIDES_FACT :
!m n. 0 < m /\ m <= n ==> m divides (FACT n) | Proof
Induct_on `n - m` >> rw []
>- metis_tac [EQ_LESS_EQ,DIVIDES_FACT]
>- (`?k. n = SUC k` by (Cases_on `n` >> fs[])
>> rw [FACT, DIVIDES_RMUL]) | Theorem | LE_DIVIDES_FACT | examples | examples/euclid.sml | [] | [
"DIVIDES_FACT",
"DIVIDES_RMUL",
"EQ_LESS_EQ",
"FACT",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
NOT_PRIME_0 :
~prime 0 | Proof
rw [prime_def,DIVIDES_ZERO] | Theorem | NOT_PRIME_0 | examples | examples/euclid.sml | [] | [
"DIVIDES_ZERO",
"prime_def",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
NOT_PRIME_1 :
~prime 1 | Proof
rw [prime_def] | Theorem | NOT_PRIME_1 | examples | examples/euclid.sml | [] | [
"prime_def",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
PRIME_2 :
prime 2 | Proof
rw [prime_def] >> drule DIVIDES_LE >> rw[] | Theorem | PRIME_2 | examples | examples/euclid.sml | [] | [
"DIVIDES_LE",
"prime_def",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
PRIME_POS :
!p. prime p ==> 0 < p | Proof
Cases >> rw [NOT_PRIME_0] | Theorem | PRIME_POS | examples | examples/euclid.sml | [] | [
"NOT_PRIME_0",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
PRIME_FACTOR :
!n. ~(n = 1) ==> ?p. prime p /\ p divides n | Proof
completeInduct_on `n` >> rw [] >>
Cases_on `prime n`
>- metis_tac [DIVIDES_REFL]
>- (`?x. x divides n /\ x<>1 /\ x<>n` by metis_tac[prime_def]
>> metis_tac [LESS_OR_EQ, PRIME_2,
DIVIDES_LE, DIVIDES_TRANS, DIVIDES_ZERO]) | Theorem | PRIME_FACTOR | examples | examples/euclid.sml | [] | [
"DIVIDES_LE",
"DIVIDES_REFL",
"DIVIDES_TRANS",
"DIVIDES_ZERO",
"PRIME_2",
"prime_def",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
PRIME_FACTOR :
!n. n<>1 ==> ?p. prime p /\ p divides n | Proof
completeInduct_on `n` >>
metis_tac [prime_def,LESS_OR_EQ, PRIME_2,
DIVIDES_REFL,DIVIDES_LE, DIVIDES_TRANS, DIVIDES_ZERO] | Theorem | PRIME_FACTOR | examples | examples/euclid.sml | [] | [
"DIVIDES_LE",
"DIVIDES_REFL",
"DIVIDES_TRANS",
"DIVIDES_ZERO",
"PRIME_2",
"prime_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
EUCLID :
!n. ?p. n < p /\ prime p | Proof
spose_not_then strip_assume_tac
>> mp_tac (SPEC ``FACT n + 1`` PRIME_FACTOR)
>> rw [FACT_LESS, DECIDE ``x <> 0 <=> 0 < x``]
>> metis_tac [LE_DIVIDES_FACT, DIVIDES_ADDL, DIVIDES_ONE,
NOT_PRIME_1, NOT_LESS, PRIME_POS] | Theorem | EUCLID | examples | examples/euclid.sml | [] | [
"DIVIDES_ADDL",
"DIVIDES_ONE",
"FACT",
"FACT_LESS",
"LE_DIVIDES_FACT",
"NOT_LESS",
"NOT_PRIME_1",
"PRIME_FACTOR",
"PRIME_POS",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
EUCLID_AGAIN[local]:
!n. ?p. n < p /\ prime p | Proof
CCONTR_TAC >>
`?n. !p. n < p ==> ~prime p`
by metis_tac[] >>
`FACT n + 1 ≠ 1` by rw [FACT_LESS, DECIDE ``x<>0 <=> 0<x``] >>
‘∃p. prime p ∧ p divides (FACT n + 1)’
by metis_tac [PRIME_FACTOR] >>
`0 < p` by metis_tac [PRIME_POS] >>
... | Theorem | EUCLID_AGAIN | examples | examples/euclid.sml | [] | [
"DIVIDES_ADDL",
"DIVIDES_ONE",
"FACT",
"FACT_LESS",
"LE_DIVIDES_FACT",
"NOT_LESS",
"NOT_PRIME_1",
"PRIME_FACTOR",
"PRIME_POS",
"rw"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
(isScalar(Scalar n) = T) /\ (isScalar(Array a) = F) | Define | isScalar_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
ScalarOf(Scalar n) = n | Define | ScalarOf_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(isArray(Array a) = T) /\ (isArray(Scalar n) = F) | Define | isArray_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
ArrayOf(Array a) = a | Define | ArrayOf_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(neval (Var v) s = ScalarOf(s ' v)) /\
(neval (Arr a e) s = (ArrayOf(s ' a) ' (Num(neval e s)))) /\
(neval (Const c) s = c) /\
(neval (Plus e1 e2) s = integer$int_add (neval e1 s) (neval e2 s)) /\
(neval (Sub e1 e2) s = integer$int_sub (neval e1 s) (neval e2 s)) /\
(neval (Times e1 e2) s = integer$int_mu... | Define | neval_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"Num"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(safe_neval (Var v) s = if v IN FDOM s /\ isScalar (s ' v) then ScalarOf(s ' v) else 0i) /\
(safe_neval (Arr a e) s = if a IN FDOM s /\ isArray (s ' a) /\ integer$int_le 0i (safe_neval e s) /\ Num (safe_neval e s) IN FDOM (ArrayOf (s ' a)) then (ArrayOf(s ' a) ' (Num(safe_neval e s))) else 0i) /\
(safe_neval (Con... | Define | safe_neval_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"IN",
"Num",
"int_le"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(nevaluates (Var v) s = v IN FDOM s /\ isScalar (s ' v)) /\
(nevaluates (Arr a e) s = a IN FDOM s /\ isArray (s ' a) /\ integer$int_le 0i (safe_neval e s) /\ nevaluates e s /\ Num (safe_neval e s) IN FDOM (ArrayOf (s ' a))) /\
(nevaluates (Const c) s = T) /\
(nevaluates (Plus e1 e2) s = ne... | Define | nevaluates_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"IN",
"Num",
"int_le"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
!e s. nevaluates e s ==> (safe_neval e s = neval e s) | Induct THEN RW_TAC std_ss [nevaluates_def, safe_neval_def, neval_def] | store_thm | neval_safe_theorem1 | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"neval_def",
"nevaluates_def",
"safe_neval_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
ONE_ONE str | RW_TAC std_ss [ONE_ONE_THM] | prove | ONE_ONE_str | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"ONE_ONE"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
ONE_ONE nat | RW_TAC std_ss [ONE_ONE_THM, sexpTheory.nat_def, translateTheory.INT_CONG, integerTheory.INT_INJ] | prove | ONE_ONE_nat | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"INT_CONG",
"INT_INJ",
"ONE_ONE",
"nat_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
(beval (Equal e1 e2) s = (neval e1 s = neval e2 s)) /\
(beval (Less e1 e2) s = integer$int_lt (neval e1 s) (neval e2 s)) /\
(beval (LessEq e1 e2) s = integer$int_le (neval e1 s) (neval e2 s)) /\
(beval (Greater e1 e2) s = integer$int_gt (neval e1 s) (neval e2 s)) /\
(beval (GreaterEq e1 e2) s = integer$int_... | Define | beval_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"int_ge",
"int_gt",
"int_le"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(safe_beval (Equal e1 e2) s = (safe_neval e1 s = safe_neval e2 s)) /\
(safe_beval (Less e1 e2) s = integer$int_lt (safe_neval e1 s) (safe_neval e2 s)) /\
(safe_beval (LessEq e1 e2) s = integer$int_le (safe_neval e1 s) (safe_neval e2 s)) /\
(safe_beval (Greater e1 e2) s = integer$int_gt (safe_neval e1 s) (safe_... | Define | safe_beval_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"int_ge",
"int_gt",
"int_le"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(bevaluates (Equal e1 e2) s = nevaluates e1 s /\ nevaluates e2 s) /\
(bevaluates (Less e1 e2) s = nevaluates e1 s /\ nevaluates e2 s) /\
(bevaluates (LessEq e1 e2) s = nevaluates e1 s /\ nevaluates e2 s) /\
(bevaluates (Greater e1 e2) s = nevaluates e1 s /\ nevaluates e2 s) /\
(bevaluates (GreaterEq e1 e2) ... | Define | bevaluates_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
!e s. bevaluates e s ==> (safe_beval e s = beval e s) | Induct THEN RW_TAC std_ss [bevaluates_def, safe_beval_def, beval_def, neval_safe_theorem1] | store_thm | beval_safe_theorem1 | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"beval_def",
"bevaluates_def",
"neval_safe_theorem1",
"safe_beval_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
(aeval (ArrConst f) s = f) /\
(aeval (ArrVar v) s = ArrayOf(s ' v)) /\
(aeval (ArrUpdate a e1 e2) s = aeval a s |+ (Num(neval e1 s), neval e2 s)) | Define | aeval_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"Num"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(aevaluates (ArrConst f) s = T) /\
(aevaluates (ArrVar v) s = v IN FDOM s) /\
(aevaluates (ArrUpdate a e1 e2) s = aevaluates a s /\ nevaluates e1 s /\ integer$int_le 0i (safe_neval e1 s) /\ nevaluates e2 s) | Define | aevaluates_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"IN",
"int_le"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(safe_aeval (ArrConst f) s = f) /\
(safe_aeval (ArrVar v) s = if v IN FDOM s then ArrayOf(s ' v) else FEMPTY) /\
(safe_aeval (ArrUpdate a e1 e2) s = if integer$int_le 0i (safe_neval e1 s) then safe_aeval a s |+ (Num(safe_neval e1 s), safe_neval e2 s) else safe_aeval a s) | Define | safe_aeval_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"IN",
"Num",
"int_le"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
!e s. aevaluates e s ==> (safe_aeval e s = aeval e s) | Induct THEN RW_TAC std_ss [aevaluates_def, safe_aeval_def, aeval_def, neval_safe_theorem1] | store_thm | aeval_safe_theorem1 | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"aeval_def",
"aevaluates_def",
"neval_safe_theorem1",
"safe_aeval_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
(naeval (INL e) s = Scalar(neval e s)) /\
(naeval (INR a) s = Array(aeval a s)) | Define | naeval_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"INL",
"INR"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(safe_naeval (INL e) s = Scalar(safe_neval e s)) /\
(safe_naeval (INR a) s = Array(safe_aeval a s)) | Define | safe_naeval_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"INL",
"INR"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(naevaluates (INL e) s = nevaluates e s) /\
(naevaluates (INR a) s = aevaluates a s) | Define | naevaluates_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"INL",
"INR"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
!e s. naevaluates e s ==> (safe_naeval e s = naeval e s) | Induct THEN RW_TAC std_ss [naevaluates_def, safe_naeval_def, naeval_def, neval_safe_theorem1, aeval_safe_theorem1] | store_thm | naeval_safe_theorem1 | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"aeval_safe_theorem1",
"naeval_def",
"naevaluates_def",
"neval_safe_theorem1",
"safe_naeval_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
Update v e s = s |+ (v, naeval e s) | Define | Update_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"Update"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
safe_Update v e s = s |+ (v, safe_naeval e s) | Define | safe_Update_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
Updates v e s = naevaluates e s | Define | Updates_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
Updates v e s ==> (safe_Update v e s = Update v e s) | RW_TAC std_ss [Updates_def, safe_Update_def, Update_def, naeval_safe_theorem1] | store_thm | Updates_safe_theorem1 | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"Update",
"Update_def",
"Updates_def",
"naeval_safe_theorem1",
"safe_Update_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
(Update v (INL e) s = s |+ (v, Scalar(neval e s))) /\
(Update v (INR a) s = s |+ (v, Array(aeval a s))) | RW_TAC std_ss [Update_def,naeval_def] | store_thm | UpdateCases | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"INL",
"INR",
"Update",
"Update_def",
"naeval_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
(Exp(Scalar n) = INL(Const n)) /\
(Exp(Array f) = INR(ArrConst f)) | Define | Exp_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"INL",
"INR"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
!v val s. Update v (Exp val) s = s |+ (v, val) | Cases_on `val`
THEN RW_TAC std_ss [UpdateCases,Exp_def,aeval_def,neval_def] | store_thm | Update_Exp | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"Exp_def",
"Update",
"UpdateCases",
"aeval_def",
"neval_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
While a c = AnWhile a ARB c | Define | While_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
Assign v e = GenAssign v (INL e) | Define | Assign_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"INL"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
ArrayAssign v e1 e2 = GenAssign v (INR(ArrUpdate (ArrVar v) e1 e2)) | Define | ArrayAssign_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"INR"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
(Locals [] c = c) /\
(Locals (v::vl) c = Local v (Locals vl c)) | Define | Locals_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
!s1 s2. EVAL Skip s1 s2 = (s1 = s2) | RW_TAC std_ss [EQ_IMP_THM,Once ecases] THEN METIS_TAC rulel | store_thm | SKIP_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s. EVAL Skip s s | METIS_TAC rulel | store_thm | SKIP | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s2 v e. EVAL (GenAssign v e) s1 s2 = (s2 = Update v e s1) | RW_TAC std_ss [EQ_IMP_THM,Once ecases] THEN METIS_TAC rulel | store_thm | GEN_ASSIGN_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"Update"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s v e. EVAL (GenAssign v e) s (Update v e s) | METIS_TAC rulel | store_thm | GEN_ASSIGN | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"Update"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s v e. EVAL (Assign v e) s (Update v (INL e) s) | RW_TAC std_ss [Assign_def] THEN METIS_TAC rulel | store_thm | ASSIGN | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"Assign_def",
"INL",
"Update"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s v e1 e2.
EVAL (ArrayAssign v e1 e2) s (Update v (INR(ArrUpdate (ArrVar v) e1 e2)) s) | RW_TAC std_ss [ArrayAssign_def] THEN METIS_TAC rulel | store_thm | ARRAY_ASSIGN | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"ArrayAssign_def",
"INR",
"Update"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s2 v. EVAL (Dispose v) s1 s2 = (s2 = s1 \\ v) | RW_TAC std_ss [EQ_IMP_THM,Once ecases] THEN METIS_TAC rulel | store_thm | DISPOSE_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s v. EVAL (Dispose v) s (s \\ v) | METIS_TAC rulel | store_thm | DISPOSE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s3 c1 c2. EVAL (Seq c1 c2) s1 s3 = ?s2. EVAL c1 s1 s2 /\ EVAL c2 s2 s3 | RW_TAC std_ss [EQ_IMP_THM,Once ecases] THEN METIS_TAC rulel | store_thm | SEQ_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s2 b c1 c2.
beval b s1 ==> (EVAL (Cond b c1 c2) s1 s2 = EVAL c1 s1 s2) | RW_TAC std_ss [EQ_IMP_THM,Once ecases] THEN METIS_TAC rulel | store_thm | IF_T_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s2 b c1 c2.
~beval b s1 ==> (EVAL (Cond b c1 c2) s1 s2 = EVAL c2 s1 s2) | RW_TAC std_ss [EQ_IMP_THM,Once ecases] THEN METIS_TAC rulel | store_thm | IF_F_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s2 b s1 s2.
EVAL (Cond b c1 c2) s1 s2 =
if beval b s1 then EVAL c1 s1 s2 else EVAL c2 s1 s2 | METIS_TAC[IF_T_THM,IF_F_THM] | store_thm | IF_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"IF_F_THM",
"IF_T_THM"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s3 b n c.
beval b s1 ==>
(EVAL (AnWhile b n c) s1 s3 =
?s2. EVAL c s1 s2 /\ EVAL (AnWhile b n c) s2 s3) | RW_TAC std_ss [EQ_IMP_THM,Once ecases]
THEN METIS_TAC rulel | store_thm | ANWHILE_T_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s3 b c.
beval b s1 ==>
(EVAL (While b c) s1 s3 =
?s2. EVAL c s1 s2 /\ EVAL (While b c) s2 s3) | METIS_TAC[ANWHILE_T_THM,While_def] | store_thm | WHILE_T_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"ANWHILE_T_THM",
"While_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s2 b n c. ~beval b s1 ==> (EVAL (AnWhile b n c) s1 s2 = (s1 = s2)) | RW_TAC std_ss [EQ_IMP_THM,Once ecases]
THEN METIS_TAC rulel | store_thm | ANWHILE_F_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s2 b c. ~beval b s1 ==> (EVAL (While b c) s1 s2 = (s1 = s2)) | METIS_TAC[ANWHILE_F_THM,While_def] | store_thm | WHILE_F_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"ANWHILE_F_THM",
"While_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s3 b n c.
EVAL (AnWhile b n c) s1 s3 =
if beval b s1
then ?s2. EVAL c s1 s2 /\ EVAL (AnWhile b n c) s2 s3
else (s1 = s3) | METIS_TAC[ANWHILE_T_THM,ANWHILE_F_THM] | store_thm | ANWHILE_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"ANWHILE_F_THM",
"ANWHILE_T_THM"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s3 b c.
EVAL (While b c) s1 s3 =
if beval b s1
then ?s2. EVAL c s1 s2 /\ EVAL (While b c) s2 s3
else (s1 = s3) | METIS_TAC[ANWHILE_THM,While_def] | store_thm | WHILE_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"ANWHILE_THM",
"While_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!s1 s2 v c.
EVAL (Local v c) s1 s2 =
?s3. EVAL c s1 s3
/\
(s2 = if v IN FDOM s1 then s3 |+ (v, (s1 ' v)) else s3 \\ v) | RW_TAC std_ss [EQ_IMP_THM,Once ecases,While_def] THEN METIS_TAC(FUPDATE_EQ:: rulel) | store_thm | LOCAL_THM | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"FUPDATE_EQ",
"IN",
"While_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!c1 c2 c3 s1 s2.
EVAL (Seq (Seq c1 c2) c3) s1 s2 = EVAL (Seq c1 (Seq c2 c3)) s1 s2 | RW_TAC std_ss [SEQ_THM]
THEN METIS_TAC[] | store_thm | SEQ_ASSOC | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"SEQ_THM"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!c st1 st2. EVAL c st1 st2 ==> !st3. EVAL c st1 st3 ==> (st2 = st3) | HO_MATCH_MP_TAC induction THEN
RW_TAC std_ss [SKIP_THM,GEN_ASSIGN_THM,DISPOSE_THM,SEQ_THM,
IF_T_THM,IF_F_THM,ANWHILE_T_THM,
ANWHILE_F_THM,LOCAL_THM] THEN
METIS_TAC[] | store_thm | EVAL_DETERMINISTIC | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"ANWHILE_F_THM",
"ANWHILE_T_THM",
"DISPOSE_THM",
"GEN_ASSIGN_THM",
"IF_F_THM",
"IF_T_THM",
"LOCAL_THM",
"SEQ_THM",
"SKIP_THM",
"st2",
"st3"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!c st1 st2 p.
(p st1 ==> EVAL c st1 st2) ==> !st3. EVAL c st1 st3 ==> p st1 ==> (st2 = st3) | METIS_TAC[EVAL_DETERMINISTIC] | store_thm | IMP_EVAL_DETERMINISTIC | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"EVAL_DETERMINISTIC",
"st2",
"st3"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
SPEC P c Q = !s1 s2. P s1 /\ EVAL c s1 s2 ==> Q s2 | Define | SPEC_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
RSPEC P c R = !s1 s2. P s1 /\ EVAL c s1 s2 ==> R s1 s2 | Define | RSPEC_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
!A c f.
(!s. A s ==> EVAL c s (f s))
==>
!P R.
(!s. (P s ==> A s) /\ (A s ==> R s (f s))) ==> RSPEC P c R | METIS_TAC[EVAL_DETERMINISTIC,RSPEC_def] | store_thm | EVAL_RSPEC | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"EVAL_DETERMINISTIC",
"RSPEC_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
IMP pre post = \prog. RSPEC pre prog post | Define | IMP_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"pre"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
AND spec1 spec2 = \prog. spec1 prog /\ spec2 prog | Define | AND_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"AND"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
!P. SPEC P Skip P | RW_TAC std_ss [SPEC_def,SKIP_THM] | store_thm | SKIP_RULE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"SKIP_THM",
"SPEC_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!P v e.
SPEC (\s. P (s \\ v)) (Dispose v) P | RW_TAC std_ss [SPEC_def] THEN METIS_TAC [DISPOSE_THM] | store_thm | DISPOSE_RULE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"DISPOSE_THM",
"SPEC_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!P v e.
SPEC (P o Update v e) (GenAssign v e) P | RW_TAC std_ss [SPEC_def] THEN METIS_TAC [GEN_ASSIGN_THM] | store_thm | GEN_ASSIGN_RULE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"GEN_ASSIGN_THM",
"SPEC_def",
"Update"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!P v.
SPEC (\s. P (s \\ v)) (Dispose v) P | RW_TAC std_ss [SPEC_def] THEN METIS_TAC [DISPOSE_THM] | store_thm | DISPOSE_RULE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"DISPOSE_THM",
"SPEC_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!P c1 c2 Q R.
SPEC P c1 Q /\ SPEC Q c2 R ==> SPEC P (Seq c1 c2) R | RW_TAC std_ss [SPEC_def] THEN METIS_TAC [SEQ_THM] | store_thm | SEQ_RULE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"SEQ_THM",
"SPEC_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!P b c1 c2 Q.
SPEC (\s. P(s) /\ beval b s) c1 Q /\
SPEC (\s. P(s) /\ ~beval b s) c2 Q ==> SPEC P (Cond b c1 c2) Q | RW_TAC std_ss [SPEC_def] THEN METIS_TAC [IF_T_THM, IF_F_THM] | store_thm | COND_RULE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"IF_F_THM",
"IF_T_THM",
"SPEC_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!c s1 s2. EVAL c s1 s2 ==> !b' n' c'. (c = AnWhile b' n' c') ==> ~beval b' s2 | HO_MATCH_MP_TAC induction THEN RW_TAC std_ss [] | prove | lemma1 | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!c s1 s2.
EVAL c s1 s2 ==>
!b' n' c'.
(c = AnWhile b' n' c') ==>
(!s1 s2. P s1 /\ beval b' s1 /\ EVAL c' s1 s2 ==> P s2)
==> (P s1 ==> P s2) | HO_MATCH_MP_TAC sinduction THEN RW_TAC std_ss [] THEN METIS_TAC[] | prove | lemma2 | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!P b n c. SPEC (\s. P(s) /\ beval b s) c P ==>
SPEC P (AnWhile b n c) (\s. P s /\ ~beval b s) | RW_TAC std_ss [SPEC_def] THENL [METIS_TAC[lemma2],METIS_TAC[lemma1]] | store_thm | ANWHILE_RULE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"SPEC_def",
"lemma1",
"lemma2"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!P b c. SPEC (\s. P(s) /\ beval b s) c P ==>
SPEC P (While b c) (\s. P s /\ ~beval b s) | METIS_TAC[ANWHILE_RULE,While_def] | store_thm | WHILE_RULE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"ANWHILE_RULE",
"While_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
INDEPENDENT P v = !s. P(s \\ v) = P s | Define | INDEPENDENT_def | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
!P Q c v.
SPEC P c Q /\ INDEPENDENT Q v
==>
SPEC P (Local v c) Q | RW_TAC std_ss [SPEC_def]
THEN FULL_SIMP_TAC std_ss [LOCAL_THM]
THEN RW_TAC std_ss [FUPDATE_EQ]
THEN METIS_TAC[DOMSUB_FUPDATE,INDEPENDENT_def] | store_thm | LOCAL_RULE | examples.acl2.examples | examples/acl2/examples/fmapExample.sml | [] | [
"DOMSUB_FUPDATE",
"FUPDATE_EQ",
"INDEPENDENT_def",
"LOCAL_THM",
"SPEC_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb |
A structured dataset of theorems and definitions from HOL4, a mature theorem prover for higher-order logic.
ab6450c497d986a09043c9e930c36841ba93fbdb| Column | Type | Description |
|---|---|---|
| statement | string | Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof |
| proof | string | Verbatim proof/body, empty if the declaration has none |
| type | string | Declaration keyword |
| symbolic_name | string | Declaration identifier |
| library | string | Sub-library |
| filename | string | Repository-relative source path |
| imports | list[string] | File-level Require/Import modules |
| deps | list[string] | Intra-corpus identifiers referenced |
| docstring | string | Preceding documentation comment, empty if absent |
| source_url | string | Upstream repository |
| commit | string | Upstream commit extracted |
| Type | Count |
|---|---|
| Theorem | 54,501 |
| Definition | 11,867 |
| prove | 4,610 |
| Define | 601 |
| TAC_PROOF | 507 |
| store_thm | 404 |
| new_definition | 379 |
| Inductive | 144 |
| tDefine | 70 |
| new_recursive_definition | 22 |
| xDefine | 15 |
| CoInductive | 12 |
| zDefine | 5 |
| Triviality | 2 |
DIVIDES_TRANS :
!a b c. a divides b /\ b divides c ==> a divides c
Proof
metis_tac [divides_def,MULT_ASSOC]
DIVIDES_TRANS | examples/euclid.smlEach declaration is split into a statement (signature/claim) and a proof (body) that are disjoint
and together form the complete declaration, for proof modeling, autoformalization, retrieval, and
dependency analysis via deps.
@misc{hol4_dataset,
title = {HOL4},
author = {Norton, Charles},
year = {2026},
note = {Extracted from https://github.com/HOL-Theorem-Prover/HOL, commit ab6450c497d9},
url = {https://huggingface.co/datasets/phanerozoic/HOL4}
}