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	fmptcof 5801*	Version of fmptco 5800 where ph needn't be distinct from x. (Contributed by NM, 27-Dec-2014.)
|- ( ph -> A. x e. A R e. B )   &    |- ( ph -> F = ( x e. A |-> R ) )   &    |- ( ph -> G = ( y e. B |-> S ) )   &    |- ( y = R -> S = T )   =>    |- ( ph -> ( G o. F ) = ( x e. A |-> T ) )
Theorem	fmptcos 5802*	Composition of two functions expressed as mapping abstractions. (Contributed by NM, 22-May-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
|- ( ph -> A. x e. A R e. B )   &    |- ( ph -> F = ( x e. A |-> R ) )   &    |- ( ph -> G = ( y e. B |-> S ) )   =>    |- ( ph -> ( G o. F ) = ( x e. A |-> [_ R / y ]_ S ) )
Theorem	cofmpt 5803*	Express composition of a maps-to function with another function in a maps-to notation. (Contributed by Thierry Arnoux, 29-Jun-2017.)
|- ( ph -> F : C --> D )   &    |- ( ( ph /\ x e. A ) -> B e. C )   =>    |- ( ph -> ( F o. ( x e. A |-> B ) ) = ( x e. A |-> ( F ` B ) ) )
Theorem	fcompt 5804*	Express composition of two functions as a maps-to applying both in sequence. (Contributed by Stefan O'Rear, 5-Oct-2014.) (Proof shortened by Mario Carneiro, 27-Dec-2014.)
|- ( ( A : D --> E /\ B : C --> D ) -> ( A o. B ) = ( x e. C |-> ( A ` ( B ` x ) ) ) )
Theorem	fcoconst 5805	Composition with a constant function. (Contributed by Stefan O'Rear, 11-Mar-2015.)
|- ( ( F Fn X /\ Y e. X ) -> ( F o. ( I X. { Y } ) ) = ( I X. { ( F ` Y ) } ) )
Theorem	fsn 5806	A function maps a singleton to a singleton iff it is the singleton of an ordered pair. (Contributed by NM, 10-Dec-2003.)
|- A e. _V   &    |- B e. _V   =>    |- ( F : { A } --> { B } <-> F = { <. A , B >. } )
Theorem	fsng 5807	A function maps a singleton to a singleton iff it is the singleton of an ordered pair. (Contributed by NM, 26-Oct-2012.)
|- ( ( A e. C /\ B e. D ) -> ( F : { A } --> { B } <-> F = { <. A , B >. } ) )
Theorem	fsn2 5808	A function that maps a singleton to a class is the singleton of an ordered pair. (Contributed by NM, 19-May-2004.)
|- A e. _V   =>    |- ( F : { A } --> B <-> ( ( F ` A ) e. B /\ F = { <. A , ( F ` A ) >. } ) )
Theorem	xpsng 5809	The cross product of two singletons. (Contributed by Mario Carneiro, 30-Apr-2015.)
|- ( ( A e. V /\ B e. W ) -> ( { A } X. { B } ) = { <. A , B >. } )
Theorem	xpsn 5810	The cross product of two singletons. (Contributed by NM, 4-Nov-2006.)
|- A e. _V   &    |- B e. _V   =>    |- ( { A } X. { B } ) = { <. A , B >. }
Theorem	dfmpt 5811	Alternate definition for the maps-to notation df-mpt 4146 (although it requires that B be a set). (Contributed by NM, 24-Aug-2010.) (Revised by Mario Carneiro, 30-Dec-2016.)
|- B e. _V   =>    |- ( x e. A |-> B ) = U_ x e. A { <. x , B >. }
Theorem	fnasrn 5812	A function expressed as the range of another function. (Contributed by Mario Carneiro, 22-Jun-2013.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
|- B e. _V   =>    |- ( x e. A |-> B ) = ran ( x e. A |-> <. x , B >. )
Theorem	dfmptg 5813	Alternate definition for the maps-to notation df-mpt 4146 (which requires that B be a set). (Contributed by Jim Kingdon, 9-Jan-2019.)
|- ( A. x e. A B e. V -> ( x e. A |-> B ) = U_ x e. A { <. x , B >. } )
Theorem	fnasrng 5814	A function expressed as the range of another function. (Contributed by Jim Kingdon, 9-Jan-2019.)
|- ( A. x e. A B e. V -> ( x e. A |-> B ) = ran ( x e. A |-> <. x , B >. ) )
Theorem	funiun 5815*	A function is a union of singletons of ordered pairs indexed by its domain. (Contributed by AV, 18-Sep-2020.)
|- ( Fun F -> F = U_ x e. dom F { <. x , ( F ` x ) >. } )
Theorem	funopsn 5816*	If a function is an ordered pair then it is a singleton of an ordered pair. (Contributed by AV, 20-Sep-2020.) (Proof shortened by AV, 15-Jul-2021.) A function is a class of ordered pairs, so the fact that an ordered pair may sometimes be itself a function is an "accident" depending on the specific encoding of ordered pairs as classes (in set.mm, the Kuratowski encoding). A more meaningful statement is funsng 5366, as relsnopg 4822 is to relop 4871. (New usage is discouraged.)
|- X e. _V   &    |- Y e. _V   =>    |- ( ( Fun F /\ F = <. X , Y >. ) -> E. a ( X = { a } /\ F = { <. a , a >. } ) )
Theorem	funop 5817*	An ordered pair is a function iff it is a singleton of an ordered pair. (Contributed by AV, 20-Sep-2020.) A function is a class of ordered pairs, so the fact that an ordered pair may sometimes be itself a function is an "accident" depending on the specific encoding of ordered pairs as classes (in set.mm, the Kuratowski encoding). A more meaningful statement is funsng 5366, as relsnopg 4822 is to relop 4871. (New usage is discouraged.)
|- X e. _V   &    |- Y e. _V   =>    |- ( Fun <. X , Y >. <-> E. a ( X = { a } /\ <. X , Y >. = { <. a , a >. } ) )
Theorem	funopdmsn 5818	The domain of a function which is an ordered pair is a singleton. (Contributed by AV, 15-Nov-2021.) (Avoid depending on this detail.)
|- G = <. X , Y >.   &    |- X e. V   &    |- Y e. W   =>    |- ( ( Fun G /\ A e. dom G /\ B e. dom G ) -> A = B )
Theorem	ressnop0 5819	If A is not in C, then the restriction of a singleton of <. A , B >. to C is null. (Contributed by Scott Fenton, 15-Apr-2011.)
|- ( -. A e. C -> ( { <. A , B >. } |` C ) = (/) )
Theorem	fpr 5820	A function with a domain of two elements. (Contributed by Jeff Madsen, 20-Jun-2010.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   &    |- D e. _V   =>    |- ( A =/= B -> { <. A , C >. , <. B , D >. } : { A , B } --> { C , D } )
Theorem	fprg 5821	A function with a domain of two elements. (Contributed by FL, 2-Feb-2014.)
|- ( ( ( A e. E /\ B e. F ) /\ ( C e. G /\ D e. H ) /\ A =/= B ) -> { <. A , C >. , <. B , D >. } : { A , B } --> { C , D } )
Theorem	ftpg 5822	A function with a domain of three elements. (Contributed by Alexander van der Vekens, 4-Dec-2017.)
|- ( ( ( X e. U /\ Y e. V /\ Z e. W ) /\ ( A e. F /\ B e. G /\ C e. H ) /\ ( X =/= Y /\ X =/= Z /\ Y =/= Z ) ) -> { <. X , A >. , <. Y , B >. , <. Z , C >. } : { X , Y , Z } --> { A , B , C } )
Theorem	ftp 5823	A function with a domain of three elements. (Contributed by Stefan O'Rear, 17-Oct-2014.) (Proof shortened by Alexander van der Vekens, 23-Jan-2018.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   &    |- X e. _V   &    |- Y e. _V   &    |- Z e. _V   &    |- A =/= B   &    |- A =/= C   &    |- B =/= C   =>    |- { <. A , X >. , <. B , Y >. , <. C , Z >. } : { A , B , C } --> { X , Y , Z }
Theorem	fnressn 5824	A function restricted to a singleton. (Contributed by NM, 9-Oct-2004.)
|- ( ( F Fn A /\ B e. A ) -> ( F |` { B } ) = { <. B , ( F ` B ) >. } )
Theorem	fressnfv 5825	The value of a function restricted to a singleton. (Contributed by NM, 9-Oct-2004.)
|- ( ( F Fn A /\ B e. A ) -> ( ( F |` { B } ) : { B } --> C <-> ( F ` B ) e. C ) )
Theorem	fvconst 5826	The value of a constant function. (Contributed by NM, 30-May-1999.)
|- ( ( F : A --> { B } /\ C e. A ) -> ( F ` C ) = B )
Theorem	fmptsn 5827*	Express a singleton function in maps-to notation. (Contributed by NM, 6-Jun-2006.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Revised by Stefan O'Rear, 28-Feb-2015.)
|- ( ( A e. V /\ B e. W ) -> { <. A , B >. } = ( x e. { A } |-> B ) )
Theorem	fmptap 5828*	Append an additional value to a function. (Contributed by NM, 6-Jun-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
|- A e. _V   &    |- B e. _V   &    |- ( R u. { A } ) = S   &    |- ( x = A -> C = B )   =>    |- ( ( x e. R |-> C ) u. { <. A , B >. } ) = ( x e. S |-> C )
Theorem	fmptapd 5829*	Append an additional value to a function. (Contributed by Thierry Arnoux, 3-Jan-2017.)
|- ( ph -> A e. _V )   &    |- ( ph -> B e. _V )   &    |- ( ph -> ( R u. { A } ) = S )   &    |- ( ( ph /\ x = A ) -> C = B )   =>    |- ( ph -> ( ( x e. R |-> C ) u. { <. A , B >. } ) = ( x e. S |-> C ) )
Theorem	fmptpr 5830*	Express a pair function in maps-to notation. (Contributed by Thierry Arnoux, 3-Jan-2017.)
|- ( ph -> A e. V )   &    |- ( ph -> B e. W )   &    |- ( ph -> C e. X )   &    |- ( ph -> D e. Y )   &    |- ( ( ph /\ x = A ) -> E = C )   &    |- ( ( ph /\ x = B ) -> E = D )   =>    |- ( ph -> { <. A , C >. , <. B , D >. } = ( x e. { A , B } |-> E ) )
Theorem	fvresi 5831	The value of a restricted identity function. (Contributed by NM, 19-May-2004.)
|- ( B e. A -> ( ( _I |` A ) ` B ) = B )
Theorem	fvunsng 5832	Remove an ordered pair not participating in a function value. (Contributed by Jim Kingdon, 7-Jan-2019.)
|- ( ( D e. V /\ B =/= D ) -> ( ( A u. { <. B , C >. } ) ` D ) = ( A ` D ) )
Theorem	fvsn 5833	The value of a singleton of an ordered pair is the second member. (Contributed by NM, 12-Aug-1994.)
|- A e. _V   &    |- B e. _V   =>    |- ( { <. A , B >. } ` A ) = B
Theorem	fvsng 5834	The value of a singleton of an ordered pair is the second member. (Contributed by NM, 26-Oct-2012.)
|- ( ( A e. V /\ B e. W ) -> ( { <. A , B >. } ` A ) = B )
Theorem	fvsnun1 5835	The value of a function with one of its ordered pairs replaced, at the replaced ordered pair. See also fvsnun2 5836. (Contributed by NM, 23-Sep-2007.)
|- A e. _V   &    |- B e. _V   &    |- G = ( { <. A , B >. } u. ( F |` ( C \ { A } ) ) )   =>    |- ( G ` A ) = B
Theorem	fvsnun2 5836	The value of a function with one of its ordered pairs replaced, at arguments other than the replaced one. See also fvsnun1 5835. (Contributed by NM, 23-Sep-2007.)
|- A e. _V   &    |- B e. _V   &    |- G = ( { <. A , B >. } u. ( F |` ( C \ { A } ) ) )   =>    |- ( D e. ( C \ { A } ) -> ( G ` D ) = ( F ` D ) )
Theorem	fnsnsplitss 5837	Split a function into a single point and all the rest. (Contributed by Stefan O'Rear, 27-Feb-2015.) (Revised by Jim Kingdon, 20-Jan-2023.)
|- ( ( F Fn A /\ X e. A ) -> ( ( F |` ( A \ { X } ) ) u. { <. X , ( F ` X ) >. } ) C_ F )
Theorem	fsnunf 5838	Adjoining a point to a function gives a function. (Contributed by Stefan O'Rear, 28-Feb-2015.)
|- ( ( F : S --> T /\ ( X e. V /\ -. X e. S ) /\ Y e. T ) -> ( F u. { <. X , Y >. } ) : ( S u. { X } ) --> T )
Theorem	fsnunfv 5839	Recover the added point from a point-added function. (Contributed by Stefan O'Rear, 28-Feb-2015.) (Revised by NM, 18-May-2017.)
|- ( ( X e. V /\ Y e. W /\ -. X e. dom F ) -> ( ( F u. { <. X , Y >. } ) ` X ) = Y )
Theorem	fsnunres 5840	Recover the original function from a point-added function. (Contributed by Stefan O'Rear, 28-Feb-2015.)
|- ( ( F Fn S /\ -. X e. S ) -> ( ( F u. { <. X , Y >. } ) |` S ) = F )
Theorem	funresdfunsnss 5841	Restricting a function to a domain without one element of the domain of the function, and adding a pair of this element and the function value of the element results in a subset of the function itself. (Contributed by AV, 2-Dec-2018.) (Revised by Jim Kingdon, 21-Jan-2023.)
|- ( ( Fun F /\ X e. dom F ) -> ( ( F |` ( _V \ { X } ) ) u. { <. X , ( F ` X ) >. } ) C_ F )
Theorem	fvpr1 5842	The value of a function with a domain of two elements. (Contributed by Jeff Madsen, 20-Jun-2010.)
|- A e. _V   &    |- C e. _V   =>    |- ( A =/= B -> ( { <. A , C >. , <. B , D >. } ` A ) = C )
Theorem	fvpr2 5843	The value of a function with a domain of two elements. (Contributed by Jeff Madsen, 20-Jun-2010.)
|- B e. _V   &    |- D e. _V   =>    |- ( A =/= B -> ( { <. A , C >. , <. B , D >. } ` B ) = D )
Theorem	fvpr1g 5844	The value of a function with a domain of (at most) two elements. (Contributed by Alexander van der Vekens, 3-Dec-2017.)
|- ( ( A e. V /\ C e. W /\ A =/= B ) -> ( { <. A , C >. , <. B , D >. } ` A ) = C )
Theorem	fvpr2g 5845	The value of a function with a domain of (at most) two elements. (Contributed by Alexander van der Vekens, 3-Dec-2017.)
|- ( ( B e. V /\ D e. W /\ A =/= B ) -> ( { <. A , C >. , <. B , D >. } ` B ) = D )
Theorem	fvtp1g 5846	The value of a function with a domain of (at most) three elements. (Contributed by Alexander van der Vekens, 4-Dec-2017.)
|- ( ( ( A e. V /\ D e. W ) /\ ( A =/= B /\ A =/= C ) ) -> ( { <. A , D >. , <. B , E >. , <. C , F >. } ` A ) = D )
Theorem	fvtp2g 5847	The value of a function with a domain of (at most) three elements. (Contributed by Alexander van der Vekens, 4-Dec-2017.)
|- ( ( ( B e. V /\ E e. W ) /\ ( A =/= B /\ B =/= C ) ) -> ( { <. A , D >. , <. B , E >. , <. C , F >. } ` B ) = E )
Theorem	fvtp3g 5848	The value of a function with a domain of (at most) three elements. (Contributed by Alexander van der Vekens, 4-Dec-2017.)
|- ( ( ( C e. V /\ F e. W ) /\ ( A =/= C /\ B =/= C ) ) -> ( { <. A , D >. , <. B , E >. , <. C , F >. } ` C ) = F )
Theorem	fvtp1 5849	The first value of a function with a domain of three elements. (Contributed by NM, 14-Sep-2011.)
|- A e. _V   &    |- D e. _V   =>    |- ( ( A =/= B /\ A =/= C ) -> ( { <. A , D >. , <. B , E >. , <. C , F >. } ` A ) = D )
Theorem	fvtp2 5850	The second value of a function with a domain of three elements. (Contributed by NM, 14-Sep-2011.)
|- B e. _V   &    |- E e. _V   =>    |- ( ( A =/= B /\ B =/= C ) -> ( { <. A , D >. , <. B , E >. , <. C , F >. } ` B ) = E )
Theorem	fvtp3 5851	The third value of a function with a domain of three elements. (Contributed by NM, 14-Sep-2011.)
|- C e. _V   &    |- F e. _V   =>    |- ( ( A =/= C /\ B =/= C ) -> ( { <. A , D >. , <. B , E >. , <. C , F >. } ` C ) = F )
Theorem	fvconst2g 5852	The value of a constant function. (Contributed by NM, 20-Aug-2005.)
|- ( ( B e. D /\ C e. A ) -> ( ( A X. { B } ) ` C ) = B )
Theorem	fconst2g 5853	A constant function expressed as a cross product. (Contributed by NM, 27-Nov-2007.)
|- ( B e. C -> ( F : A --> { B } <-> F = ( A X. { B } ) ) )
Theorem	fvconst2 5854	The value of a constant function. (Contributed by NM, 16-Apr-2005.)
|- B e. _V   =>    |- ( C e. A -> ( ( A X. { B } ) ` C ) = B )
Theorem	fconst2 5855	A constant function expressed as a cross product. (Contributed by NM, 20-Aug-1999.)
|- B e. _V   =>    |- ( F : A --> { B } <-> F = ( A X. { B } ) )
Theorem	fconstfvm 5856*	A constant function expressed in terms of its functionality, domain, and value. See also fconst2 5855. (Contributed by Jim Kingdon, 8-Jan-2019.)
|- ( E. y y e. A -> ( F : A --> { B } <-> ( F Fn A /\ A. x e. A ( F ` x ) = B ) ) )
Theorem	fconst3m 5857*	Two ways to express a constant function. (Contributed by Jim Kingdon, 8-Jan-2019.)
|- ( E. x x e. A -> ( F : A --> { B } <-> ( F Fn A /\ A C_ ( `' F " { B } ) ) ) )
Theorem	fconst4m 5858*	Two ways to express a constant function. (Contributed by NM, 8-Mar-2007.)
|- ( E. x x e. A -> ( F : A --> { B } <-> ( F Fn A /\ ( `' F " { B } ) = A ) ) )
Theorem	resfunexg 5859	The restriction of a function to a set exists. Compare Proposition 6.17 of [TakeutiZaring] p. 28. (Contributed by NM, 7-Apr-1995.) (Revised by Mario Carneiro, 22-Jun-2013.)
|- ( ( Fun A /\ B e. C ) -> ( A |` B ) e. _V )
Theorem	fnex 5860	If the domain of a function is a set, the function is a set. Theorem 6.16(1) of [TakeutiZaring] p. 28. This theorem is derived using the Axiom of Replacement in the form of resfunexg 5859. (Contributed by NM, 14-Aug-1994.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)
|- ( ( F Fn A /\ A e. B ) -> F e. _V )
Theorem	funex 5861	If the domain of a function exists, so does the function. Part of Theorem 4.15(v) of [Monk1] p. 46. This theorem is derived using the Axiom of Replacement in the form of fnex 5860. (Note: Any resemblance between F.U.N.E.X. and "Have You Any Eggs" is purely a coincidence originated by Swedish chefs.) (Contributed by NM, 11-Nov-1995.)
|- ( ( Fun F /\ dom F e. B ) -> F e. _V )
Theorem	opabex 5862*	Existence of a function expressed as class of ordered pairs. (Contributed by NM, 21-Jul-1996.)
|- A e. _V   &    |- ( x e. A -> E* y ph )   =>    |- { <. x , y >. | ( x e. A /\ ph ) } e. _V
Theorem	mptexg 5863*	If the domain of a function given by maps-to notation is a set, the function is a set. (Contributed by FL, 6-Jun-2011.) (Revised by Mario Carneiro, 31-Aug-2015.)
|- ( A e. V -> ( x e. A |-> B ) e. _V )
Theorem	mptex 5864*	If the domain of a function given by maps-to notation is a set, the function is a set. (Contributed by NM, 22-Apr-2005.) (Revised by Mario Carneiro, 20-Dec-2013.)
|- A e. _V   =>    |- ( x e. A |-> B ) e. _V
Theorem	mptexd 5865*	If the domain of a function given by maps-to notation is a set, the function is a set. Deduction version of mptexg 5863. (Contributed by Glauco Siliprandi, 24-Dec-2020.)
|- ( ph -> A e. V )   =>    |- ( ph -> ( x e. A |-> B ) e. _V )
Theorem	mptrabex 5866*	If the domain of a function given by maps-to notation is a class abstraction based on a set, the function is a set. (Contributed by AV, 16-Jul-2019.) (Revised by AV, 26-Mar-2021.)
|- A e. _V   =>    |- ( x e. { y e. A | ph } |-> B ) e. _V
Theorem	fex 5867	If the domain of a mapping is a set, the function is a set. (Contributed by NM, 3-Oct-1999.)
|- ( ( F : A --> B /\ A e. C ) -> F e. _V )
Theorem	fexd 5868	If the domain of a mapping is a set, the function is a set. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
|- ( ph -> F : A --> B )   &    |- ( ph -> A e. C )   =>    |- ( ph -> F e. _V )
Theorem	eufnfv 5869*	A function is uniquely determined by its values. (Contributed by NM, 31-Aug-2011.)
|- A e. _V   &    |- B e. _V   =>    |- E! f ( f Fn A /\ A. x e. A ( f ` x ) = B )
Theorem	funfvima 5870	A function's value in a preimage belongs to the image. (Contributed by NM, 23-Sep-2003.)
|- ( ( Fun F /\ B e. dom F ) -> ( B e. A -> ( F ` B ) e. ( F " A ) ) )
Theorem	funfvima2 5871	A function's value in an included preimage belongs to the image. (Contributed by NM, 3-Feb-1997.)
|- ( ( Fun F /\ A C_ dom F ) -> ( B e. A -> ( F ` B ) e. ( F " A ) ) )
Theorem	funfvima3 5872	A class including a function contains the function's value in the image of the singleton of the argument. (Contributed by NM, 23-Mar-2004.)
|- ( ( Fun F /\ F C_ G ) -> ( A e. dom F -> ( F ` A ) e. ( G " { A } ) ) )
Theorem	fnfvima 5873	The function value of an operand in a set is contained in the image of that set, using the Fn abbreviation. (Contributed by Stefan O'Rear, 10-Mar-2015.)
|- ( ( F Fn A /\ S C_ A /\ X e. S ) -> ( F ` X ) e. ( F " S ) )
Theorem	foima2 5874*	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 5552). (Contributed by BJ, 6-Jul-2022.)
|- ( F : A -onto-> B -> ( Y e. B <-> E. x e. A Y = ( F ` x ) ) )
Theorem	foelrn 5875*	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 5876	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 5877*	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 5878*	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 5879*	TODO: This is the same as issref 5110 (which has a much longer proof). Should we replace issref 5110 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 5880*	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 5881*	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 5882*	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 5883*	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 5884*	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 5885*	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 5886*	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 5885. (Contributed by Jim Kingdon, 10-Jan-2019.)
|- ( F Fn A -> U_ x e. A ( F ` x ) = U. ( F " A ) )
Theorem	funiunfvdmf 5887*	The indexed union of a function's values is the union of its image under the index class. This version of funiunfvdm 5886 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 5888*	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 5889*	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 5890*	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 5891*	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 5892	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 5893*	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 5894*	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 5895	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 5896	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 5897	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 5898	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 5899*	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 5900	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 )