Proof Assistant Projects
Collection
Digesting proof assistant libraries for AI ingestion. • 103 items • Updated • 3
statement stringlengths 2 99 | proof stringclasses 25
values | type stringclasses 3
values | symbolic_name stringlengths 6 25 | library stringclasses 1
value | filename stringclasses 12
values | imports listlengths 0 0 | deps listlengths 0 0 | docstring stringclasses 1
value | source_url stringclasses 1
value | commit stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|
false | = (!(p:bool). p) | definition | false_def | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
$\/ | = (\p1 p2. !p. (p1 ==> p) ==> (p2 ==> p) ==> p) | definition | disj_def | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
$~ | = (\p. p ==> false) | definition | not_def | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
$?! | = (\(P:'a->bool). ?x. P x /\ (!y. P y ==> y = x)) | definition | uexists_def | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
COND | =
(\p (t1:'a) t2. @x. (p = true ==> x = t1) /\ (p = false ==> x = t2)) | definition | cond_def | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
true | theorem | truth_thm | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A1 u A2 |- p /\ q | theorem | conj_lemma0 | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
p1_ /\ p2_ <=> (!p. (p1_ ==> p2_ ==> p) ==> p) | theorem | conj_lemma | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A |- p | theorem | conjunct1_lemma | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A |- q | theorem | conjunct2_lemma | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A u A1\{p} u A2\{q} |- r | theorem | disj_lemma0 | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
p1_ \/ p2_ <=> (!p. (p1_ ==> p) ==> (p2_ ==> p) ==> p) | theorem | disj_cases_lemma | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A |- p \/ q | theorem | disj1_lemma | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!f g. f = g <=> (!x. f x = g x) | theorem | fun_eq_thm | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
$==> = (\p q. p /\ q <=> p) | theorem | imp_alt_def_thm | src | src/bool.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
~ true <=> false | theorem | not_true_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
~ false <=> true | theorem | not_false_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
~ (true <=> false) | theorem | true_not_eq_false_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q. ~ (p \/ q) <=> ~ p /\ ~ q | theorem | not_dist_disj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. p /\ true <=> p | theorem | conj_id_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. p /\ false <=> false | theorem | conj_zero_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. p /\ p <=> p | theorem | conj_idem_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q. p /\ q <=> q /\ p | theorem | conj_comm_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q r. p /\ (q /\ r) <=> (p /\ q) /\ r | theorem | conj_assoc_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q. p /\ (p \/ q) <=> p | theorem | conj_absorb_disj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q r. p /\ (q \/ r) <=> (p /\ q) \/ (p /\ r) | theorem | conj_dist_right_disj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q r. (p \/ q) /\ r <=> (p /\ r) \/ (q /\ r) | theorem | conj_dist_left_disj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. p /\ ~ p <=> false | theorem | conj_contr_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. p \/ false <=> p | theorem | disj_id_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. p \/ true <=> true | theorem | disj_zero_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. p \/ p <=> p | theorem | disj_idem_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q. p \/ q <=> q \/ p | theorem | disj_comm_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q r. p \/ (q \/ r) <=> (p \/ q) \/ r | theorem | disj_assoc_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q. p \/ (p /\ q) <=> p | theorem | disj_absorb_conj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q r. p \/ (q /\ r) <=> (p \/ q) /\ (p \/ r) | theorem | disj_dist_right_conj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q r. (p /\ q) \/ r <=> (p \/ r) /\ (q \/ r) | theorem | disj_dist_left_conj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. p ==> true | theorem | imp_right_zero_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. (true ==> p) <=> p | theorem | imp_left_id_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. false ==> p | theorem | imp_left_zero_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. p ==> p | theorem | imp_refl_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q r. (p \/ q ==> r) <=> (p ==> r) /\ (q ==> r) | theorem | imp_dist_left_disj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q r. (p ==> q /\ r) <=> (p ==> q) /\ (p ==> r) | theorem | imp_dist_right_conj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q r. (p ==> q ==> r) <=> (p /\ q ==> r) | theorem | imp_imp_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P Q. (!x. P x /\ Q x) <=> (!x. P x) /\ (!x. Q x) | theorem | forall_dist_conj_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P a. (!x. x = a ==> P x) <=> P a | theorem | forall_one_point_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!t. (!(x:'a). t) <=> t | theorem | forall_null_thm | src | src/boolalg.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!(a:'a). (@x. x = a) = a | theorem | select_eq_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P Q. (?x. P x \/ Q x) <=> (?x. P x) \/ (?x. Q x) | theorem | exists_dist_disj_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P a. (?x. x = a /\ P x) <=> P a | theorem | exists_one_point_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!x. (?y. y = x) | theorem | exists_value_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!t. (?x. t) <=> t | theorem | exists_null_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P. (?!x. P x) <=> (?x. P x /\ (!y. P y ==> y = x)) | theorem | uexists_thm1 | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P. (?!x. P x) <=> (?x. !y. P y <=> x = y) | theorem | uexists_thm2 | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P. (?!x. P x) <=> (?x. P x) /\ (!x x'. P x /\ P x' ==> x = x') | theorem | uexists_thm3 | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P a. (?!x. x = a /\ P x) <=> P a | theorem | uexists_one_point_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P. (!x. ?y. P x y) <=> (?f. !x. P x (f x)) | theorem | skolem_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P. (!x. ?!y. P x y) <=> (?f. !x y. P x y <=> f x = y) | theorem | unique_skolem_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P. ~ (?x. P x) <=> (!x. ~ P x) | theorem | not_dist_exists_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. (p <=> true) \/ (p <=> false) | theorem | bool_cases_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A\{~ p} |- p | theorem | ccontr_lemma | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p. ~ ~ p <=> p | theorem | not_dneg_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q. (p ==> q) <=> (~ p \/ q) | theorem | imp_disj_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p q. ~ (p /\ q) <=> ~ p \/ ~ q | theorem | not_dist_conj_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P. ~ (!x. P x) <=> (?x. ~ P x) | theorem | not_dist_forall_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!t1 t2. (if true then t1 else t2) = t1 | theorem | cond_true_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!t1 t2. (if false then t1 else t2) = t2 | theorem | cond_false_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p t. (if p then t else t) = t | theorem | cond_idem_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!p t1 t2. (if ~ p then t1 else t2) = (if p then t2 else t1) | theorem | cond_not_thm | src | src/boolclass.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A |- ~ p1 <=> ~ p2 | theorem | not_fn | src | src/eqcong.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A1 u A2 |- p1 /\ q1 <=> p2 /\ q2 | theorem | conj_fn | src | src/eqcong.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A1 u A2 |- p1 \/ q1 <=> p2 \/ q2 | theorem | disj_fn | src | src/eqcong.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
A1 u A2 |- p1 ==> q1 <=> p2 ==> q2 | theorem | imp_fn | src | src/eqcong.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
LET | = (\(f:'a->'b) (x:'a). f x) | definition | let_def | src | src/equal.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
ONTO | = (\(f:'a->'b). !y. ?x. y = f x) | definition | onto_def | src | src/equal.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
?(f:ind->ind). ONE_ONE f /\ ~ ONTO f | axiom | infinity_ax | src | src/ind.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!f. ~ ONTO f <=> ?y. !x. ~(f x = y) | theorem | not_onto_lemma | src | src/ind.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
?(s:ind->ind) z. ONE_ONE s /\ (!i. ~(s i = z)) | theorem | ind_suc_zero_exists_lemma | src | src/ind.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!i j. IND_SUC i = IND_SUC j <=> i = j | theorem | ind_suc_injective_thm | src | src/ind.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!i. ~(IND_SUC i = IND_ZERO) | theorem | ind_suc_not_zero_thm | src | src/ind.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!(i:ind). IsNatRep i <=>
(!P. P IND_ZERO /\ (!j. P j ==> P (IND_SUC j)) ==> P i) | definition | is_nat_rep_def | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
IsNatRep IND_ZERO | theorem | ind_zero_is_nat_rep_lemma | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!i. IsNatRep i ==> IsNatRep (IND_SUC i) | theorem | ind_suc_is_nat_rep_lemma | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!n. IsNatRep (NatRep n) | theorem | is_nat_rep_lemma | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!m n. NatRep m = NatRep n <=> m = n | theorem | nat_rep_injective_lemma | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
ZERO | = NatAbs IND_ZERO | definition | zero_def | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
!n. SUC n | = NatAbs (IND_SUC (NatRep n)) | definition | suc_def | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
NatRep ZERO = IND_ZERO | theorem | nat_rep_zero_lemma | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!n. NatRep (SUC n) = IND_SUC (NatRep n) | theorem | nat_rep_suc_lemma | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!n. ~ (SUC n = ZERO) | theorem | suc_not_zero_thm0 | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!m n. SUC m = SUC n <=> m = n | theorem | suc_injective_thm | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!P. P ZERO /\ (!n. P n ==> P (SUC n)) ==> (!n. P n) | theorem | nat_induction_thm0 | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!n. n = ZERO \/ (?m. n = SUC m) | theorem | nat_cases_thm0 | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!n. ?!y. PRG n y <PRG-functional> | theorem | lemma3 | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
?fn. fn ZERO = e /\ (!n. fn (SUC n) = f (fn n) n) | theorem | lemma4 | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!e f. ?fn. fn ZERO = e /\ (!n. fn (SUC n) = f (fn n) n) | theorem | nat_recursion_thm0 | src | src/nat.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
(!n. 0 + n | = n) /\
(!m n. (SUC m) + n = SUC (m + n)) | definition | add_def | src | src/natarith.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | |
!n. 0 + n = n | theorem | add_left_id_lemma | src | src/natarith.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!m n. (SUC m) + n = SUC (m + n) | theorem | add_dist_left_suc_thm | src | src/natarith.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!m n. m + (SUC n) = SUC (m + n) | theorem | add_dist_right_suc_thm | src | src/natarith.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 | ||
!n. n + 0 = n | theorem | add_id_thm | src | src/natarith.ml | [] | [] | http://www.proof-technologies.com/holzero/ | 0.6.3 |
Declarations from HOL Zero, a minimalist HOL theorem prover by Mark Adams.
0.6.3| 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 | 207 |
| definition | 29 |
| axiom | 1 |
false
= (!(p:bool). p)
false_def | src/bool.mlEach 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{holzero_dataset,
title = {HOLZero},
author = {Norton, Charles},
year = {2026},
note = {Extracted from http://www.proof-technologies.com/holzero/, commit 0.6.3},
url = {https://huggingface.co/datasets/phanerozoic/HOLZero}
}