mmtheorems42 - Metamath Proof Explorer

Jump to page: Contents + 1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10688

Statement List for Metamath Proof Explorer - 4101-4200 - Page 42 of 107

Type	Label	Description
Statement
Theorem	1stcof 4101	Composition of the first member function with another function.
|- (F:A-->(B X. C) -> (1st o. F):A-->B)
Theorem	elxp6 4102	Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 3452.
|- (A e. (B X. C) <-> (A = <.(1st` A), (2nd` A)>. /\ ((1st` A) e. B /\ (2nd` A) e. C)))
Theorem	elxp7 4103	Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 3452.
|- (A e. (B X. C) <-> (A e. (V X. V) /\ ((1st` A) e. B /\ (2nd` A) e. C)))
Theorem	eqop 4104	Two ways to express equality with an ordered pair.
|- C e. V   =>   |- (A e. (V X. V) -> (A = <.B, C>. <-> ((1st` A) = B /\ (2nd` A) = C)))
Theorem	xp2 4105	Representation of cross product based on ordered pair component functions.
|- (A X. B) = {x e. (V X. V) | ((1st` x) e. A /\ (2nd` x) e. B)}
Theorem	xpopth 4106	An ordered pair theorem for members of cross products.
|- ((A e. (C X. D) /\ B e. (R X. S)) -> (((1st` A) = (1st` B) /\ (2nd` A) = (2nd` B)) <-> A = B))
Theorem	unielxp 4107	The membership relation for a cross product is inherited by union.
|- (A e. (B X. C) -> U.A e. U.(B X. C))
Theorem	1st2nd 4108	Reconstruction of a member of a relation in terms of its ordered pair components.
|- ((Rel B /\ A e. B) -> A = <.(1st` A), (2nd` A)>.)
Theorem	1stdm 4109	The first ordered pair component of a member of a relation belongs to the domain of the relation.
|- ((Rel R /\ A e. R) -> (1st` A) e. dom R)
Theorem	2ndrn 4110	The second ordered pair component of a member of a relation belongs to the range of the relation.
|- ((Rel R /\ A e. R) -> (2nd` A) e. ran R)
Theorem	sbcopeq1a 4111	Equality theorem for substitution of a class for an ordered pair (analog of sbceq1a 1940, that avoids the existential quantifiers of copsexg 2788).
|- (<.x, y>. = A -> (ph <-> [(1st` A) / x][(2nd` A) / y]ph))
Theorem	csbopeq1a 4112	Equality theorem for substitution of a class A for an ordered pair <.x, y>. in B (analog of csbeq1a 2002).
|- (<.x, y>. = A -> B = [_(1st` A) / x]_[_(2nd` A) / y]_B)
Theorem	dfopab2 4113	A way to define an ordered-pair class abstraction without using existential quantifiers.
|- {<.x, y>. | ph} = {z | (z e. (V X. V) /\ [(1st` z) / x][(2nd` z) / y]ph)}
Theorem	dfoprab3 4114	A way to define an operation class abstraction without using existential quantifiers.
|- {<.<.x, y>., z>. | ph} = {<.w, z>. | (w e. (V X. V) /\ [(1st` w) / x][(2nd` w) / y]ph)}
Theorem	dfoprab5 4115	A way to define an operation class abstraction without using existential quantifiers.
|- (<.x, y>. = w -> C = D)   =>   |- {<.<.x, y>., z>. | ((x e. A /\ y e. B) /\ z = C)} = {<.w, z>. | (w e. (A X. B) /\ z = D)}
Theorem	dfoprab4 4116	A way to define an operation class abstraction without using existential quantifiers.
|- ((x = (1st` w) /\ y = (2nd` w)) -> C = D)   =>   |- {<.<.x, y>., z>. | ((x e. A /\ y e. B) /\ z = C)} = {<.w, z>. | (w e. (A X. B) /\ z = D)}
Theorem	elopabi 4117	A consequence of membership in an ordered-pair class abstraction, using ordered pair extractors.
|- (x = (1st` A) -> (ph <-> ps))   &   |- (y = (2nd` A) -> (ps <-> ch))   =>   |- (A e. {<.x, y>. | ph} -> ch)
Theorem	eloprabi 4118	A consequence of membership in an operation class abstraction, using ordered pair extractors.
|- (x = (1st` (1st` A)) -> (ph <-> ps))   &   |- (y = (2nd` (1st` A)) -> (ps <-> ch))   &   |- (z = (2nd` A) -> (ch <-> th))   =>   |- (A e. {<.<.x, y>., z>. | ph} -> th)
Theorem	foprab2 4119	Mapping of an operation class abstraction.
|- F = {<.<.x, y>., z>. | ((x e. A /\ y e. B) /\ z = C)}   =>   |- (A.x e. A A.y e. B C e. D <-> F:(A X. B)-->D)
Theorem	foprab 4120	Mapping of an operation class abstraction.
|- F = {<.<.x, y>., z>. | ((x e. A /\ y e. B) /\ z = C)}   &   |- ((x e. A /\ y e. B) -> C e. D)   =>   |- F:(A X. B)-->D
Theorem	fnoprab2g 4121	Functionality and domain of an operation class abstraction.
|- F = {<.<.x, y>., z>. | ((x e. A /\ y e. B) /\ z = C)}   =>   |- (A.x e. A A.y e. B C e. V <-> F Fn (A X. B))
Theorem	fnoprab2 4122	Functionality and domain of an operation class abstraction.
|- C e. V   &   |- F = {<.<.x, y>., z>. | ((x e. A /\ y e. B) /\ z = C)}   =>   |- F Fn (A X. B)
Theorem	dmoprab2 4123	Domain of an operation class abstraction.
|- C e. V   &   |- F = {<.<.x, y>., z>. | ((x e. A /\ y e. B) /\ z = C)}   =>   |- dom F = (A X. B)
Theorem	elrnoprabg 4124	Membership in the range of an operation class abstraction.
|- F = {<.<.x, y>., z>. | ((x e. A /\ y e. B) /\ z = C)}   =>   |- (A.x e. A A.y e. B C e. R -> (D e. ran F <-> E.x e. A E.y e. B D = C))
Theorem	elrnoprab 4125	Membership in the range of an operation class abstraction.
|- C e. V   &   |- F = {<.<.x, y>., z>. | ((x e. A /\ y e. B) /\ z = C)}   =>   |- (D e. ran F <-> E.x e. A E.y e. B D = C)
Theorem	df1st2 4126	An alternate possible definition of the 1st function.
|- {<.<.x, y>., z>. | z = x} = (1st |` (V X. V))
Theorem	df2nd2 4127	An alternate possible definition of the 2nd function.
|- {<.<.x, y>., z>. | z = y} = (2nd |` (V X. V))
Ordinal arithmetic
Syntax	c1o 4128	Extend the definition of a class to include the ordinal number 1.
class 1o
Syntax	c2o 4129	Extend the definition of a class to include the ordinal number 2.
class 2o
Syntax	coa 4130	Extend the definition of a class to include the ordinal addition operation.
class +o
Syntax	comu 4131	Extend the definition of a class to include the ordinal multiplication operation.
class .o
Syntax	coe 4132	Extend the definition of a class to include the ordinal exponentiation operation.
class ^o
Definition	df-1o 4133	Define the ordinal number 1.
|- 1o = suc (/)
Definition	df-2o 4134	Define the ordinal number 2.
|- 2o = suc 1o
Definition	df-oadd 4135	Define the ordinal addition operation.
|- +o = {<.<.x, y>., z>. | ((x e. On /\ y e. On) /\ z = (rec({<.w, v>. | v = suc w}, x)` y))}
Definition	df-omul 4136	Define the ordinal multiplication operation.
|- .o = {<.<.x, y>., z>. | ((x e. On /\ y e. On) /\ z = (rec({<.w, v>. | v = (w +o x)}, (/))` y))}
Definition	df-oexp 4137	Define the ordinal exponentiation operation.
|- ^o = {<.<.x, y>., z>. | ((x e. On /\ y e. On) /\ z = if(x = (/), (1o \ y), (rec({<.w, v>. | v = (w .o x)}, 1o)` y)))}
Theorem	1on 4138	Ordinal 1 is an ordinal number.
|- 1o e. On
Theorem	2on 4139	Ordinal 2 is an ordinal number.
|- 2o e. On
Theorem	df1o2 4140	Expanded value of the ordinal number 1.
|- 1o = {(/)}
Theorem	df2o2 4141	Expanded value of the ordinal number 2.
|- 2o = {(/), {(/)}}
Theorem	1ne0 4142	Ordinal one is not equal to ordinal zero.
|- 1o =/= (/)
Theorem	xp01disj 4143	Cross products with the singletons of ordinals 0 and 1 are disjoint.
|- ((A X. {(/)}) i^i (C X. {1o})) = (/)
Theorem	ordgt0ge1 4144	Two ways to express that an ordinal class is positive.
|- (Ord A -> ((/) e. A <-> 1o (_ A))
Theorem	ordge1n0 4145	An ordinal greater than or equal to 1 is nonzero.
|- (Ord A -> (1o (_ A <-> A =/= (/)))
Theorem	el1o 4146	Membership in ordinal one.
|- (A e. 1o <-> A = (/))
Theorem	0lt1o 4147	Ordinal zero is less than ordinal one.
|- (/) e. 1o
Theorem	fnoa 4148	Functionality and domain of ordinal addition.
|- +o Fn (On X. On)
Theorem	fnom 4149	Functionality and domain of ordinal multiplication.
|- .o Fn (On X. On)
Theorem	oav 4150	Value of ordinal addition.
|- ((A e. On /\ B e. On) -> (A +o B) = (rec({<.x, y>. | y = suc x}, A)` B))
Theorem	omv 4151	Value of ordinal multiplication.
|- ((A e. On /\ B e. On) -> (A .o B) = (rec({<.x, y>. | y = (x +o A)}, (/))` B))
Theorem	oe0lem 4152	A helper lemma for oe0 4161 and others.
|- ((ph /\ A = (/)) -> ps)   &   |- (((A e. On /\ ph) /\ (/) e. A) -> ps)   =>   |- (