P. 59 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 5801-5900   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	foima2 5801*	Given an onto function, an element is in its codomain if and only if it is the image of an element of its domain (see foima 5488). (Contributed by BJ, 6-Jul-2022.)
|- ( F : A -onto-> B -> ( Y e. B <-> E. x e. A Y = ( F ` x ) ) )
Theorem	foelrn 5802*	Property of a surjective function. (Contributed by Jeff Madsen, 4-Jan-2011.) (Proof shortened by BJ, 6-Jul-2022.)
|- ( ( F : A -onto-> B /\ C e. B ) -> E. x e. A C = ( F ` x ) )
Theorem	foco2 5803	If a composition of two functions is surjective, then the function on the left is surjective. (Contributed by Jeff Madsen, 16-Jun-2011.)
|- ( ( F : B --> C /\ G : A --> B /\ ( F o. G ) : A -onto-> C ) -> F : B -onto-> C )
Theorem	rexima 5804*	Existential quantification under an image in terms of the base set. (Contributed by Stefan O'Rear, 21-Jan-2015.)
|- ( x = ( F ` y ) -> ( ph <-> ps ) )   =>    |- ( ( F Fn A /\ B C_ A ) -> ( E. x e. ( F " B ) ph <-> E. y e. B ps ) )
Theorem	ralima 5805*	Universal quantification under an image in terms of the base set. (Contributed by Stefan O'Rear, 21-Jan-2015.)
|- ( x = ( F ` y ) -> ( ph <-> ps ) )   =>    |- ( ( F Fn A /\ B C_ A ) -> ( A. x e. ( F " B ) ph <-> A. y e. B ps ) )
Theorem	idref 5806*	TODO: This is the same as issref 5053 (which has a much longer proof). Should we replace issref 5053 with this one? - NM 9-May-2016. Two ways to state a relation is reflexive. (Adapted from Tarski.) (Contributed by FL, 15-Jan-2012.) (Proof shortened by Mario Carneiro, 3-Nov-2015.) (Proof modification is discouraged.)
|- ( ( _I |` A ) C_ R <-> A. x e. A x R x )
Theorem	elabrex 5807*	Elementhood in an image set. (Contributed by Mario Carneiro, 14-Jan-2014.)
|- B e. _V   =>    |- ( x e. A -> B e. { y | E. x e. A y = B } )
Theorem	elabrexg 5808*	Elementhood in an image set. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
|- ( ( x e. A /\ B e. V ) -> B e. { y | E. x e. A y = B } )
Theorem	abrexco 5809*	Composition of two image maps C ( y ) and B ( w ). (Contributed by NM, 27-May-2013.)
|- B e. _V   &    |- ( y = B -> C = D )   =>    |- { x | E. y e. { z | E. w e. A z = B } x = C } = { x | E. w e. A x = D }
Theorem	imaiun 5810*	The image of an indexed union is the indexed union of the images. (Contributed by Mario Carneiro, 18-Jun-2014.)
|- ( A " U_ x e. B C ) = U_ x e. B ( A " C )
Theorem	imauni 5811*	The image of a union is the indexed union of the images. Theorem 3K(a) of [Enderton] p. 50. (Contributed by NM, 9-Aug-2004.) (Proof shortened by Mario Carneiro, 18-Jun-2014.)
|- ( A " U. B ) = U_ x e. B ( A " x )
Theorem	fniunfv 5812*	The indexed union of a function's values is the union of its range. Compare Definition 5.4 of [Monk1] p. 50. (Contributed by NM, 27-Sep-2004.)
|- ( F Fn A -> U_ x e. A ( F ` x ) = U. ran F )
Theorem	funiunfvdm 5813*	The indexed union of a function's values is the union of its image under the index class. This theorem is a slight variation of fniunfv 5812. (Contributed by Jim Kingdon, 10-Jan-2019.)
|- ( F Fn A -> U_ x e. A ( F ` x ) = U. ( F " A ) )
Theorem	funiunfvdmf 5814*	The indexed union of a function's values is the union of its image under the index class. This version of funiunfvdm 5813 uses a bound-variable hypothesis in place of a distinct variable condition. (Contributed by Jim Kingdon, 10-Jan-2019.)
|- F/_ x F   =>    |- ( F Fn A -> U_ x e. A ( F ` x ) = U. ( F " A ) )
Theorem	eluniimadm 5815*	Membership in the union of an image of a function. (Contributed by Jim Kingdon, 10-Jan-2019.)
|- ( F Fn A -> ( B e. U. ( F " A ) <-> E. x e. A B e. ( F ` x ) ) )
Theorem	elunirn 5816*	Membership in the union of the range of a function. (Contributed by NM, 24-Sep-2006.)
|- ( Fun F -> ( A e. U. ran F <-> E. x e. dom F A e. ( F ` x ) ) )
Theorem	fnunirn 5817*	Membership in a union of some function-defined family of sets. (Contributed by Stefan O'Rear, 30-Jan-2015.)
|- ( F Fn I -> ( A e. U. ran F <-> E. x e. I A e. ( F ` x ) ) )
Theorem	dff13 5818*	A one-to-one function in terms of function values. Compare Theorem 4.8(iv) of [Monk1] p. 43. (Contributed by NM, 29-Oct-1996.)
|- ( F : A -1-1-> B <-> ( F : A --> B /\ A. x e. A A. y e. A ( ( F ` x ) = ( F ` y ) -> x = y ) ) )
Theorem	f1veqaeq 5819	If the values of a one-to-one function for two arguments are equal, the arguments themselves must be equal. (Contributed by Alexander van der Vekens, 12-Nov-2017.)
|- ( ( F : A -1-1-> B /\ ( C e. A /\ D e. A ) ) -> ( ( F ` C ) = ( F ` D ) -> C = D ) )
Theorem	dff13f 5820*	A one-to-one function in terms of function values. Compare Theorem 4.8(iv) of [Monk1] p. 43. (Contributed by NM, 31-Jul-2003.)
|- F/_ x F   &    |- F/_ y F   =>    |- ( F : A -1-1-> B <-> ( F : A --> B /\ A. x e. A A. y e. A ( ( F ` x ) = ( F ` y ) -> x = y ) ) )
Theorem	f1mpt 5821*	Express injection for a mapping operation. (Contributed by Mario Carneiro, 2-Jan-2017.)
|- F = ( x e. A |-> C )   &    |- ( x = y -> C = D )   =>    |- ( F : A -1-1-> B <-> ( A. x e. A C e. B /\ A. x e. A A. y e. A ( C = D -> x = y ) ) )
Theorem	f1fveq 5822	Equality of function values for a one-to-one function. (Contributed by NM, 11-Feb-1997.)
|- ( ( F : A -1-1-> B /\ ( C e. A /\ D e. A ) ) -> ( ( F ` C ) = ( F ` D ) <-> C = D ) )
Theorem	f1elima 5823	Membership in the image of a 1-1 map. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( ( F : A -1-1-> B /\ X e. A /\ Y C_ A ) -> ( ( F ` X ) e. ( F " Y ) <-> X e. Y ) )
Theorem	f1imass 5824	Taking images under a one-to-one function preserves subsets. (Contributed by Stefan O'Rear, 30-Oct-2014.)
|- ( ( F : A -1-1-> B /\ ( C C_ A /\ D C_ A ) ) -> ( ( F " C ) C_ ( F " D ) <-> C C_ D ) )
Theorem	f1imaeq 5825	Taking images under a one-to-one function preserves equality. (Contributed by Stefan O'Rear, 30-Oct-2014.)
|- ( ( F : A -1-1-> B /\ ( C C_ A /\ D C_ A ) ) -> ( ( F " C ) = ( F " D ) <-> C = D ) )
Theorem	dff1o6 5826*	A one-to-one onto function in terms of function values. (Contributed by NM, 29-Mar-2008.)
|- ( F : A -1-1-onto-> B <-> ( F Fn A /\ ran F = B /\ A. x e. A A. y e. A ( ( F ` x ) = ( F ` y ) -> x = y ) ) )
Theorem	f1ocnvfv1 5827	The converse value of the value of a one-to-one onto function. (Contributed by NM, 20-May-2004.)
|- ( ( F : A -1-1-onto-> B /\ C e. A ) -> ( `' F ` ( F ` C ) ) = C )
Theorem	f1ocnvfv2 5828	The value of the converse value of a one-to-one onto function. (Contributed by NM, 20-May-2004.)
|- ( ( F : A -1-1-onto-> B /\ C e. B ) -> ( F ` ( `' F ` C ) ) = C )
Theorem	f1ocnvfv 5829	Relationship between the value of a one-to-one onto function and the value of its converse. (Contributed by Raph Levien, 10-Apr-2004.)
|- ( ( F : A -1-1-onto-> B /\ C e. A ) -> ( ( F ` C ) = D -> ( `' F ` D ) = C ) )
Theorem	f1ocnvfvb 5830	Relationship between the value of a one-to-one onto function and the value of its converse. (Contributed by NM, 20-May-2004.)
|- ( ( F : A -1-1-onto-> B /\ C e. A /\ D e. B ) -> ( ( F ` C ) = D <-> ( `' F ` D ) = C ) )
Theorem	f1ocnvdm 5831	The value of the converse of a one-to-one onto function belongs to its domain. (Contributed by NM, 26-May-2006.)
|- ( ( F : A -1-1-onto-> B /\ C e. B ) -> ( `' F ` C ) e. A )
Theorem	f1ocnvfvrneq 5832	If the values of a one-to-one function for two arguments from the range of the function are equal, the arguments themselves must be equal. (Contributed by Alexander van der Vekens, 12-Nov-2017.)
|- ( ( F : A -1-1-> B /\ ( C e. ran F /\ D e. ran F ) ) -> ( ( `' F ` C ) = ( `' F ` D ) -> C = D ) )
Theorem	fcof1 5833	An application is injective if a retraction exists. Proposition 8 of [BourbakiEns] p. E.II.18. (Contributed by FL, 11-Nov-2011.) (Revised by Mario Carneiro, 27-Dec-2014.)
|- ( ( F : A --> B /\ ( R o. F ) = ( _I |` A ) ) -> F : A -1-1-> B )
Theorem	fcofo 5834	An application is surjective if a section exists. Proposition 8 of [BourbakiEns] p. E.II.18. (Contributed by FL, 17-Nov-2011.) (Proof shortened by Mario Carneiro, 27-Dec-2014.)
|- ( ( F : A --> B /\ S : B --> A /\ ( F o. S ) = ( _I |` B ) ) -> F : A -onto-> B )
Theorem	cbvfo 5835*	Change bound variable between domain and range of function. (Contributed by NM, 23-Feb-1997.) (Proof shortened by Mario Carneiro, 21-Mar-2015.)
|- ( ( F ` x ) = y -> ( ph <-> ps ) )   =>    |- ( F : A -onto-> B -> ( A. x e. A ph <-> A. y e. B ps ) )
Theorem	cbvexfo 5836*	Change bound variable between domain and range of function. (Contributed by NM, 23-Feb-1997.)
|- ( ( F ` x ) = y -> ( ph <-> ps ) )   =>    |- ( F : A -onto-> B -> ( E. x e. A ph <-> E. y e. B ps ) )
Theorem	cocan1 5837	An injection is left-cancelable. (Contributed by FL, 2-Aug-2009.) (Revised by Mario Carneiro, 21-Mar-2015.)
|- ( ( F : B -1-1-> C /\ H : A --> B /\ K : A --> B ) -> ( ( F o. H ) = ( F o. K ) <-> H = K ) )
Theorem	cocan2 5838	A surjection is right-cancelable. (Contributed by FL, 21-Nov-2011.) (Proof shortened by Mario Carneiro, 21-Mar-2015.)
|- ( ( F : A -onto-> B /\ H Fn B /\ K Fn B ) -> ( ( H o. F ) = ( K o. F ) <-> H = K ) )
Theorem	fcof1o 5839	Show that two functions are inverse to each other by computing their compositions. (Contributed by Mario Carneiro, 21-Mar-2015.)
|- ( ( ( F : A --> B /\ G : B --> A ) /\ ( ( F o. G ) = ( _I |` B ) /\ ( G o. F ) = ( _I |` A ) ) ) -> ( F : A -1-1-onto-> B /\ `' F = G ) )
Theorem	foeqcnvco 5840	Condition for function equality in terms of vanishing of the composition with the converse. EDITORIAL: Is there a relation-algebraic proof of this? (Contributed by Stefan O'Rear, 12-Feb-2015.)
|- ( ( F : A -onto-> B /\ G : A -onto-> B ) -> ( F = G <-> ( F o. `' G ) = ( _I |` B ) ) )
Theorem	f1eqcocnv 5841	Condition for function equality in terms of vanishing of the composition with the inverse. (Contributed by Stefan O'Rear, 12-Feb-2015.)
|- ( ( F : A -1-1-> B /\ G : A -1-1-> B ) -> ( F = G <-> ( `' F o. G ) = ( _I |` A ) ) )
Theorem	fliftrel 5842*	F, a function lift, is a subset of R X. S. (Contributed by Mario Carneiro, 23-Dec-2016.)
|- F = ran ( x e. X |-> <. A , B >. )   &    |- ( ( ph /\ x e. X ) -> A e. R )   &    |- ( ( ph /\ x e. X ) -> B e. S )   =>    |- ( ph -> F C_ ( R X. S ) )
Theorem	fliftel 5843*	Elementhood in the relation F. (Contributed by Mario Carneiro, 23-Dec-2016.)
|- F = ran ( x e. X |-> <. A , B >. )   &    |- ( ( ph /\ x e. X ) -> A e. R )   &    |- ( ( ph /\ x e. X ) -> B e. S )   =>    |- ( ph -> ( C F D <-> E. x e. X ( C = A /\ D = B ) ) )
Theorem	fliftel1 5844*	Elementhood in the relation F. (Contributed by Mario Carneiro, 23-Dec-2016.)
|- F = ran ( x e. X |-> <. A , B >. )   &    |- ( ( ph /\ x e. X ) -> A e. R )   &    |- ( ( ph /\ x e. X ) -> B e. S )   =>    |- ( ( ph /\ x e. X ) -> A F B )
Theorem	fliftcnv 5845*	Converse of the relation F. (Contributed by Mario Carneiro, 23-Dec-2016.)
|- F = ran ( x e. X |-> <. A , B >. )   &    |- ( ( ph /\ x e. X ) -> A e. R )   &    |- ( ( ph /\ x e. X ) -> B e. S )   =>    |- ( ph -> `' F = ran ( x e. X |-> <. B , A >. ) )
Theorem	fliftfun 5846*	The function F is the unique function defined by F ` A = B, provided that the well-definedness condition holds. (Contributed by Mario Carneiro, 23-Dec-2016.)
|- F = ran ( x e. X |-> <. A , B >. )   &    |- ( ( ph /\ x e. X ) -> A e. R )   &    |- ( ( ph /\ x e. X ) -> B e. S )   &    |- ( x = y -> A = C )   &    |- ( x = y -> B = D )   =>    |- ( ph -> ( Fun F <-> A. x e. X A. y e. X ( A = C -> B = D ) ) )
Theorem	fliftfund 5847*	The function F is the unique function defined by F ` A = B, provided that the well-definedness condition holds. (Contributed by Mario Carneiro, 23-Dec-2016.)
|- F = ran ( x e. X |-> <. A , B >. )   &    |- ( ( ph /\ x e. X ) -> A e. R )   &    |- ( ( ph /\ x e. X ) -> B e. S )   &    |- ( x = y -> A = C )   &    |- ( x = y -> B = D )   &    |- ( ( ph /\ ( x e. X /\ y e. X /\ A = C ) ) -> B = D )   =>    |- ( ph -> Fun F )
Theorem	fliftfuns 5848*	The function F is the unique function defined by F ` A = B, provided that the well-definedness condition holds. (Contributed by Mario Carneiro, 23-Dec-2016.)
|- F = ran ( x e. X |-> <. A , B >. )   &    |- ( ( ph /\ x e. X ) -> A e. R )   &    |- ( ( ph /\ x e. X ) -> B e. S )   =>    |- ( ph -> ( Fun F <-> A. y e. X A. z e. X ( [_ y / x ]_ A = [_ z / x ]_ A -> [_ y / x ]_ B = [_ z / x ]_ B ) ) )
Theorem	fliftf 5849*	The domain and range of the function F. (Contributed by Mario Carneiro, 23-Dec-2016.)
|- F = ran ( x e. X |-> <. A , B >. )   &    |- ( ( ph /\ x e. X ) -> A e. R )   &    |- ( ( ph /\ x e. X ) -> B e. S )   =>    |- ( ph -> ( Fun F <-> F : ran ( x e. X |-> A ) --> S ) )
Theorem	fliftval 5850*	The value of the function F. (Contributed by Mario Carneiro, 23-Dec-2016.)
|- F = ran ( x e. X |-> <. A , B >. )   &    |- ( ( ph /\ x e. X ) -> A e. R )   &    |- ( ( ph /\ x e. X ) -> B e. S )   &    |- ( x = Y -> A = C )   &    |- ( x = Y -> B = D )   &    |- ( ph -> Fun F )   =>    |- ( ( ph /\ Y e. X ) -> ( F ` C ) = D )
Theorem	isoeq1 5851	Equality theorem for isomorphisms. (Contributed by NM, 17-May-2004.)
|- ( H = G -> ( H Isom R , S ( A , B ) <-> G Isom R , S ( A , B ) ) )
Theorem	isoeq2 5852	Equality theorem for isomorphisms. (Contributed by NM, 17-May-2004.)
|- ( R = T -> ( H Isom R , S ( A , B ) <-> H Isom T , S ( A , B ) ) )
Theorem	isoeq3 5853	Equality theorem for isomorphisms. (Contributed by NM, 17-May-2004.)
|- ( S = T -> ( H Isom R , S ( A , B ) <-> H Isom R , T ( A , B ) ) )
Theorem	isoeq4 5854	Equality theorem for isomorphisms. (Contributed by NM, 17-May-2004.)
|- ( A = C -> ( H Isom R , S ( A , B ) <-> H Isom R , S ( C , B ) ) )
Theorem	isoeq5 5855	Equality theorem for isomorphisms. (Contributed by NM, 17-May-2004.)
|- ( B = C -> ( H Isom R , S ( A , B ) <-> H Isom R , S ( A , C ) ) )
Theorem	nfiso 5856	Bound-variable hypothesis builder for an isomorphism. (Contributed by NM, 17-May-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
|- F/_ x H   &    |- F/_ x R   &    |- F/_ x S   &    |- F/_ x A   &    |- F/_ x B   =>    |- F/ x H Isom R , S ( A , B )
Theorem	isof1o 5857	An isomorphism is a one-to-one onto function. (Contributed by NM, 27-Apr-2004.)
|- ( H Isom R , S ( A , B ) -> H : A -1-1-onto-> B )
Theorem	isorel 5858	An isomorphism connects binary relations via its function values. (Contributed by NM, 27-Apr-2004.)
|- ( ( H Isom R , S ( A , B ) /\ ( C e. A /\ D e. A ) ) -> ( C R D <-> ( H ` C ) S ( H ` D ) ) )
Theorem	isoresbr 5859*	A consequence of isomorphism on two relations for a function's restriction. (Contributed by Jim Kingdon, 11-Jan-2019.)
|- ( ( F |` A ) Isom R , S ( A , ( F " A ) ) -> A. x e. A A. y e. A ( x R y -> ( F ` x ) S ( F ` y ) ) )
Theorem	isoid 5860	Identity law for isomorphism. Proposition 6.30(1) of [TakeutiZaring] p. 33. (Contributed by NM, 27-Apr-2004.)
|- ( _I |` A ) Isom R , R ( A , A )
Theorem	isocnv 5861	Converse law for isomorphism. Proposition 6.30(2) of [TakeutiZaring] p. 33. (Contributed by NM, 27-Apr-2004.)
|- ( H Isom R , S ( A , B ) -> `' H Isom S , R ( B , A ) )
Theorem	isocnv2 5862	Converse law for isomorphism. (Contributed by Mario Carneiro, 30-Jan-2014.)
|- ( H Isom R , S ( A , B ) <-> H Isom `' R , `' S ( A , B ) )
Theorem	isores2 5863	An isomorphism from one well-order to another can be restricted on either well-order. (Contributed by Mario Carneiro, 15-Jan-2013.)
|- ( H Isom R , S ( A , B ) <-> H Isom R , ( S i^i ( B X. B ) ) ( A , B ) )
Theorem	isores1 5864	An isomorphism from one well-order to another can be restricted on either well-order. (Contributed by Mario Carneiro, 15-Jan-2013.)
|- ( H Isom R , S ( A , B ) <-> H Isom ( R i^i ( A X. A ) ) , S ( A , B ) )
Theorem	isores3 5865	Induced isomorphism on a subset. (Contributed by Stefan O'Rear, 5-Nov-2014.)
|- ( ( H Isom R , S ( A , B ) /\ K C_ A /\ X = ( H " K ) ) -> ( H |` K ) Isom R , S ( K , X ) )
Theorem	isotr 5866	Composition (transitive) law for isomorphism. Proposition 6.30(3) of [TakeutiZaring] p. 33. (Contributed by NM, 27-Apr-2004.) (Proof shortened by Mario Carneiro, 5-Dec-2016.)
|- ( ( H Isom R , S ( A , B ) /\ G Isom S , T ( B , C ) ) -> ( G o. H ) Isom R , T ( A , C ) )
Theorem	iso0 5867	The empty set is an R , S isomorphism from the empty set to the empty set. (Contributed by Steve Rodriguez, 24-Oct-2015.)
|- (/) Isom R , S ( (/) , (/) )
Theorem	isoini 5868	Isomorphisms preserve initial segments. Proposition 6.31(2) of [TakeutiZaring] p. 33. (Contributed by NM, 20-Apr-2004.)
|- ( ( H Isom R , S ( A , B ) /\ D e. A ) -> ( H " ( A i^i ( `' R " { D } ) ) ) = ( B i^i ( `' S " { ( H ` D ) } ) ) )
Theorem	isoini2 5869	Isomorphisms are isomorphisms on their initial segments. (Contributed by Mario Carneiro, 29-Mar-2014.)
|- C = ( A i^i ( `' R " { X } ) )   &    |- D = ( B i^i ( `' S " { ( H ` X ) } ) )   =>    |- ( ( H Isom R , S ( A , B ) /\ X e. A ) -> ( H |` C ) Isom R , S ( C , D ) )
Theorem	isoselem 5870*	Lemma for isose 5871. (Contributed by Mario Carneiro, 23-Jun-2015.)
|- ( ph -> H Isom R , S ( A , B ) )   &    |- ( ph -> ( H " x ) e. _V )   =>    |- ( ph -> ( R Se A -> S Se B ) )
Theorem	isose 5871	An isomorphism preserves set-like relations. (Contributed by Mario Carneiro, 23-Jun-2015.)
|- ( H Isom R , S ( A , B ) -> ( R Se A <-> S Se B ) )
Theorem	isopolem 5872	Lemma for isopo 5873. (Contributed by Stefan O'Rear, 16-Nov-2014.)
|- ( H Isom R , S ( A , B ) -> ( S Po B -> R Po A ) )
Theorem	isopo 5873	An isomorphism preserves partial ordering. (Contributed by Stefan O'Rear, 16-Nov-2014.)
|- ( H Isom R , S ( A , B ) -> ( R Po A <-> S Po B ) )
Theorem	isosolem 5874	Lemma for isoso 5875. (Contributed by Stefan O'Rear, 16-Nov-2014.)
|- ( H Isom R , S ( A , B ) -> ( S Or B -> R Or A ) )
Theorem	isoso 5875	An isomorphism preserves strict ordering. (Contributed by Stefan O'Rear, 16-Nov-2014.)
|- ( H Isom R , S ( A , B ) -> ( R Or A <-> S Or B ) )
Theorem	f1oiso 5876*	Any one-to-one onto function determines an isomorphism with an induced relation S. Proposition 6.33 of [TakeutiZaring] p. 34. (Contributed by NM, 30-Apr-2004.)
|- ( ( H : A -1-1-onto-> B /\ S = { <. z , w >. | E. x e. A E. y e. A ( ( z = ( H ` x ) /\ w = ( H ` y ) ) /\ x R y ) } ) -> H Isom R , S ( A , B ) )
Theorem	f1oiso2 5877*	Any one-to-one onto function determines an isomorphism with an induced relation S. (Contributed by Mario Carneiro, 9-Mar-2013.)
|- S = { <. x , y >. | ( ( x e. B /\ y e. B ) /\ ( `' H ` x ) R ( `' H ` y ) ) }   =>    |- ( H : A -1-1-onto-> B -> H Isom R , S ( A , B ) )
2.6.9  Cantor's Theorem
Theorem	canth 5878	No set A is equinumerous to its power set (Cantor's theorem), i.e., no function can map A onto its power set. Compare Theorem 6B(b) of [Enderton] p. 132. (Use nex 1514 if you want the form -. E. f f : A -onto-> ~P A.) (Contributed by NM, 7-Aug-1994.) (Revised by Noah R Kingdon, 23-Jul-2024.)
|- A e. _V   =>    |- -. F : A -onto-> ~P A
2.6.10  Restricted iota (description binder)
Syntax	crio 5879	Extend class notation with restricted description binder.
class ( iota_ x e. A ph )
Definition	df-riota 5880	Define restricted description binder. In case there is no unique x such that ( x e. A /\ ph ) holds, it evaluates to the empty set. See also comments for df-iota 5220. (Contributed by NM, 15-Sep-2011.) (Revised by Mario Carneiro, 15-Oct-2016.) (Revised by NM, 2-Sep-2018.)
|- ( iota_ x e. A ph ) = ( iota x ( x e. A /\ ph ) )
Theorem	riotaeqdv 5881*	Formula-building deduction for iota. (Contributed by NM, 15-Sep-2011.)
|- ( ph -> A = B )   =>    |- ( ph -> ( iota_ x e. A ps ) = ( iota_ x e. B ps ) )
Theorem	riotabidv 5882*	Formula-building deduction for restricted iota. (Contributed by NM, 15-Sep-2011.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( iota_ x e. A ps ) = ( iota_ x e. A ch ) )
Theorem	riotaeqbidv 5883*	Equality deduction for restricted universal quantifier. (Contributed by NM, 15-Sep-2011.)
|- ( ph -> A = B )   &    |- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( iota_ x e. A ps ) = ( iota_ x e. B ch ) )
Theorem	riotaexg 5884*	Restricted iota is a set. (Contributed by Jim Kingdon, 15-Jun-2020.)
|- ( A e. V -> ( iota_ x e. A ps ) e. _V )
Theorem	iotaexel 5885*	Set existence of an iota expression in which all values are contained within a set. (Contributed by Jim Kingdon, 28-Jun-2025.)
|- ( ( A e. V /\ A. x ( ph -> x e. A ) ) -> ( iota x ph ) e. _V )
Theorem	riotav 5886	An iota restricted to the universe is unrestricted. (Contributed by NM, 18-Sep-2011.)
|- ( iota_ x e. _V ph ) = ( iota x ph )
Theorem	riotauni 5887	Restricted iota in terms of class union. (Contributed by NM, 11-Oct-2011.)
|- ( E! x e. A ph -> ( iota_ x e. A ph ) = U. { x e. A | ph } )
Theorem	nfriota1 5888*	The abstraction variable in a restricted iota descriptor isn't free. (Contributed by NM, 12-Oct-2011.) (Revised by Mario Carneiro, 15-Oct-2016.)
|- F/_ x ( iota_ x e. A ph )
Theorem	nfriotadxy 5889*	Deduction version of nfriota 5890. (Contributed by Jim Kingdon, 12-Jan-2019.)
|- F/ y ph   &    |- ( ph -> F/ x ps )   &    |- ( ph -> F/_ x A )   =>    |- ( ph -> F/_ x ( iota_ y e. A ps ) )
Theorem	nfriota 5890*	A variable not free in a wff remains so in a restricted iota descriptor. (Contributed by NM, 12-Oct-2011.)
|- F/ x ph   &    |- F/_ x A   =>    |- F/_ x ( iota_ y e. A ph )
Theorem	cbvriota 5891*	Change bound variable in a restricted description binder. (Contributed by NM, 18-Mar-2013.) (Revised by Mario Carneiro, 15-Oct-2016.)
|- F/ y ph   &    |- F/ x ps   &    |- ( x = y -> ( ph <-> ps ) )   =>    |- ( iota_ x e. A ph ) = ( iota_ y e. A ps )
Theorem	cbvriotav 5892*	Change bound variable in a restricted description binder. (Contributed by NM, 18-Mar-2013.) (Revised by Mario Carneiro, 15-Oct-2016.)
|- ( x = y -> ( ph <-> ps ) )   =>    |- ( iota_ x e. A ph ) = ( iota_ y e. A ps )
Theorem	csbriotag 5893*	Interchange class substitution and restricted description binder. (Contributed by NM, 24-Feb-2013.)
|- ( A e. V -> [_ A / x ]_ ( iota_ y e. B ph ) = ( iota_ y e. B [. A / x ]. ph ) )
Theorem	riotacl2 5894	Membership law for "the unique element in A such that ph." (Contributed by NM, 21-Aug-2011.) (Revised by Mario Carneiro, 23-Dec-2016.)
|- ( E! x e. A ph -> ( iota_ x e. A ph ) e. { x e. A | ph } )
Theorem	riotacl 5895*	Closure of restricted iota. (Contributed by NM, 21-Aug-2011.)
|- ( E! x e. A ph -> ( iota_ x e. A ph ) e. A )
Theorem	riotasbc 5896	Substitution law for descriptions. (Contributed by NM, 23-Aug-2011.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)
|- ( E! x e. A ph -> [. ( iota_ x e. A ph ) / x ]. ph )
Theorem	riotabidva 5897*	Equivalent wff's yield equal restricted class abstractions (deduction form). (rabbidva 2751 analog.) (Contributed by NM, 17-Jan-2012.)
|- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( iota_ x e. A ps ) = ( iota_ x e. A ch ) )
Theorem	riotabiia 5898	Equivalent wff's yield equal restricted iotas (inference form). (rabbiia 2748 analog.) (Contributed by NM, 16-Jan-2012.)
|- ( x e. A -> ( ph <-> ps ) )   =>    |- ( iota_ x e. A ph ) = ( iota_ x e. A ps )
Theorem	riota1 5899*	Property of restricted iota. Compare iota1 5234. (Contributed by Mario Carneiro, 15-Oct-2016.)
|- ( E! x e. A ph -> ( ( x e. A /\ ph ) <-> ( iota_ x e. A ph ) = x ) )
Theorem	riota1a 5900	Property of iota. (Contributed by NM, 23-Aug-2011.)
|- ( ( x e. A /\ E! x e. A ph ) -> ( ph <-> ( iota x ( x e. A /\ ph ) ) = x ) )