P. 314 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 31301-31400   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	cvmlift3lem1 31301*	Lemma for cvmlift3 31310. (Contributed by Mario Carneiro, 6-Jul-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   &    |- ( ph -> M e. ( II Cn K ) )   &    |- ( ph -> ( M ` 0 ) = O )   &    |- ( ph -> N e. ( II Cn K ) )   &    |- ( ph -> ( N ` 0 ) = O )   &    |- ( ph -> ( M ` 1 ) = ( N ` 1 ) )   =>    |- ( ph -> ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. M ) /\ ( g ` 0 ) = P ) ) ` 1 ) = ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. N ) /\ ( g ` 0 ) = P ) ) ` 1 ) )
Theorem	cvmlift3lem2 31302*	Lemma for cvmlift2 31298. (Contributed by Mario Carneiro, 6-Jul-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   =>    |- ( ( ph /\ X e. Y ) -> E! z e. B E. f e. ( II Cn K ) ( ( f ` 0 ) = O /\ ( f ` 1 ) = X /\ ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. f ) /\ ( g ` 0 ) = P ) ) ` 1 ) = z ) )
Theorem	cvmlift3lem3 31303*	Lemma for cvmlift2 31298. (Contributed by Mario Carneiro, 6-Jul-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   &    |- H = ( x e. Y |-> ( iota_ z e. B E. f e. ( II Cn K ) ( ( f ` 0 ) = O /\ ( f ` 1 ) = x /\ ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. f ) /\ ( g ` 0 ) = P ) ) ` 1 ) = z ) ) )   =>    |- ( ph -> H : Y --> B )
Theorem	cvmlift3lem4 31304*	Lemma for cvmlift2 31298. (Contributed by Mario Carneiro, 6-Jul-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   &    |- H = ( x e. Y |-> ( iota_ z e. B E. f e. ( II Cn K ) ( ( f ` 0 ) = O /\ ( f ` 1 ) = x /\ ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. f ) /\ ( g ` 0 ) = P ) ) ` 1 ) = z ) ) )   =>    |- ( ( ph /\ X e. Y ) -> ( ( H ` X ) = A <-> E. f e. ( II Cn K ) ( ( f ` 0 ) = O /\ ( f ` 1 ) = X /\ ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. f ) /\ ( g ` 0 ) = P ) ) ` 1 ) = A ) ) )
Theorem	cvmlift3lem5 31305*	Lemma for cvmlift2 31298. (Contributed by Mario Carneiro, 6-Jul-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   &    |- H = ( x e. Y |-> ( iota_ z e. B E. f e. ( II Cn K ) ( ( f ` 0 ) = O /\ ( f ` 1 ) = x /\ ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. f ) /\ ( g ` 0 ) = P ) ) ` 1 ) = z ) ) )   =>    |- ( ph -> ( F o. H ) = G )
Theorem	cvmlift3lem6 31306*	Lemma for cvmlift3 31310. (Contributed by Mario Carneiro, 9-Jul-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   &    |- H = ( x e. Y |-> ( iota_ z e. B E. f e. ( II Cn K ) ( ( f ` 0 ) = O /\ ( f ` 1 ) = x /\ ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. f ) /\ ( g ` 0 ) = P ) ) ` 1 ) = z ) ) )   &    |- S = ( k e. J |-> { s e. ( ~P C \ { (/) } ) | ( U. s = ( `' F " k ) /\ A. c e. s ( A. d e. ( s \ { c } ) ( c i^i d ) = (/) /\ ( F |` c ) e. ( ( C ↾t c ) Homeo ( J ↾t k ) ) ) ) } )   &    |- ( ph -> ( G ` X ) e. A )   &    |- ( ph -> T e. ( S ` A ) )   &    |- ( ph -> M C_ ( `' G " A ) )   &    |- W = ( iota_ b e. T ( H ` X ) e. b )   &    |- ( ph -> X e. M )   &    |- ( ph -> Z e. M )   &    |- ( ph -> Q e. ( II Cn K ) )   &    |- R = ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. Q ) /\ ( g ` 0 ) = P ) )   &    |- ( ph -> ( ( Q ` 0 ) = O /\ ( Q ` 1 ) = X /\ ( R ` 1 ) = ( H ` X ) ) )   &    |- ( ph -> N e. ( II Cn ( K ↾t M ) ) )   &    |- ( ph -> ( ( N ` 0 ) = X /\ ( N ` 1 ) = Z ) )   &    |- I = ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. N ) /\ ( g ` 0 ) = ( H ` X ) ) )   =>    |- ( ph -> ( H ` Z ) e. W )
Theorem	cvmlift3lem7 31307*	Lemma for cvmlift3 31310. (Contributed by Mario Carneiro, 9-Jul-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   &    |- H = ( x e. Y |-> ( iota_ z e. B E. f e. ( II Cn K ) ( ( f ` 0 ) = O /\ ( f ` 1 ) = x /\ ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. f ) /\ ( g ` 0 ) = P ) ) ` 1 ) = z ) ) )   &    |- S = ( k e. J |-> { s e. ( ~P C \ { (/) } ) | ( U. s = ( `' F " k ) /\ A. c e. s ( A. d e. ( s \ { c } ) ( c i^i d ) = (/) /\ ( F |` c ) e. ( ( C ↾t c ) Homeo ( J ↾t k ) ) ) ) } )   &    |- ( ph -> ( G ` X ) e. A )   &    |- ( ph -> T e. ( S ` A ) )   &    |- ( ph -> M C_ ( `' G " A ) )   &    |- W = ( iota_ b e. T ( H ` X ) e. b )   &    |- ( ph -> ( K ↾t M ) e. PConn )   &    |- ( ph -> V e. K )   &    |- ( ph -> V C_ M )   &    |- ( ph -> X e. V )   =>    |- ( ph -> H e. ( ( K CnP C ) ` X ) )
Theorem	cvmlift3lem8 31308*	Lemma for cvmlift2 31298. (Contributed by Mario Carneiro, 6-Jul-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   &    |- H = ( x e. Y |-> ( iota_ z e. B E. f e. ( II Cn K ) ( ( f ` 0 ) = O /\ ( f ` 1 ) = x /\ ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. f ) /\ ( g ` 0 ) = P ) ) ` 1 ) = z ) ) )   &    |- S = ( k e. J |-> { s e. ( ~P C \ { (/) } ) | ( U. s = ( `' F " k ) /\ A. c e. s ( A. d e. ( s \ { c } ) ( c i^i d ) = (/) /\ ( F |` c ) e. ( ( C ↾t c ) Homeo ( J ↾t k ) ) ) ) } )   =>    |- ( ph -> H e. ( K Cn C ) )
Theorem	cvmlift3lem9 31309*	Lemma for cvmlift2 31298. (Contributed by Mario Carneiro, 7-May-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   &    |- H = ( x e. Y |-> ( iota_ z e. B E. f e. ( II Cn K ) ( ( f ` 0 ) = O /\ ( f ` 1 ) = x /\ ( ( iota_ g e. ( II Cn C ) ( ( F o. g ) = ( G o. f ) /\ ( g ` 0 ) = P ) ) ` 1 ) = z ) ) )   &    |- S = ( k e. J |-> { s e. ( ~P C \ { (/) } ) | ( U. s = ( `' F " k ) /\ A. c e. s ( A. d e. ( s \ { c } ) ( c i^i d ) = (/) /\ ( F |` c ) e. ( ( C ↾t c ) Homeo ( J ↾t k ) ) ) ) } )   =>    |- ( ph -> E. f e. ( K Cn C ) ( ( F o. f ) = G /\ ( f ` O ) = P ) )
Theorem	cvmlift3 31310*	A general version of cvmlift 31281. If K is simply connected and weakly locally path-connected, then there is a unique lift of functions on K which commutes with the covering map. (Contributed by Mario Carneiro, 9-Jul-2015.)
|- B = U. C   &    |- Y = U. K   &    |- ( ph -> F e. ( C CovMap J ) )   &    |- ( ph -> K e. SConn )   &    |- ( ph -> K e. 𝑛Locally PConn )   &    |- ( ph -> O e. Y )   &    |- ( ph -> G e. ( K Cn J ) )   &    |- ( ph -> P e. B )   &    |- ( ph -> ( F ` P ) = ( G ` O ) )   =>    |- ( ph -> E! f e. ( K Cn C ) ( ( F o. f ) = G /\ ( f ` O ) = P ) )
20.5.9  Normal numbers
Theorem	snmlff 31311*	The function F from snmlval 31313 is a mapping from positive integers to real numbers in the range [ 0 , 1 ]. (Contributed by Mario Carneiro, 6-Apr-2015.)
|- F = ( n e. NN |-> ( ( # ` { k e. ( 1 ... n ) | ( |_ ` ( ( A x. ( R ^ k ) ) mod R ) ) = B } ) / n ) )   =>    |- F : NN --> ( 0 [,] 1 )
Theorem	snmlfval 31312*	The function F from snmlval 31313 maps N to the relative density of B in the first N digits of the digit string of A in base R. (Contributed by Mario Carneiro, 6-Apr-2015.)
|- F = ( n e. NN |-> ( ( # ` { k e. ( 1 ... n ) | ( |_ ` ( ( A x. ( R ^ k ) ) mod R ) ) = B } ) / n ) )   =>    |- ( N e. NN -> ( F ` N ) = ( ( # ` { k e. ( 1 ... N ) | ( |_ ` ( ( A x. ( R ^ k ) ) mod R ) ) = B } ) / N ) )
Theorem	snmlval 31313*	The property " A is simply normal in base R". A number is simply normal if each digit 0 <_ b < R occurs in the base- R digit string of A with frequency 1 / R (which is consistent with the expectation in an infinite random string of numbers selected from 0 ... R - 1). (Contributed by Mario Carneiro, 6-Apr-2015.)
|- S = ( r e. ( ZZ>= ` 2 ) |-> { x e. RR | A. b e. ( 0 ... ( r - 1 ) ) ( n e. NN |-> ( ( # ` { k e. ( 1 ... n ) | ( |_ ` ( ( x x. ( r ^ k ) ) mod r ) ) = b } ) / n ) ) ~~> ( 1 / r ) } )   =>    |- ( A e. ( S ` R ) <-> ( R e. ( ZZ>= ` 2 ) /\ A e. RR /\ A. b e. ( 0 ... ( R - 1 ) ) ( n e. NN |-> ( ( # ` { k e. ( 1 ... n ) | ( |_ ` ( ( A x. ( R ^ k ) ) mod R ) ) = b } ) / n ) ) ~~> ( 1 / R ) ) )
Theorem	snmlflim 31314*	If A is simply normal, then the function F of relative density of B in the digit string converges to 1 / R, i.e. the set of occurrences of B in the digit string has natural density 1 / R. (Contributed by Mario Carneiro, 6-Apr-2015.)
|- S = ( r e. ( ZZ>= ` 2 ) |-> { x e. RR | A. b e. ( 0 ... ( r - 1 ) ) ( n e. NN |-> ( ( # ` { k e. ( 1 ... n ) | ( |_ ` ( ( x x. ( r ^ k ) ) mod r ) ) = b } ) / n ) ) ~~> ( 1 / r ) } )   &    |- F = ( n e. NN |-> ( ( # ` { k e. ( 1 ... n ) | ( |_ ` ( ( A x. ( R ^ k ) ) mod R ) ) = B } ) / n ) )   =>    |- ( ( A e. ( S ` R ) /\ B e. ( 0 ... ( R - 1 ) ) ) -> F ~~> ( 1 / R ) )
20.5.10  Godel-sets of formulas
Syntax	cgoe 31315	The Godel-set of membership.
class e.g
Syntax	cgna 31316	The Godel-set for the Sheffer stroke.
class |g
Syntax	cgol 31317	The Godel-set of universal quantification. (Note that this is not a wff.)
class A.g N U
Syntax	csat 31318	The satisfaction function.
class Sat
Syntax	cfmla 31319	The formula set predicate.
class Fmla
Syntax	csate 31320	The e.-satisfaction function.
class SatE
Syntax	cprv 31321	The "proves" relation.
class |=
Definition	df-goel 31322	Define the Godel-set of membership. Here the arguments x = <. N , P >. correspond to vN and vP , so ( (/) e.g 1o ) actually means v0 e. v1 , not 0 e. 1. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- e.g = ( x e. ( om X. om ) |-> <. (/) , x >. )
Definition	df-gona 31323	Define the Godel-set for the Sheffer stroke NAND. Here the arguments x = <. U , V >. are also Godel-sets corresponding to smaller formulae. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- |g = ( x e. ( _V X. _V ) |-> <. 1o , x >. )
Definition	df-goal 31324	Define the Godel-set of universal quantification. Here N e. om corresponds to vN , and U represents another formula, and this expression is [ A. x ph ] = A.g N U where x is the N-th variable, U = [ ph ] is the code for ph. Note that this is a class expression, not a wff. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- A.g N U = <. 2o , <. N , U >. >.
Definition	df-sat 31325*	Define the satisfaction predicate. This recursive construction builds up a function over wff codes and simultaneously defines the set of assignments to all variables from M that makes the coded wff true in the model M, where e. is interpreted as the binary relation E on M. The interpretation of the statement S e. ( ( ( M Sat E ) ` n ) ` U ) is that for the model <. M , E >., S : om --> M is a valuation of the variables (v0 = ( S ` (/) ), v1 = ( S ` 1o ), etc.) and U is a code for a wff using e. , -/\ , A. that is true under the assignment S. The function is defined by finite recursion; ( ( M Sat E ) ` n ) only operates on wffs of depth at most n e. om, and ( ( M Sat E ) ` om ) = U_ n e. om ( ( M Sat E ) ` n ) operates on all wffs. The coding scheme for the wffs is defined so that vi e. vj is coded as <. (/) , <. i , j >. >., ( ph -/\ ps ) is coded as <. 1o , <. ph , ps >. >., and A. vi ph is coded as <. 2o , <. i , ph >. >.. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- Sat = ( m e. _V , e e. _V |-> ( rec ( ( f e. _V |-> ( f u. { <. x , y >. | E. u e. f ( E. v e. f ( x = ( ( 1st ` u ) |g ( 1st ` v ) ) /\ y = ( ( m ^m om ) \ ( ( 2nd ` u ) i^i ( 2nd ` v ) ) ) ) \/ E. i e. om ( x = A.g i ( 1st ` u ) /\ y = { a e. ( m ^m om ) | A. z e. m ( { <. i , z >. } u. ( a |` ( om \ { i } ) ) ) e. ( 2nd ` u ) } ) ) } ) ) , { <. x , y >. | E. i e. om E. j e. om ( x = ( i e.g j ) /\ y = { a e. ( m ^m om ) | ( a ` i ) e ( a ` j ) } ) } ) |` suc om ) )
Definition	df-sate 31326*	A simplified version of the satisfaction predicate, using the standard membership relation and eliminating the extra variable n. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- SatE = ( m e. _V , u e. _V |-> ( ( ( m Sat ( _E i^i ( m X. m ) ) ) ` om ) ` u ) )
Definition	df-fmla 31327	Define the predicate which defines the set of valid Godel formulas. The parameter n defines the maximum height of the formulas: the set ( Fmla ` (/) ) is all formulas of the form x = y or x e. y (which in our coding scheme is the set ( { (/) , 1o } X. ( om X. om ) ); see df-sat 31325 for the full coding scheme), and each extra level adds to the complexity of the formulas in ( Fmla ` n ). ( Fmla ` om ) = U_ n e. om ( Fmla ` n ) is the set of all valid formulas. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- Fmla = ( n e. suc om |-> dom ( ( (/) Sat (/) ) ` n ) )
Syntax	cgon 31328	The Godel-set of negation. (Note that this is not a wff.)
class -.g U
Syntax	cgoa 31329	The Godel-set of conjunction.
class /\g
Syntax	cgoi 31330	The Godel-set of implication.
class ->g
Syntax	cgoo 31331	The Godel-set of disjunction.
class \/g
Syntax	cgob 31332	The Godel-set of equivalence.
class <->g
Syntax	cgoq 31333	The Godel-set of equality.
class =g
Syntax	cgox 31334	The Godel-set of existential quantification. (Note that this is not a wff.)
class E.g N U
Definition	df-gonot 31335	Define the Godel-set of negation. Here the argument U is also a Godel-set corresponding to smaller formulae. Note that this is a class expression, not a wff. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- -.g U = ( U |g U )
Definition	df-goan 31336*	Define the Godel-set of conjunction. Here the arguments U and V are also Godel-sets corresponding to smaller formulae. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- /\g = ( u e. _V , v e. _V |-> -.g ( u |g v ) )
Definition	df-goim 31337*	Define the Godel-set of implication. Here the arguments U and V are also Godel-sets corresponding to smaller formulae. Note that this is a class expression, not a wff. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- ->g = ( u e. _V , v e. _V |-> ( u |g -.g v ) )
Definition	df-goor 31338*	Define the Godel-set of disjunction. Here the arguments U and V are also Godel-sets corresponding to smaller formulae. Note that this is a class expression, not a wff. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- \/g = ( u e. _V , v e. _V |-> ( -.g u ->g v ) )
Definition	df-gobi 31339*	Define the Godel-set of equivalence. Here the arguments U and V are also Godel-sets corresponding to smaller formulae. Note that this is a class expression, not a wff. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- <->g = ( u e. _V , v e. _V |-> ( ( u ->g v ) /\g ( v ->g u ) ) )
Definition	df-goeq 31340*	Define the Godel-set of equality. Here the arguments x = <. N , P >. correspond to vN and vP , so ( (/) =g 1o ) actually means v0 = v1 , not 0 = 1. Here we use the trick mentioned in ax-ext 2602 to introduce equality as a defined notion in terms of e.g. The expression suc ( u u. v ) = max ( u , v ) + 1 here is a convenient way of getting a dummy variable distinct from u and v. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- =g = ( u e. om , v e. om |-> [_ suc ( u u. v ) / w ]_ A.g w ( ( w e.g u ) <->g ( w e.g v ) ) )
Definition	df-goex 31341	Define the Godel-set of existential quantification. Here N e. om corresponds to vN , and U represents another formula, and this expression is [ E. x ph ] = E.g N U where x is the N-th variable, U = [ ph ] is the code for ph. Note that this is a class expression, not a wff. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- E.g N U = -.g A.g N -.g U
Definition	df-prv 31342*	Define the "proves" relation on a set. A wff is true in a model M if for every valuation s e. ( M ^m om ), the interpretation of the wff using the membership relation on M is true. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- |= = { <. m , u >. | ( m SatE u ) = ( m ^m om ) }
20.5.11  Models of ZF
Syntax	cgze 31343	The Axiom of Extensionality.
class AxExt
Syntax	cgzr 31344	The Axiom Scheme of Replacement.
class AxRep
Syntax	cgzp 31345	The Axiom of Power Sets.
class AxPow
Syntax	cgzu 31346	The Axiom of Unions.
class AxUn
Syntax	cgzg 31347	The Axiom of Regularity.
class AxReg
Syntax	cgzi 31348	The Axiom of Infinity.
class AxInf
Syntax	cgzf 31349	The set of models of ZF.
class ZF
Definition	df-gzext 31350	The Godel-set version of the Axiom of Extensionality. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- AxExt = ( A.g 2o ( ( 2o e.g (/) ) <->g ( 2o e.g 1o ) ) ->g ( (/) =g 1o ) )
Definition	df-gzrep 31351	The Godel-set version of the Axiom Scheme of Replacement. Since this is a scheme and not a single axiom, it manifests as a function on wffs, each giving rise to a different axiom. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- AxRep = ( u e. ( Fmla ` om ) |-> ( A.g 3o E.g 1o A.g 2o ( A.g 1o u ->g ( 2o =g 1o ) ) ->g A.g 1o A.g 2o ( ( 2o e.g 1o ) <->g E.g 3o ( ( 3o e.g (/) ) /\g A.g 1o u ) ) ) )
Definition	df-gzpow 31352	The Godel-set version of the Axiom of Power Sets. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- AxPow = E.g 1o A.g 2o ( A.g 1o ( ( 1o e.g 2o ) <->g ( 1o e.g (/) ) ) ->g ( 2o e.g 1o ) )
Definition	df-gzun 31353	The Godel-set version of the Axiom of Unions. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- AxUn = E.g 1o A.g 2o ( E.g 1o ( ( 2o e.g 1o ) /\g ( 1o e.g (/) ) ) ->g ( 2o e.g 1o ) )
Definition	df-gzreg 31354	The Godel-set version of the Axiom of Regularity. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- AxReg = ( E.g 1o ( 1o e.g (/) ) ->g E.g 1o ( ( 1o e.g (/) ) /\g A.g 2o ( ( 2o e.g 1o ) ->g -.g ( 2o e.g (/) ) ) ) )
Definition	df-gzinf 31355	The Godel-set version of the Axiom of Infinity. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- AxInf = E.g 1o ( ( (/) e.g 1o ) /\g A.g 2o ( ( 2o e.g 1o ) ->g E.g (/) ( ( 2o e.g (/) ) /\g ( (/) e.g 1o ) ) ) )
Definition	df-gzf 31356*	Define the class of all (transitive) models of ZF. (Contributed by Mario Carneiro, 14-Jul-2013.)
|- ZF = { m | ( ( Tr m /\ m |= AxExt /\ m |= AxPow ) /\ ( m |= AxUn /\ m |= AxReg /\ m |= AxInf ) /\ A. u e. ( Fmla ` om ) m |= ( AxRep ` u ) ) }
20.5.12  Metamath formal systems This is a formalization of Appendix C of the Metamath book, which describes the mathematical representation of a formal system, of which set.mm (this file) is one.
Syntax	cmcn 31357	The set of constants.
class mCN
Syntax	cmvar 31358	The set of variables.
class mVR
Syntax	cmty 31359	The type function.
class mType
Syntax	cmvt 31360	The set of variable typecodes.
class mVT
Syntax	cmtc 31361	The set of typecodes.
class mTC
Syntax	cmax 31362	The set of axioms.
class mAx
Syntax	cmrex 31363	The set of raw expressions.
class mREx
Syntax	cmex 31364	The set of expressions.
class mEx
Syntax	cmdv 31365	The set of distinct variables.
class mDV
Syntax	cmvrs 31366	The variables in an expression.
class mVars
Syntax	cmrsub 31367	The set of raw substitutions.
class mRSubst
Syntax	cmsub 31368	The set of substitutions.
class mSubst
Syntax	cmvh 31369	The set of variable hypotheses.
class mVH
Syntax	cmpst 31370	The set of pre-statements.
class mPreSt
Syntax	cmsr 31371	The reduct of a pre-statement.
class mStRed
Syntax	cmsta 31372	The set of statements.
class mStat
Syntax	cmfs 31373	The set of formal systems.
class mFS
Syntax	cmcls 31374	The closure of a set of statements.
class mCls
Syntax	cmpps 31375	The set of provable pre-statements.
class mPPSt
Syntax	cmthm 31376	The set of theorems.
class mThm
Definition	df-mcn 31377	Define the set of constants in a Metamath formal system. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mCN = Slot 1
Definition	df-mvar 31378	Define the set of variables in a Metamath formal system. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mVR = Slot 2
Definition	df-mty 31379	Define the type function in a Metamath formal system. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mType = Slot 3
Definition	df-mtc 31380	Define the set of typecodes in a Metamath formal system. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mTC = Slot 4
Definition	df-mmax 31381	Define the set of axioms in a Metamath formal system. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mAx = Slot 5
Definition	df-mvt 31382	Define the set of variable typecodes in a Metamath formal system. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mVT = ( t e. _V |-> ran (mType ` t ) )
Definition	df-mrex 31383	Define the set of "raw expressions", which are expressions without a typecode attached. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mREx = ( t e. _V |-> Word ( (mCN ` t ) u. (mVR ` t ) ) )
Definition	df-mex 31384	Define the set of expressions, which are strings of constants and variables headed by a typecode constant. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mEx = ( t e. _V |-> ( (mTC ` t ) X. (mREx ` t ) ) )
Definition	df-mdv 31385	Define the set of distinct variable conditions, which are pairs of distinct variables. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mDV = ( t e. _V |-> ( ( (mVR ` t ) X. (mVR ` t ) ) \ _I ) )
Definition	df-mvrs 31386*	Define the set of variables in an expression. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mVars = ( t e. _V |-> ( e e. (mEx ` t ) |-> ( ran ( 2nd ` e ) i^i (mVR ` t ) ) ) )
Definition	df-mrsub 31387*	Define a substitution of raw expressions given a mapping from variables to expressions. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mRSubst = ( t e. _V |-> ( f e. ( (mREx ` t ) ^pm (mVR ` t ) ) |-> ( e e. (mREx ` t ) |-> ( (freeMnd ` ( (mCN ` t ) u. (mVR ` t ) ) ) gsumg ( ( v e. ( (mCN ` t ) u. (mVR ` t ) ) |-> if ( v e. dom f , ( f ` v ) , <" v "> ) ) o. e ) ) ) ) )
Definition	df-msub 31388*	Define a substitution of expressions given a mapping from variables to expressions. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mSubst = ( t e. _V |-> ( f e. ( (mREx ` t ) ^pm (mVR ` t ) ) |-> ( e e. (mEx ` t ) |-> <. ( 1st ` e ) , ( ( (mRSubst ` t ) ` f ) ` ( 2nd ` e ) ) >. ) ) )
Definition	df-mvh 31389*	Define the mapping from variables to their variable hypothesis. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mVH = ( t e. _V |-> ( v e. (mVR ` t ) |-> <. ( (mType ` t ) ` v ) , <" v "> >. ) )
Definition	df-mpst 31390*	Define the set of all pre-statements. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mPreSt = ( t e. _V |-> ( ( { d e. ~P (mDV ` t ) | `' d = d } X. ( ~P (mEx ` t ) i^i Fin ) ) X. (mEx ` t ) ) )
Definition	df-msr 31391*	Define the reduct of a pre-statement. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mStRed = ( t e. _V |-> ( s e. (mPreSt ` t ) |-> [_ ( 2nd ` ( 1st ` s ) ) / h ]_ [_ ( 2nd ` s ) / a ]_ <. ( ( 1st ` ( 1st ` s ) ) i^i [_ U. ( (mVars ` t ) " ( h u. { a } ) ) / z ]_ ( z X. z ) ) , h , a >. ) )
Definition	df-msta 31392	Define the set of all statements. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mStat = ( t e. _V |-> ran (mStRed ` t ) )
Definition	df-mfs 31393*	Define the set of all formal systems. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mFS = { t | ( ( ( (mCN ` t ) i^i (mVR ` t ) ) = (/) /\ (mType ` t ) : (mVR ` t ) --> (mTC ` t ) ) /\ ( (mAx ` t ) C_ (mStat ` t ) /\ A. v e. (mVT ` t ) -. ( `' (mType ` t ) " { v } ) e. Fin ) ) }
Definition	df-mcls 31394*	Define the closure of a set of statements relative to a set of disjointness constraints. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mCls = ( t e. _V |-> ( d e. ~P (mDV ` t ) , h e. ~P (mEx ` t ) |-> |^| { c | ( ( h u. ran (mVH ` t ) ) C_ c /\ A. m A. o A. p ( <. m , o , p >. e. (mAx ` t ) -> A. s e. ran (mSubst ` t ) ( ( ( s " ( o u. ran (mVH ` t ) ) ) C_ c /\ A. x A. y ( x m y -> ( ( (mVars ` t ) ` ( s ` ( (mVH ` t ) ` x ) ) ) X. ( (mVars ` t ) ` ( s ` ( (mVH ` t ) ` y ) ) ) ) C_ d ) ) -> ( s ` p ) e. c ) ) ) } ) )
Definition	df-mpps 31395*	Define the set of provable pre-statements. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mPPSt = ( t e. _V |-> { <. <. d , h >. , a >. | ( <. d , h , a >. e. (mPreSt ` t ) /\ a e. ( d (mCls ` t ) h ) ) } )
Definition	df-mthm 31396	Define the set of theorems. (Contributed by Mario Carneiro, 14-Jul-2016.)
|- mThm = ( t e. _V |-> ( `' (mStRed ` t ) " ( (mStRed ` t ) " (mPPSt ` t ) ) ) )
Theorem	mvtval 31397	The set of variable typecodes. (Contributed by Mario Carneiro, 18-Jul-2016.)
|- V = (mVT ` T )   &    |- Y = (mType ` T )   =>    |- V = ran Y
Theorem	mrexval 31398	The set of "raw expressions", which are expressions without a typecode, that is, just sequences of constants and variables. (Contributed by Mario Carneiro, 18-Jul-2016.)
|- C = (mCN ` T )   &    |- V = (mVR ` T )   &    |- R = (mREx ` T )   =>    |- ( T e. W -> R = Word ( C u. V ) )
Theorem	mexval 31399	The set of expressions, which are pairs whose first element is a typecode, and whose second element is a raw expression. (Contributed by Mario Carneiro, 18-Jul-2016.)
|- K = (mTC ` T )   &    |- E = (mEx ` T )   &    |- R = (mREx ` T )   =>    |- E = ( K X. R )
Theorem	mexval2 31400	The set of expressions, which are pairs whose first element is a typecode, and whose second element is a list of constants and variables. (Contributed by Mario Carneiro, 18-Jul-2016.)
|- K = (mTC ` T )   &    |- E = (mEx ` T )   &    |- C = (mCN ` T )   &    |- V = (mVR ` T )   =>    |- E = ( K X. Word ( C u. V ) )