Dataset Viewer
Auto-converted to Parquet Duplicate
statement
stringlengths
9
26k
proof
stringlengths
0
35.7k
type
stringclasses
2 values
symbolic_name
stringlengths
2
31
library
stringclasses
5 values
filename
stringclasses
5 values
imports
listlengths
0
0
deps
listlengths
0
64
docstring
stringlengths
11
33.8k
source_url
stringclasses
1 value
commit
stringclasses
1 value
tv term x : al $.
$a
tv
hol
hol.mm
[]
[]
A var is a term.
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ht type ( al -> be ) $.
$a
ht
hol
hol.mm
[]
[]
The type of all functions from type ` al ` to type ` be ` .
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
hb type bool $.
$a
hb
hol
hol.mm
[]
[]
The type of booleans (true and false).
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
hi type ind $.
$a
hi
hol
hol.mm
[]
[]
The type of individuals.
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
kc term ( F T ) $.
$a
kc
hol
hol.mm
[]
[]
A combination (function application).
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
kl term \ x : al . T $.
$a
kl
hol
hol.mm
[]
[]
A lambda abstraction.
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ke term = $.
$a
ke
hol
hol.mm
[]
[]
The equality term.
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
kt term T. $.
$a
kt
hol
hol.mm
[]
[]
Truth term.
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
kbr term [ A F B ] $.
$a
kbr
hol
hol.mm
[]
[]
Infix operator.
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
kct term ( A , B ) $.
$a
kct
hol
hol.mm
[]
[]
Context operator.
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wffMMJ2 wff A |= B $.
$a
wffMMJ2
hol
hol.mm
[]
[]
Internal axiom for mmj2 use.
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wffMMJ2t wff A : al $.
$a
wffMMJ2t
hol
hol.mm
[]
[]
Internal axiom for mmj2 use.
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
idi |- R |= A
$= ( ) C $.
$p
idi
hol
hol.mm
[]
[]
The identity inference. (Contributed by Mario Carneiro, 9-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
idt |- A : al
$= ( ) C $.
$p
idt
hol
hol.mm
[]
[]
The identity inference. (Contributed by Mario Carneiro, 9-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-syl |- R |= T $.
$a
ax-syl
hol
hol.mm
[]
[]
Syllogism inference. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
syl |- R |= T
$= ( ax-syl ) ABCDEF $.
$p
syl
hol
hol.mm
[]
[ "ax-syl" ]
Syllogism inference. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-jca |- R |= ( S , T ) $.
$a
ax-jca
hol
hol.mm
[]
[]
Join common antecedents. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
jca |- R |= ( S , T )
$= ( ax-jca ) ABCDEF $.
$p
jca
hol
hol.mm
[]
[ "ax-jca" ]
Syllogism inference. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
syl2anc |- R |= A
$= ( kct jca syl ) BCDHABCDEFIGJ $.
$p
syl2anc
hol
hol.mm
[]
[ "jca", "kct", "syl" ]
Syllogism inference. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-simpl |- ( R , S ) |= R $.
$a
ax-simpl
hol
hol.mm
[]
[]
Extract an assumption from the context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-simpr |- ( R , S ) |= S $.
$a
ax-simpr
hol
hol.mm
[]
[]
Extract an assumption from the context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
simpl |- ( R , S ) |= R
$= ( ax-simpl ) ABCDE $.
$p
simpl
hol
hol.mm
[]
[ "ax-simpl" ]
Extract an assumption from the context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
simpr |- ( R , S ) |= S
$= ( ax-simpr ) ABCDE $.
$p
simpr
hol
hol.mm
[]
[ "ax-simpr" ]
Extract an assumption from the context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-id |- R |= R $.
$a
ax-id
hol
hol.mm
[]
[]
The identity inference. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
id |- R |= R
$= ( ax-id ) ABC $.
$p
id
hol
hol.mm
[]
[ "ax-id" ]
The identity inference. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-trud |- R |= T. $.
$a
ax-trud
hol
hol.mm
[]
[]
Deduction form of ~ tru . (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
trud |- R |= T.
$= ( ax-trud ) ABC $.
$p
trud
hol
hol.mm
[]
[ "ax-trud" ]
Deduction form of ~ tru . (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
a1i |- R |= A
$= ( kt ax-trud syl ) BEABCFDG $.
$p
a1i
hol
hol.mm
[]
[ "ax-trud", "kt", "syl" ]
Change an empty context into any context. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-cb1 |- R : bool $.
$a
ax-cb1
hol
hol.mm
[]
[]
A context has type boolean. This and the next few axioms are not strictly necessary, and are conservative on any theorem for which every variable has a specified type, but by adding this axiom we can save some typehood hypotheses in many theorems. The easy way to see that this axiom is conservative is to note that ever...
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-cb2 |- A : bool $.
$a
ax-cb2
hol
hol.mm
[]
[]
A theorem has type boolean. (This axiom is unnecessary; see ~ ax-cb1 .) (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-wctl |- S : bool $.
$a
ax-wctl
hol
hol.mm
[]
[]
Reverse closure for the type of a context. (This axiom is unnecessary; see ~ ax-cb1 .) Prefer ~ wctl . (New usage is discouraged.) (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-wctr |- T : bool $.
$a
ax-wctr
hol
hol.mm
[]
[]
Reverse closure for the type of a context. (This axiom is unnecessary; see ~ ax-cb1 .) Prefer ~ wctr . (New usage is discouraged.) (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wctl |- S : bool
$= ( ax-wctl ) ABCD $.
$p
wctl
hol
hol.mm
[]
[ "ax-wctl" ]
Reverse closure for the type of a context. (This axiom is unnecessary; see ~ ax-cb1 .) (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wctr |- T : bool
$= ( ax-wctr ) ABCD $.
$p
wctr
hol
hol.mm
[]
[ "ax-wctr" ]
Reverse closure for the type of a context. (This axiom is unnecessary; see ~ ax-cb1 .) (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
mpdan |- R |= T
$= ( ax-cb1 id syl2anc ) CAABABADFGDEH $.
$p
mpdan
hol
hol.mm
[]
[ "ax-cb1", "id", "syl2anc" ]
Modus ponens deduction. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
syldan |- ( R , S ) |= A
$= ( kct ax-cb1 wctl wctr simpl syl2anc ) ABCGZBDBCBCDMEHZIBCNJKEFL $.
$p
syldan
hol
hol.mm
[]
[ "ax-cb1", "kct", "simpl", "syl2anc", "wctl", "wctr" ]
Syllogism inference. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
simpld |- R |= S
$= ( kct ax-cb2 wctl wctr simpl syl ) ABCEZBDBCBCKADFZGBCLHIJ $.
$p
simpld
hol
hol.mm
[]
[ "ax-cb2", "kct", "simpl", "syl", "wctl", "wctr" ]
Extract an assumption from the context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
simprd |- R |= T
$= ( kct ax-cb2 wctl wctr simpr syl ) ABCEZCDBCBCKADFZGBCLHIJ $.
$p
simprd
hol
hol.mm
[]
[ "ax-cb2", "kct", "simpr", "syl", "wctl", "wctr" ]
Extract an assumption from the context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
trul |- R |= S
$= ( kt kct ax-cb1 wctr trud id syl2anc ) BADAADABDAECFGZHAKICJ $.
$p
trul
hol
hol.mm
[]
[ "ax-cb1", "id", "kct", "kt", "syl2anc", "trud", "wctr" ]
Deduction form of ~ tru . (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-weq |- = : ( al -> ( al -> bool ) ) $.
$a
ax-weq
hol
hol.mm
[]
[]
The equality function has type ` al -> al -> bool ` , i.e. it is polymorphic over all types, but the left and right type must agree. (New usage is discouraged.) (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
weq |- = : ( al -> ( al -> bool ) )
$= ( ax-weq ) AB $.
$p
weq
hol
hol.mm
[]
[ "ax-weq" ]
The equality function has type ` al -> al -> bool ` , i.e. it is polymorphic over all types, but the left and right type must agree. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-refl |- T. |= ( ( = A ) A ) $.
$a
ax-refl
hol
hol.mm
[]
[]
Reflexivity of equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wtru |- T. : bool
$= ( ke kc kt hb ht weq ax-refl ax-cb1 ) AABABCDDDEEADFGH $.
$p
wtru
hol
hol.mm
[]
[ "ax-cb1", "ax-refl", "hb", "ht", "kc", "ke", "kt", "weq" ]
Truth type. (Contributed by Mario Carneiro, 10-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
tru |- T. |= T.
$= ( kt wtru id ) ABC $.
$p
tru
hol
hol.mm
[]
[ "id", "kt", "wtru" ]
Tautology is provable. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-eqmp |- R |= B $.
$a
ax-eqmp
hol
hol.mm
[]
[]
Modus ponens for equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-ded |- R |= ( ( = S ) T ) $.
$a
ax-ded
hol
hol.mm
[]
[]
Deduction theorem for equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-wct |- ( S , T ) : bool $.
$a
ax-wct
hol
hol.mm
[]
[]
The type of a context. (Contributed by Mario Carneiro, 7-Oct-2014.) (New usage is discouraged.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wct |- ( S , T ) : bool
$= ( ax-wct ) ABCDE $.
$p
wct
hol
hol.mm
[]
[ "ax-wct" ]
The type of a context. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-wc |- ( F T ) : be $.
$a
ax-wc
hol
hol.mm
[]
[]
The type of a combination. (Contributed by Mario Carneiro, 7-Oct-2014.) (New usage is discouraged.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wc |- ( F T ) : be
$= ( ax-wc ) ABCDEFG $.
$p
wc
hol
hol.mm
[]
[ "ax-wc" ]
The type of a combination. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-ceq |- ( ( ( = F ) T ) , ( ( = A ) B ) ) |= ( ( = ( F A ) ) ( T B ) ) $.
$a
ax-ceq
hol
hol.mm
[]
[]
Equality theorem for combination. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
eqcomx |- R |= ( ( = B ) A )
$= ( ke kc ax-cb1 ax-refl a1i hb ht weq ax-ceq syl2anc wc ax-eqmp ) HBIZBIZH CIZBIZDUADTCIZDGJZABEKLZHUAIUCIDHTIUBIZUAUGDHHIHIZUDUHDUEAAMNZNHAOZKLGAUI BCHHUJUJEFPQUFAMBBTUBAUIHBUJERAUIHCUJFREEPQS $.
$p
eqcomx
hol
hol.mm
[]
[ "a1i", "ax-cb1", "ax-ceq", "ax-eqmp", "ax-refl", "hb", "ht", "kc", "ke", "syl2anc", "wc", "weq" ]
Commutativity of equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
mpbirx |- R |= B
$= ( hb ax-cb2 eqcomx ax-eqmp ) ABCEGBACDACEHFIJ $.
$p
mpbirx
hol
hol.mm
[]
[ "ax-cb2", "ax-eqmp", "eqcomx", "hb" ]
Deduction from equality inference. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ancoms |- ( S , R ) |= T
$= ( kct ax-cb1 wctr wctl simpr simpl syl2anc ) CBAEABBAABCABEDFZGZABLHZIBAM NJDK $.
$p
ancoms
hol
hol.mm
[]
[ "ax-cb1", "kct", "simpl", "simpr", "syl2anc", "wctl", "wctr" ]
Swap the two elements of a context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
adantr |- ( R , S ) |= T
$= ( kct ax-cb1 simpl syl ) ABFACABCADGEHDI $.
$p
adantr
hol
hol.mm
[]
[ "ax-cb1", "kct", "simpl", "syl" ]
Extract an assumption from the context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
adantl |- ( S , R ) |= T
$= ( adantr ancoms ) ABCABCDEFG $.
$p
adantl
hol
hol.mm
[]
[ "adantr", "ancoms" ]
Extract an assumption from the context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ct1 |- ( R , T ) |= ( S , T )
$= ( kct adantr ax-cb1 simpr jca ) ACFBCACBDEGACBADHEIJ $.
$p
ct1
hol
hol.mm
[]
[ "adantr", "ax-cb1", "jca", "kct", "simpr" ]
Introduce a right conjunct. (Contributed by Mario Carneiro, 30-Sep-2023.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ct2 |- ( T , R ) |= ( T , S )
$= ( kct ax-cb1 simpl adantl jca ) CAFCBCAEBADGHACBDEIJ $.
$p
ct2
hol
hol.mm
[]
[ "adantl", "ax-cb1", "jca", "kct", "simpl" ]
Introduce a left conjunct. (Contributed by Mario Carneiro, 30-Sep-2023.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
sylan |- ( R , T ) |= A
$= ( kct ax-cb1 wctr adantr simpr syl2anc ) ABDGCDBDCECDACDGFHIZJBDCBEHMKFL $.
$p
sylan
hol
hol.mm
[]
[ "adantr", "ax-cb1", "kct", "simpr", "syl2anc", "wctr" ]
Syllogism inference. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
an32s |- ( ( R , T ) , S ) |= A
$= ( kct ax-cb1 wctl wctr simpl ct1 simpr adantr syl2anc ) ABDFZCFBCFZDOBCBD BCPDAPDFEGZHZHZPDQIZJBCRIZKOCDBDSTLUAMEN $.
$p
an32s
hol
hol.mm
[]
[ "adantr", "ax-cb1", "ct1", "kct", "simpl", "simpr", "syl2anc", "wctl", "wctr" ]
Commutation identity for context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
anasss |- ( R , ( S , T ) ) |= A
$= ( kct ax-cb1 wctl id ancoms sylan an32s ) CDFBAACBDACBFBCFZDBCMMMDAMDFEGH IJEKLJ $.
$p
anasss
hol
hol.mm
[]
[ "an32s", "ancoms", "ax-cb1", "id", "kct", "sylan", "wctl" ]
Associativity for context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
anassrs |- ( ( R , S ) , T ) |= A
$= ( kct ax-cb1 wctl wctr simpl adantr simpr ct1 syl2anc ) ABCFZDFBCDFZODBBC BPABPFEGZHZCDBPQIZHZJCDSIZKOCDBCRTLUAMEN $.
$p
anassrs
hol
hol.mm
[]
[ "adantr", "ax-cb1", "ct1", "kct", "simpl", "simpr", "syl2anc", "wctl", "wctr" ]
Associativity for context. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-wv |- x : al : al $.
$a
ax-wv
hol
hol.mm
[]
[]
The type of a typed variable. (New usage is discouraged.) (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wv |- x : al : al
$= ( ax-wv ) ABC $.
$p
wv
hol
hol.mm
[]
[ "ax-wv" ]
The type of a typed variable. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-wl |- \ x : al . T : ( al -> be ) $.
$a
ax-wl
hol
hol.mm
[]
[]
The type of a lambda abstraction. (New usage is discouraged.) (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wl |- \ x : al . T : ( al -> be )
$= ( ax-wl ) ABCDEF $.
$p
wl
hol
hol.mm
[]
[ "ax-wl" ]
The type of a lambda abstraction. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-beta |- T. |= ( ( = ( \ x : al . A x : al ) ) A ) $.
$a
ax-beta
hol
hol.mm
[]
[]
Axiom of beta-substitution. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-distrc |- T. |= ( ( = ( \ x : al . ( F A ) B ) ) ( ( \ x : al . F B ) ( \ x : al . A B ) ) ) $.
$a
ax-distrc
hol
hol.mm
[]
[]
Distribution of combination over substitution. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-leq |- R |= ( ( = \ x : al . A ) \ x : al . B ) $.
$a
ax-leq
hol
hol.mm
[]
[]
Equality theorem for abstraction. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-distrl |- T. |= ( ( = ( \ x : al . \ y : be . A B ) ) \ y : be . ( \ x : al . A B ) ) $.
$a
ax-distrl
hol
hol.mm
[]
[]
Distribution of lambda abstraction over substitution. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-wov |- [ A F B ] : ga $.
$a
ax-wov
hol
hol.mm
[]
[]
Type of an infix operator. (New usage is discouraged.) (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
wov |- [ A F B ] : ga
$= ( ax-wov ) ABCDEFGHIJ $.
$p
wov
hol
hol.mm
[]
[ "ax-wov" ]
Type of an infix operator. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
df-ov |- T. |= ( ( = [ A F B ] ) ( ( F A ) B ) ) $.
$a
df-ov
hol
hol.mm
[]
[]
Infix operator. This is a simple metamath way of cleaning up the syntax of all these infix operators to make them a bit more readable than the curried representation. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
dfov1 |- R |= ( ( F A ) B )
$= ( kbr kc ke ax-cb1 hb df-ov a1i ax-eqmp ) CDEKZECLDLZFJMSLTLFSFJNABOCDE GHIPQR $.
$p
dfov1
hol
hol.mm
[]
[ "a1i", "ax-cb1", "ax-eqmp", "df-ov", "hb", "kbr", "kc", "ke" ]
Forward direction of ~ df-ov . (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
dfov2 |- R |= [ A F B ]
$= ( kc kbr hb wov ke ax-cb1 df-ov a1i mpbirx ) ECKDKZCDELZFABMCDEGHINJOUAKT KFTFJPABMCDEGHIQRS $.
$p
dfov2
hol
hol.mm
[]
[ "a1i", "ax-cb1", "df-ov", "hb", "kbr", "kc", "ke", "mpbirx", "wov" ]
Reverse direction of ~ df-ov . (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
weqi |- [ A = B ] : bool
$= ( hb ke weq wov ) AAFBCGAHDEI $.
$p
weqi
hol
hol.mm
[]
[ "hb", "ke", "weq", "wov" ]
Type of an equality. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-eqtypi |- B : al $.
$a
ax-eqtypi
hol
hol.mm
[]
[]
Deduce equality of types from equality of expressions. (This is unnecessary but eliminates a lot of hypotheses.) (New usage is discouraged.) (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
eqtypi |- B : al
$= ( ax-eqtypi ) ABCDEFG $.
$p
eqtypi
hol
hol.mm
[]
[ "ax-eqtypi" ]
Deduce equality of types from equality of expressions. (This is unnecessary but eliminates a lot of hypotheses.) (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
eqcomi |- R |= [ B = A ]
$= ( ke weq eqtypi dfov1 eqcomx dfov2 ) AACBGDAHZABCDEFIZEABCDENAABCGDMENFJK L $.
$p
eqcomi
hol
hol.mm
[]
[ "dfov1", "dfov2", "eqcomx", "eqtypi", "ke", "weq" ]
Commutativity of equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ax-eqtypri |- B : al $.
$a
ax-eqtypri
hol
hol.mm
[]
[]
Deduce equality of types from equality of expressions. (This is unnecessary but eliminates a lot of hypotheses.) (New usage is discouraged.) (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
eqtypri |- B : al
$= ( ax-eqtypri ) ABCDEFG $.
$p
eqtypri
hol
hol.mm
[]
[ "ax-eqtypri" ]
Deduce equality of types from equality of expressions. (This is unnecessary but eliminates a lot of hypotheses.) (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
mpbi |- R |= B
$= ( hb ke weq ax-cb2 eqtypi dfov1 ax-eqmp ) ABCDFFABGCFHACDIZFABCMEJEKL $.
$p
mpbi
hol
hol.mm
[]
[ "ax-cb2", "ax-eqmp", "dfov1", "eqtypi", "hb", "ke", "weq" ]
Deduction from equality inference. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
eqid |- R |= [ A = A ]
$= ( ke weq kc ax-refl a1i dfov2 ) AABBFCAGEEFBHBHCDABEIJK $.
$p
eqid
hol
hol.mm
[]
[ "a1i", "ax-refl", "dfov2", "kc", "ke", "weq" ]
Reflexivity of equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ded |- R |= [ S = T ]
$= ( hb ke weq kct ax-cb2 ax-ded dfov2 ) FFBCGAFHBACIEJCABIDJABCDEKL $.
$p
ded
hol
hol.mm
[]
[ "ax-cb2", "ax-ded", "dfov2", "hb", "kct", "ke", "weq" ]
Deduction theorem for equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
dedi |- T. |= [ S = T ]
$= ( kt wtru adantl ded ) EABAEBCFGBEADFGH $.
$p
dedi
hol
hol.mm
[]
[ "adantl", "ded", "kt", "wtru" ]
Deduction theorem for equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
eqtru |- R |= [ T. = A ]
$= ( kt wtru adantr kct ax-cb1 ax-cb2 wct tru a1i ded ) BDABDACEFDBAGBAABCHA BCIJKLM $.
$p
eqtru
hol
hol.mm
[]
[ "a1i", "adantr", "ax-cb1", "ax-cb2", "ded", "kct", "kt", "tru", "wct", "wtru" ]
If a statement is provable, then it is equivalent to truth. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
mpbir |- R |= B
$= ( hb ax-cb2 eqtypri eqcomi mpbi ) ABCDFBACFABCACDGEHEIJ $.
$p
mpbir
hol
hol.mm
[]
[ "ax-cb2", "eqcomi", "eqtypri", "hb", "mpbi" ]
Deduction from equality inference. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ceq12 |- R |= [ ( F A ) = ( T B ) ]
$= ( kc ke weq wc ht eqtypi dfov1 ax-ceq syl2anc dfov2 ) BBECLZGDLZMFBNA BECHIOABGDABPZEGFHJQZACDFIKQZOMUBLUCLFMELGLMCLDLUDUDEGMFUDNHUEJRAACDM FANIUFKRABCDEGHUEIUFSTUA $.
$p
ceq12
hol
hol.mm
[]
[ "ax-ceq", "dfov1", "dfov2", "eqtypi", "ht", "kc", "ke", "syl2anc", "wc", "weq" ]
Equality theorem for combination. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ceq1 |- R |= [ ( F A ) = ( T A ) ]
$= ( ke kbr ax-cb1 eqid ceq12 ) ABCCDEFGHIACEDFJKEILHMN $.
$p
ceq1
hol
hol.mm
[]
[ "ax-cb1", "ceq12", "eqid", "kbr", "ke" ]
Equality theorem for combination. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
ceq2 |- R |= [ ( F A ) = ( F B ) ]
$= ( ht ke kbr ax-cb1 eqid ceq12 ) ABCDEFEGHABJEFCDKLFIMGNIO $.
$p
ceq2
hol
hol.mm
[]
[ "ax-cb1", "ceq12", "eqid", "ht", "kbr", "ke" ]
Equality theorem for combination. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
leq |- R |= [ \ x : al . A = \ x : al . B ]
$= ( ht kl ke weq wl eqtypi dfov1 ax-leq dfov2 ) ABIZRACDJACEJKFRLABCDGMABCE BDEFGHNZMABCDEFGSBBDEKFBLGSHOPQ $.
$p
leq
hol
hol.mm
[]
[ "ax-leq", "dfov1", "dfov2", "eqtypi", "ht", "ke", "kl", "weq", "wl" ]
Equality theorem for lambda abstraction. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
beta |- T. |= [ ( \ x : al . A x : al ) = A ]
$= ( kl tv kc ke kt weq wl wv wc ax-beta dfov2 ) BBACDFZACGZHDIJBKABQRABCDEL ACMNEABCDEOP $.
$p
beta
hol
hol.mm
[]
[ "ax-beta", "dfov2", "kc", "ke", "kl", "kt", "tv", "wc", "weq", "wl", "wv" ]
Axiom of beta-substitution. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
distrc |- T. |= [ ( \ x : al . ( F A ) B ) = ( ( \ x : al . F B ) ( \ x : al . A B ) ) ]
$= ( kc kl ke kt weq wc wl ht ax-distrc dfov2 ) CCADGEKZLZFKADGLZFKZADELZFKZ KMNCOACUBFACDUABCGEHIPQJPBCUDUFABCRZUCFAUGDGHQJPABUEFABDEIQJPPABCDEFGIJHS T $.
$p
distrc
hol
hol.mm
[]
[ "ax-distrc", "dfov2", "ht", "kc", "ke", "kl", "kt", "wc", "weq", "wl" ]
Distribution of combination over substitution. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
distrl |- T. |= [ ( \ x : al . \ y : be . A B ) = \ y : be . ( \ x : al . A B ) ]
$= ( ht kl kc ke kt weq wl wc ax-distrl dfov2 ) BCJZTADBEFKZKZGLBEADFKZGLZKM NTOATUBGATDUABCEFHPPIQBCEUDACUCGACDFHPIQPABCDEFGHIRS $.
$p
distrl
hol
hol.mm
[]
[ "ax-distrl", "dfov2", "ht", "kc", "ke", "kl", "kt", "wc", "weq", "wl" ]
Distribution of lambda abstraction over substitution. (Contributed by Mario Carneiro, 8-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
eqtri |- R |= [ A = C ]
$= ( ke weq eqtypi kc dfov1 hb ht wc ceq2 mpbi dfov2 ) AABDIEAJZFACDEABCEFGK ZHKIBLZCLUBDLEAABCIETFUAGMANCDUBEAANOIBTFPUAHQRS $.
$p
eqtri
hol
hol.mm
[]
[ "ceq2", "dfov1", "dfov2", "eqtypi", "hb", "ht", "kc", "ke", "mpbi", "wc", "weq" ]
Transitivity of equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
3eqtr4i |- R |= [ S = T ]
$= ( eqtypri eqtypi eqcomi eqtri ) AEBFDABEDGIKIABCFDGHAFCDACFDABCDGHLJKJM NN $.
$p
3eqtr4i
hol
hol.mm
[]
[ "eqcomi", "eqtri", "eqtypi", "eqtypri" ]
Transitivity of equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
3eqtr3i |- R |= [ S = T ]
$= ( eqcomi eqtypi 3eqtr4i ) ABCDEFGHABEDGIKACFDABCDGHLJKM $.
$p
3eqtr3i
hol
hol.mm
[]
[ "3eqtr4i", "eqcomi", "eqtypi" ]
Transitivity of equality. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
oveq123 |- R |= [ [ A F B ] = [ C S T ] ]
$= ( kc kbr wc ke ht ceq12 weq wov ax-cb1 df-ov a1i dfov2 eqtypi 3eqtr4i ) CGDQZEQZIFQZJQZHDEGRZFJIRZBCUKEABCUAZGDKLSZMSZBCEJUKHUMURMAUQDFGHIKLNOU BPUBCCUOULTHCUCZABCDEGKLMUDUSTUOQULQHGITRHNUEZABCDEGKLMUFUGUHCCUPUNTHUT ABCFJIAUQUAGIHKNUIZADFHLOUIZBEJHMPUIZUDBCUMJAUQIFVBVCSVDSTUPQUNQHVAAB...
$p
oveq123
hol
hol.mm
[]
[ "3eqtr4i", "a1i", "ax-cb1", "ceq12", "df-ov", "dfov2", "eqtypi", "ht", "kbr", "kc", "ke", "wc", "weq", "wov" ]
Equality theorem for binary operation. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
oveq1 |- R |= [ [ A F B ] = [ C F B ] ]
$= ( ht ke kbr ax-cb1 eqid oveq123 ) ABCDEFGHGEIJKABCMMGHDFNOHLPZIQLBEHSKQ R $.
$p
oveq1
hol
hol.mm
[]
[ "ax-cb1", "eqid", "ht", "kbr", "ke", "oveq123" ]
Equality theorem for binary operation. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
oveq12 |- R |= [ [ A F B ] = [ C F T ] ]
$= ( ht ke kbr ax-cb1 eqid oveq123 ) ABCDEFGHGIJKLABCOOGHDFPQHMRJSMNT $.
$p
oveq12
hol
hol.mm
[]
[ "ax-cb1", "eqid", "ht", "kbr", "ke", "oveq123" ]
Equality theorem for binary operation. (Contributed by Mario Carneiro, 7-Oct-2014.)
https://github.com/metamath/set.mm
160dfc7e4ec5f201f5bae4ca5a5eeb67242902b5
End of preview. Expand in Data Studio

Metamath

A structured dataset of formally verified theorems and axioms from Metamath, one of the largest collections of rigorously verified mathematics in the world.

Source

Schema

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

Statistics

  • Entries: 63,141
  • With proof: 59,651 (94.5%)
  • With docstring: 63,141 (100.0%)
  • Libraries: 5

By type

Type Count
$p 59,651
$a 3,490

Example

eqcomx |- R |= ( ( = B ) A )
$=
      ( ke kc ax-cb1 ax-refl a1i hb ht weq ax-ceq syl2anc wc ax-eqmp ) HBIZBIZH
      CIZBIZDUADTCIZDGJZABEKLZHUAIUCIDHTIUBIZUAUGDHHIHIZUDUHDUEAAMNZNHAOZKLGAUI
      BCHHUJUJEFPQUFAMBBTUBAUIHBUJERAUIHCUJFREEPQS $.
  • type: $p | symbolic_name: eqcomx | hol.mm

Use

Each 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.

Citation

@misc{metamath_dataset,
  title  = {Metamath},
  author = {Norton, Charles},
  year   = {2026},
  note   = {Extracted from https://github.com/metamath/set.mm, commit 160dfc7e4ec5},
  url    = {https://huggingface.co/datasets/phanerozoic/Metamath}
}
Downloads last month
53

Collection including phanerozoic/Metamath