mmtheorems35 - 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-10687

Statement List for Metamath Proof Explorer - 3401-3500 - Page 35 of 107

Type	Label	Description
Statement
Theorem	imaeq2d 3401	Equality theorem for image. (Contributed by FL, 15-Dec-2006.)
|- (ph -> A = B)   =>   |- (ph -> (C"A) = (C"B))
Theorem	dfima2 3402	Alternate definition of image. Compare definition (d) of [Enderton] p. 44.
|- (A"B) = {y | E.x e. B xAy}
Theorem	dfima3 3403	Alternate definition of image. Compare definition (d) of [Enderton] p. 44.
|- (A"B) = {y | E.x(x e. B /\ <.x, y>. e. A)}
Theorem	elimag 3404	Membership in an image. Theorem 34 of [Suppes] p. 65.
|- (A e. D -> (A e. (B"C) <-> E.x e. C xBA))
Theorem	elima 3405	Membership in an image. Theorem 34 of [Suppes] p. 65.
|- A e. V   =>   |- (A e. (B"C) <-> E.x e. C xBA)
Theorem	elima2 3406	Membership in an image. Theorem 34 of [Suppes] p. 65.
|- A e. V   =>   |- (A e. (B"C) <-> E.x(x e. C /\ xBA))
Theorem	elima3 3407	Membership in an image. Theorem 34 of [Suppes] p. 65.
|- A e. V   =>   |- (A e. (B"C) <-> E.x(x e. C /\ <.x, A>. e. B))
Theorem	hbima 3408	Bound-variable hypothesis builder for image.
|- (y e. A -> A.x y e. A)   &   |- (y e. B -> A.x y e. B)   =>   |- (y e. (A"B) -> A.x y e. (A"B))
Theorem	hbimad 3409	Deduction version of bound-variable hypothesis builder hbima 3408. (Contributed by FL, 15-Dec-2006.)
|- (ph -> A.xph)   &   |- (ph -> (y e. A -> A.x y e. A))   &   |- (ph -> (y e. B -> A.x y e. B))   =>   |- (ph -> (y e. (A"B) -> A.x y e. (A"B)))
Theorem	csbima12g 3410	Move class substitution in and out of the image of a function. (Contributed by FL, 15-Dec-2006.)
|- (A e. C -> [_A / x]_(F"B) = ([_A / x]_F"[_A / x]_B))
Theorem	imadmrn 3411	The image of the domain of a class is the range of the class.
|- (A"dom A) = ran A
Theorem	imassrn 3412	The image of a class is a subset of its range. Theorem 3.16(xi) of [Monk1] p. 39.
|- (A"B) (_ ran A
Theorem	imaexg 3413	The image of a set is a set. Theorem 3.17 of [Monk1] p. 39.
|- (A e. C -> (A"B) e. V)
Theorem	imai 3414	Image under the identity relation. Theorem 3.16(viii) of [Monk1] p. 38.
|- (I"A) = A
Theorem	rnresi 3415	The range of the restricted identity function.
|- ran ( I |` A) = A
Theorem	resiima 3416	The image of a restriction of the identity function. (Contributed by FL, 31-Dec-2006.)
|- (B (_ A -> ((I |` A)"B) = B)
Theorem	ima0 3417	Image of the empty set. Theorem 3.16(ii) of [Monk1] p. 38.
|- (A"(/)) = (/)
Theorem	0ima 3418	Image under the empty relation. (Contributed by FL, 11-Jan-2007.)
|- ((/)"A) = (/)
Theorem	imadisj 3419	A class whose image under another is empty is disjoint with the other's domain. (Contributed by FL, 24-Jan-2007.)
|- ((A"B) = (/) <-> (dom A i^i B) = (/))
Theorem	cnvimass 3420	A pre-image under any class is included in the domain of the class. (Contributed by FL, 29-Jan-2007.)
|- (`'A"B) (_ dom A
Theorem	imasng 3421	The image of a singleton.
|- (A e. B -> (R"{A}) = {y | ARy})
Theorem	relimasn 3422	The image of a singleton.
|- (Rel R -> (R"{A}) = {y | ARy})
Theorem	elimasn 3423	Membership in an image of a singleton.
|- B e. V   &   |- C e. V   =>   |- (C e. (A"{B}) <-> <.B, C>. e. A)
Theorem	elimasng 3424	Membership in an image of a singleton. (Contributed by Raph Levien, 21-Oct-2006.)
|- ((B e. R /\ C e. S) -> (C e. (A"{B}) <-> <.B, C>. e. A))
Theorem	args 3425	Two ways to express the class of unique-valued arguments of F, which is the same as the domain of F whenever F is a function. The left-hand side of the equality is from Definition 10.2 of [Quine] p. 65. Quine uses the notation "arg F" for this class (for which we have no separate notation). Observe the resemblance to our df-fv 3198, which was based on the idea in Quine's definition.
|- {x | E.y(F"{x}) = {y}} = {x | E!y xFy}
Theorem	eliniseg 3426	Membership in an initial segment. The idiom (`'A"{B}), meaning {x | xAB}, is used to specify an initial segment in (for example) Definition 6.21 of [TakeutiZaring] p. 30.
|- C e. V   =>   |- (B e. D -> (C e. (`'A"{B}) <-> CAB))
Theorem	iniseg 3427	An idiom that signifies an initial segment of an ordering, used, for example, in Definition 6.21 of [TakeutiZaring] p. 30.
|- (B e. C -> (`'A"{B}) = {x | xAB})
Theorem	dffr3 3428	Alternate definition of founded relation. Definition 6.21 of [TakeutiZaring] p. 30.
|- (R Fr A <-> A.x((x (_ A /\ x =/= (/)) -> E.y e. x (x i^i (`'R"{y})) = (/)))
Theorem	imass1 3429	Subset theorem for image.
|- (A (_ B -> (A"C) (_ (B"C))
Theorem	imass2 3430	Subset theorem for image. Exercise 22(a) of [Enderton] p. 53.
|- (A (_ B -> (C"A) (_ (C"B))
Theorem	ndmima 3431	The image of a singleton outside the domain is empty.
|- (-. A e. dom B -> (B"{A}) = (/))
Theorem	relcnv 3432	A converse is a relation. Theorem 12 of [Suppes] p. 62.
|- Rel `'A
Theorem	cotr 3433	Two ways of saying a relation is transitive. Definition of transitivity in [Schechter] p. 51.
|- ((R o. R) (_ R <-> A.xA.yA.z((xRy /\ yRz) -> xRz))
Theorem	cnvsym 3434	Two ways of saying a relation is symmetric. Similar to definition of symmetry in [Schechter] p. 51.
|- (`'R (_ R <-> A.xA.y(xRy -> yRx))
Theorem	intasym 3435	Two ways of saying a relation is antisymmetric. Definition of antisymmetry in [Schechter] p. 51.
|- ((R i^i `'R) (_ I <-> A.xA.y((xRy /\ yRx) -> x = y))
Theorem	asymref 3436	Two ways of saying a relation is antisymmetric and reflexive. U.U.R is the field of a relation by relfld 3515.
|- ((R i^i `'R) = (I |` U.U.R) <-> A.x e. U.U.RA.y((xRy /\ yRx) <-> x = y))
Theorem	asymref2 3437	Two ways of saying a relation is antisymmetric and reflexive.
|- ((R i^i `'R) = (I |` U.U.R) <-> (A.x e. U.U.RxRx /\ A.xA.y((xRy /\ yRx) -> x = y)))
Theorem	asymrefOLD 3438	Two ways of saying a relation is antisymmetric and reflexive.
|- ((R i^i `'R) = (I |` dom R) <-> A.x e. dom RA.y((xRy /\ yRx) <-> x = y))
Theorem	asymref2OLD 3439	Two ways of saying a relation is antisymmetric and reflexive.
|- ((R i^i `'R) = (I |` dom R) <-> (A.x e. dom R xRx /\ A.xA.y((xRy /\ yRx) -> x = y)))
Theorem	intirr 3440	Two ways of saying a relation is irreflexive. Definition of irreflexivity in [Schechter] p. 51.
|- ((R i^i I) = (/) <-> A.x -. xRx)
Theorem	soirri 3441	A strict order relation is irreflexive.
|- A e. V   &   |- R Or S   &   |- R (_ (S X. S)   =>   |- -. ARA
Theorem	sotri 3442	A strict order relation is a transitive relation.
|- A e. V   &   |- R Or S   &   |- R (_ (S X. S)   &   |- B e. V   &   |- C e. V   =>   |- ((ARB /\ BRC) -> ARC)
Theorem	son2lpi 3443	A strict order relation has no 2-cycle loops.
|- A e. V   &   |- R Or S   &   |- R (_ (S X. S)   &   |- B e. V   =>   |- -. (ARB /\ BRA)
Theorem	cnvopab 3444	The converse of a class abstraction of ordered pairs.
|- `'{<.x, y>. | ph} = {<.y, x>. | ph}
Theorem	cnv0 3445	The converse of the empty set.
|- `'(/) = (/)
Theorem	cnvi 3446	The converse of the identity relation. Theorem 3.7(ii) of [Monk1] p. 36.
|- `'I = I
Theorem	op1sta 3447	Extract the first member of an ordered pair. (See op2nda 3451 to extract the second member, op1stb 2912 for an alternate version, and op1st 4085 for the preferred version..) (Contributed by Raph Levien, 4-Dec-2003.)
|- A e. V   =>   |- U.dom {<.A, B>.} = A
Theorem	cnvsn 3448	Converse of a singleton of an ordered pair.
|- A e. V   &   |- B e. V   =>   |- `'{<.A, B>.} = {<.B, A>.}
Theorem	rnsnop 3449	The range of a singleton of an ordered pair is the singleton of the second member.
|- A e. V   &   |- B e. V   =>   |- ran {<.A, B>.} = {B}
Theorem	op2ndb 3450	Extract the second member of an ordered pair. Theorem 5.12(ii) of [Monk1] p. 52. (See op1stb 2912 to extract the first member, op2nda 3451 for an alternate version, and op2nd 4086 for the preferred version.)
|- A e. V   &   |- B e. V   =>   |- |^||^||^|`'{<.A, B>.} = B
Theorem	op2nda 3451	Extract the second member of an ordered pair. (See op1sta 3447 to extract the first member, op2ndb 3450 for an alternate version, and op2nd 4086 for the preferred version.)
|- A e. V   &   |- B e. V   =>   |- U.ran {<.A, B>.} = B
Theorem	elxp4 3452	Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp5 3453, elxp6 4102, and elxp7 4103.
|- (A e. (B X. C) <-> (A = <.U.dom { A}, U.ran { A}>. /\ (U.dom { A} e. B /\ U.ran { A} e. C)))
Theorem	elxp5 3453	Membership in a cross product requiring no quantifiers or dummy variables. Provides a slightly shorter version of elxp4 3452 when the double intersection does not create class existence problems (caused by int0 2543).
|- (A e. (B X. C) <-> (A = <.|^||^|A, U.ran { A}>. /\ (|^||^|A e. B /\ U.ran { A} e. C)))
Theorem	cnvun 3454	The converse of a union is the union of converses. Theorem 16 of [Suppes] p. 62.
|- `'(A u. B) = (`'A u. `'B)
Theorem	cnvin 3455	Distributive law for converse over intersection. Theorem 15 of [Suppes] p. 62.
|- `'(A i^i B) = (`'A i^i `'B)
Theorem	rnun 3456	Distributive law for range over union. Theorem 8 of [Suppes] p. 60.
|- ran ( A u. B) = (ran A u. ran B)
Theorem	rnin 3457	The range of an intersection belongs the intersection of ranges. Theorem 9 of [Suppes] p. 60.
|- ran ( A i^i B) (_ (ran A i^i ran B)
Theorem	rnuni 3458	The range of a union. Part of Exercise 8 of [Enderton] p. 41.
|- ran U. A = U_x e. A ran x
Theorem	imaun 3459	Distributive law for image over union. Theorem 35 of [Suppes] p. 65.
|- (A"(B u. C)) = ((A"B) u. (A"C))
Theorem	imaun2 3460	The image of a union. (Contributed by Jeff Hoffman, 17-Feb-2008.)
|- ((A u. B)"C) = ((A"C) u. (B"C))
Theorem	dminss 3461	An upper bound for intersection with a domain. Theorem 40 of [Suppes] p. 66, who calls it "somewhat surprising."
|- (dom R i^i A) (_ (`'R"(R"A))
Theorem	imainss 3462