P. 54 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 5301-5400   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	funopfv 5301	The second element in an ordered pair member of a function is the function's value. (Contributed by NM, 19-Jul-1996.)
|- ( Fun F -> ( <. A , B >. e. F -> ( F ` A ) = B ) )
Theorem	fnbrfvb 5302	Equivalence of function value and binary relation. (Contributed by NM, 19-Apr-2004.) (Revised by Mario Carneiro, 28-Apr-2015.)
|- ( ( F Fn A /\ B e. A ) -> ( ( F ` B ) = C <-> B F C ) )
Theorem	fnopfvb 5303	Equivalence of function value and ordered pair membership. (Contributed by NM, 7-Nov-1995.)
|- ( ( F Fn A /\ B e. A ) -> ( ( F ` B ) = C <-> <. B , C >. e. F ) )
Theorem	funbrfvb 5304	Equivalence of function value and binary relation. (Contributed by NM, 26-Mar-2006.)
|- ( ( Fun F /\ A e. dom F ) -> ( ( F ` A ) = B <-> A F B ) )
Theorem	funopfvb 5305	Equivalence of function value and ordered pair membership. Theorem 4.3(ii) of [Monk1] p. 42. (Contributed by NM, 26-Jan-1997.)
|- ( ( Fun F /\ A e. dom F ) -> ( ( F ` A ) = B <-> <. A , B >. e. F ) )
Theorem	funbrfv2b 5306	Function value in terms of a binary relation. (Contributed by Mario Carneiro, 19-Mar-2014.)
|- ( Fun F -> ( A F B <-> ( A e. dom F /\ ( F ` A ) = B ) ) )
Theorem	dffn5im 5307*	Representation of a function in terms of its values. The converse holds given the law of the excluded middle; as it is we have most of the converse via funmpt 5014 and dmmptss 4890. (Contributed by Jim Kingdon, 31-Dec-2018.)
|- ( F Fn A -> F = ( x e. A |-> ( F ` x ) ) )
Theorem	fnrnfv 5308*	The range of a function expressed as a collection of the function's values. (Contributed by NM, 20-Oct-2005.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
|- ( F Fn A -> ran F = { y | E. x e. A y = ( F ` x ) } )
Theorem	fvelrnb 5309*	A member of a function's range is a value of the function. (Contributed by NM, 31-Oct-1995.)
|- ( F Fn A -> ( B e. ran F <-> E. x e. A ( F ` x ) = B ) )
Theorem	dfimafn 5310*	Alternate definition of the image of a function. (Contributed by Raph Levien, 20-Nov-2006.)
|- ( ( Fun F /\ A C_ dom F ) -> ( F " A ) = { y | E. x e. A ( F ` x ) = y } )
Theorem	dfimafn2 5311*	Alternate definition of the image of a function as an indexed union of singletons of function values. (Contributed by Raph Levien, 20-Nov-2006.)
|- ( ( Fun F /\ A C_ dom F ) -> ( F " A ) = U_ x e. A { ( F ` x ) } )
Theorem	funimass4 5312*	Membership relation for the values of a function whose image is a subclass. (Contributed by Raph Levien, 20-Nov-2006.)
|- ( ( Fun F /\ A C_ dom F ) -> ( ( F " A ) C_ B <-> A. x e. A ( F ` x ) e. B ) )
Theorem	fvelima 5313*	Function value in an image. Part of Theorem 4.4(iii) of [Monk1] p. 42. (Contributed by NM, 29-Apr-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
|- ( ( Fun F /\ A e. ( F " B ) ) -> E. x e. B ( F ` x ) = A )
Theorem	feqmptd 5314*	Deduction form of dffn5im 5307. (Contributed by Mario Carneiro, 8-Jan-2015.)
|- ( ph -> F : A --> B )   =>    |- ( ph -> F = ( x e. A |-> ( F ` x ) ) )
Theorem	feqresmpt 5315*	Express a restricted function as a mapping. (Contributed by Mario Carneiro, 18-May-2016.)
|- ( ph -> F : A --> B )   &    |- ( ph -> C C_ A )   =>    |- ( ph -> ( F |` C ) = ( x e. C |-> ( F ` x ) ) )
Theorem	dffn5imf 5316*	Representation of a function in terms of its values. (Contributed by Jim Kingdon, 31-Dec-2018.)
|- F/_ x F   =>    |- ( F Fn A -> F = ( x e. A |-> ( F ` x ) ) )
Theorem	fvelimab 5317*	Function value in an image. (Contributed by NM, 20-Jan-2007.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Revised by David Abernethy, 17-Dec-2011.)
|- ( ( F Fn A /\ B C_ A ) -> ( C e. ( F " B ) <-> E. x e. B ( F ` x ) = C ) )
Theorem	fvi 5318	The value of the identity function. (Contributed by NM, 1-May-2004.) (Revised by Mario Carneiro, 28-Apr-2015.)
|- ( A e. V -> ( _I ` A ) = A )
Theorem	fniinfv 5319*	The indexed intersection of a function's values is the intersection of its range. (Contributed by NM, 20-Oct-2005.)
|- ( F Fn A -> |^|_ x e. A ( F ` x ) = |^| ran F )
Theorem	fnsnfv 5320	Singleton of function value. (Contributed by NM, 22-May-1998.)
|- ( ( F Fn A /\ B e. A ) -> { ( F ` B ) } = ( F " { B } ) )
Theorem	fnimapr 5321	The image of a pair under a function. (Contributed by Jeff Madsen, 6-Jan-2011.)
|- ( ( F Fn A /\ B e. A /\ C e. A ) -> ( F " { B , C } ) = { ( F ` B ) , ( F ` C ) } )
Theorem	ssimaex 5322*	The existence of a subimage. (Contributed by NM, 8-Apr-2007.)
|- A e. _V   =>    |- ( ( Fun F /\ B C_ ( F " A ) ) -> E. x ( x C_ A /\ B = ( F " x ) ) )
Theorem	ssimaexg 5323*	The existence of a subimage. (Contributed by FL, 15-Apr-2007.)
|- ( ( A e. C /\ Fun F /\ B C_ ( F " A ) ) -> E. x ( x C_ A /\ B = ( F " x ) ) )
Theorem	funfvdm 5324	A simplified expression for the value of a function when we know it's a function. (Contributed by Jim Kingdon, 1-Jan-2019.)
|- ( ( Fun F /\ A e. dom F ) -> ( F ` A ) = U. ( F " { A } ) )
Theorem	funfvdm2 5325*	The value of a function. Definition of function value in [Enderton] p. 43. (Contributed by Jim Kingdon, 1-Jan-2019.)
|- ( ( Fun F /\ A e. dom F ) -> ( F ` A ) = U. { y | A F y } )
Theorem	funfvdm2f 5326	The value of a function. Version of funfvdm2 5325 using a bound-variable hypotheses instead of distinct variable conditions. (Contributed by Jim Kingdon, 1-Jan-2019.)
|- F/_ y A   &    |- F/_ y F   =>    |- ( ( Fun F /\ A e. dom F ) -> ( F ` A ) = U. { y | A F y } )
Theorem	fvun1 5327	The value of a union when the argument is in the first domain. (Contributed by Scott Fenton, 29-Jun-2013.)
|- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. A ) ) -> ( ( F u. G ) ` X ) = ( F ` X ) )
Theorem	fvun2 5328	The value of a union when the argument is in the second domain. (Contributed by Scott Fenton, 29-Jun-2013.)
|- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. B ) ) -> ( ( F u. G ) ` X ) = ( G ` X ) )
Theorem	dmfco 5329	Domains of a function composition. (Contributed by NM, 27-Jan-1997.)
|- ( ( Fun G /\ A e. dom G ) -> ( A e. dom ( F o. G ) <-> ( G ` A ) e. dom F ) )
Theorem	fvco2 5330	Value of a function composition. Similar to second part of Theorem 3H of [Enderton] p. 47. (Contributed by NM, 9-Oct-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Revised by Stefan O'Rear, 16-Oct-2014.)
|- ( ( G Fn A /\ X e. A ) -> ( ( F o. G ) ` X ) = ( F ` ( G ` X ) ) )
Theorem	fvco 5331	Value of a function composition. Similar to Exercise 5 of [TakeutiZaring] p. 28. (Contributed by NM, 22-Apr-2006.) (Proof shortened by Mario Carneiro, 26-Dec-2014.)
|- ( ( Fun G /\ A e. dom G ) -> ( ( F o. G ) ` A ) = ( F ` ( G ` A ) ) )
Theorem	fvco3 5332	Value of a function composition. (Contributed by NM, 3-Jan-2004.) (Revised by Mario Carneiro, 26-Dec-2014.)
|- ( ( G : A --> B /\ C e. A ) -> ( ( F o. G ) ` C ) = ( F ` ( G ` C ) ) )
Theorem	fvco4 5333	Value of a composition. (Contributed by BJ, 7-Jul-2022.)
|- ( ( ( K : A --> X /\ ( H o. K ) = F ) /\ ( u e. A /\ x = ( K ` u ) ) ) -> ( H ` x ) = ( F ` u ) )
Theorem	fvopab3g 5334*	Value of a function given by ordered-pair class abstraction. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2015.)
|- ( x = A -> ( ph <-> ps ) )   &    |- ( y = B -> ( ps <-> ch ) )   &    |- ( x e. C -> E! y ph )   &    |- F = { <. x , y >. | ( x e. C /\ ph ) }   =>    |- ( ( A e. C /\ B e. D ) -> ( ( F ` A ) = B <-> ch ) )
Theorem	fvopab3ig 5335*	Value of a function given by ordered-pair class abstraction. (Contributed by NM, 23-Oct-1999.)
|- ( x = A -> ( ph <-> ps ) )   &    |- ( y = B -> ( ps <-> ch ) )   &    |- ( x e. C -> E* y ph )   &    |- F = { <. x , y >. | ( x e. C /\ ph ) }   =>    |- ( ( A e. C /\ B e. D ) -> ( ch -> ( F ` A ) = B ) )
Theorem	fvmptss2 5336*	A mapping always evaluates to a subset of the substituted expression in the mapping, even if this is a proper class, or we are out of the domain. (Contributed by Mario Carneiro, 13-Feb-2015.) (Revised by Mario Carneiro, 3-Jul-2019.)
|- ( x = D -> B = C )   &    |- F = ( x e. A |-> B )   =>    |- ( F ` D ) C_ C
Theorem	fvmptg 5337*	Value of a function given in maps-to notation. (Contributed by NM, 2-Oct-2007.) (Revised by Mario Carneiro, 31-Aug-2015.)
|- ( x = A -> B = C )   &    |- F = ( x e. D |-> B )   =>    |- ( ( A e. D /\ C e. R ) -> ( F ` A ) = C )
Theorem	fvmpt 5338*	Value of a function given in maps-to notation. (Contributed by NM, 17-Aug-2011.)
|- ( x = A -> B = C )   &    |- F = ( x e. D |-> B )   &    |- C e. _V   =>    |- ( A e. D -> ( F ` A ) = C )
Theorem	fvmpts 5339*	Value of a function given in maps-to notation, using explicit class substitution. (Contributed by Scott Fenton, 17-Jul-2013.) (Revised by Mario Carneiro, 31-Aug-2015.)
|- F = ( x e. C |-> B )   =>    |- ( ( A e. C /\ [_ A / x ]_ B e. V ) -> ( F ` A ) = [_ A / x ]_ B )
Theorem	fvmpt3 5340*	Value of a function given in maps-to notation, with a slightly different sethood condition. (Contributed by Stefan O'Rear, 30-Jan-2015.)
|- ( x = A -> B = C )   &    |- F = ( x e. D |-> B )   &    |- ( x e. D -> B e. V )   =>    |- ( A e. D -> ( F ` A ) = C )
Theorem	fvmpt3i 5341*	Value of a function given in maps-to notation, with a slightly different sethood condition. (Contributed by Mario Carneiro, 11-Sep-2015.)
|- ( x = A -> B = C )   &    |- F = ( x e. D |-> B )   &    |- B e. _V   =>    |- ( A e. D -> ( F ` A ) = C )
Theorem	fvmptd 5342*	Deduction version of fvmpt 5338. (Contributed by Scott Fenton, 18-Feb-2013.) (Revised by Mario Carneiro, 31-Aug-2015.)
|- ( ph -> F = ( x e. D |-> B ) )   &    |- ( ( ph /\ x = A ) -> B = C )   &    |- ( ph -> A e. D )   &    |- ( ph -> C e. V )   =>    |- ( ph -> ( F ` A ) = C )
Theorem	fvmpt2 5343*	Value of a function given by the maps-to notation. (Contributed by FL, 21-Jun-2010.)
|- F = ( x e. A |-> B )   =>    |- ( ( x e. A /\ B e. C ) -> ( F ` x ) = B )
Theorem	fvmptssdm 5344*	If all the values of the mapping are subsets of a class C, then so is any evaluation of the mapping at a value in the domain of the mapping. (Contributed by Jim Kingdon, 3-Jan-2018.)
|- F = ( x e. A |-> B )   =>    |- ( ( D e. dom F /\ A. x e. A B C_ C ) -> ( F ` D ) C_ C )
Theorem	mptfvex 5345*	Sufficient condition for a maps-to notation to be set-like. (Contributed by Mario Carneiro, 3-Jul-2019.)
|- F = ( x e. A |-> B )   =>    |- ( ( A. x B e. V /\ C e. W ) -> ( F ` C ) e. _V )
Theorem	fvmpt2d 5346*	Deduction version of fvmpt2 5343. (Contributed by Thierry Arnoux, 8-Dec-2016.)
|- ( ph -> F = ( x e. A |-> B ) )   &    |- ( ( ph /\ x e. A ) -> B e. V )   =>    |- ( ( ph /\ x e. A ) -> ( F ` x ) = B )
Theorem	fvmptdf 5347*	Alternate deduction version of fvmpt 5338, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.)
|- ( ph -> A e. D )   &    |- ( ( ph /\ x = A ) -> B e. V )   &    |- ( ( ph /\ x = A ) -> ( ( F ` A ) = B -> ps ) )   &    |- F/_ x F   &    |- F/ x ps   =>    |- ( ph -> ( F = ( x e. D |-> B ) -> ps ) )
Theorem	fvmptdv 5348*	Alternate deduction version of fvmpt 5338, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.)
|- ( ph -> A e. D )   &    |- ( ( ph /\ x = A ) -> B e. V )   &    |- ( ( ph /\ x = A ) -> ( ( F ` A ) = B -> ps ) )   =>    |- ( ph -> ( F = ( x e. D |-> B ) -> ps ) )
Theorem	fvmptdv2 5349*	Alternate deduction version of fvmpt 5338, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.)
|- ( ph -> A e. D )   &    |- ( ( ph /\ x = A ) -> B e. V )   &    |- ( ( ph /\ x = A ) -> B = C )   =>    |- ( ph -> ( F = ( x e. D |-> B ) -> ( F ` A ) = C ) )
Theorem	mpteqb 5350*	Bidirectional equality theorem for a mapping abstraction. Equivalent to eqfnfv 5354. (Contributed by Mario Carneiro, 14-Nov-2014.)
|- ( A. x e. A B e. V -> ( ( x e. A |-> B ) = ( x e. A |-> C ) <-> A. x e. A B = C ) )
Theorem	fvmptt 5351*	Closed theorem form of fvmpt 5338. (Contributed by Scott Fenton, 21-Feb-2013.) (Revised by Mario Carneiro, 11-Sep-2015.)
|- ( ( A. x ( x = A -> B = C ) /\ F = ( x e. D |-> B ) /\ ( A e. D /\ C e. V ) ) -> ( F ` A ) = C )
Theorem	fvmptf 5352*	Value of a function given by an ordered-pair class abstraction. This version of fvmptg 5337 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 8-Nov-2005.) (Revised by Mario Carneiro, 15-Oct-2016.)
|- F/_ x A   &    |- F/_ x C   &    |- ( x = A -> B = C )   &    |- F = ( x e. D |-> B )   =>    |- ( ( A e. D /\ C e. V ) -> ( F ` A ) = C )
Theorem	fvopab6 5353*	Value of a function given by ordered-pair class abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 11-Sep-2015.)
|- F = { <. x , y >. | ( ph /\ y = B ) }   &    |- ( x = A -> ( ph <-> ps ) )   &    |- ( x = A -> B = C )   =>    |- ( ( A e. D /\ C e. R /\ ps ) -> ( F ` A ) = C )
Theorem	eqfnfv 5354*	Equality of functions is determined by their values. Special case of Exercise 4 of [TakeutiZaring] p. 28 (with domain equality omitted). (Contributed by NM, 3-Aug-1994.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
|- ( ( F Fn A /\ G Fn A ) -> ( F = G <-> A. x e. A ( F ` x ) = ( G ` x ) ) )
Theorem	eqfnfv2 5355*	Equality of functions is determined by their values. Exercise 4 of [TakeutiZaring] p. 28. (Contributed by NM, 3-Aug-1994.) (Revised by Mario Carneiro, 31-Aug-2015.)
|- ( ( F Fn A /\ G Fn B ) -> ( F = G <-> ( A = B /\ A. x e. A ( F ` x ) = ( G ` x ) ) ) )
Theorem	eqfnfv3 5356*	Derive equality of functions from equality of their values. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( ( F Fn A /\ G Fn B ) -> ( F = G <-> ( B C_ A /\ A. x e. A ( x e. B /\ ( F ` x ) = ( G ` x ) ) ) ) )
Theorem	eqfnfvd 5357*	Deduction for equality of functions. (Contributed by Mario Carneiro, 24-Jul-2014.)
|- ( ph -> F Fn A )   &    |- ( ph -> G Fn A )   &    |- ( ( ph /\ x e. A ) -> ( F ` x ) = ( G ` x ) )   =>    |- ( ph -> F = G )
Theorem	eqfnfv2f 5358*	Equality of functions is determined by their values. Special case of Exercise 4 of [TakeutiZaring] p. 28 (with domain equality omitted). This version of eqfnfv 5354 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 29-Jan-2004.)
|- F/_ x F   &    |- F/_ x G   =>    |- ( ( F Fn A /\ G Fn A ) -> ( F = G <-> A. x e. A ( F ` x ) = ( G ` x ) ) )
Theorem	eqfunfv 5359*	Equality of functions is determined by their values. (Contributed by Scott Fenton, 19-Jun-2011.)
|- ( ( Fun F /\ Fun G ) -> ( F = G <-> ( dom F = dom G /\ A. x e. dom F ( F ` x ) = ( G ` x ) ) ) )
Theorem	fvreseq 5360*	Equality of restricted functions is determined by their values. (Contributed by NM, 3-Aug-1994.)
|- ( ( ( F Fn A /\ G Fn A ) /\ B C_ A ) -> ( ( F |` B ) = ( G |` B ) <-> A. x e. B ( F ` x ) = ( G ` x ) ) )
Theorem	fndmdif 5361*	Two ways to express the locus of differences between two functions. (Contributed by Stefan O'Rear, 17-Jan-2015.)
|- ( ( F Fn A /\ G Fn A ) -> dom ( F \ G ) = { x e. A | ( F ` x ) =/= ( G ` x ) } )
Theorem	fndmdifcom 5362	The difference set between two functions is commutative. (Contributed by Stefan O'Rear, 17-Jan-2015.)
|- ( ( F Fn A /\ G Fn A ) -> dom ( F \ G ) = dom ( G \ F ) )
Theorem	fndmin 5363*	Two ways to express the locus of equality between two functions. (Contributed by Stefan O'Rear, 17-Jan-2015.)
|- ( ( F Fn A /\ G Fn A ) -> dom ( F i^i G ) = { x e. A | ( F ` x ) = ( G ` x ) } )
Theorem	fneqeql 5364	Two functions are equal iff their equalizer is the whole domain. (Contributed by Stefan O'Rear, 7-Mar-2015.)
|- ( ( F Fn A /\ G Fn A ) -> ( F = G <-> dom ( F i^i G ) = A ) )
Theorem	fneqeql2 5365	Two functions are equal iff their equalizer contains the whole domain. (Contributed by Stefan O'Rear, 9-Mar-2015.)
|- ( ( F Fn A /\ G Fn A ) -> ( F = G <-> A C_ dom ( F i^i G ) ) )
Theorem	fnreseql 5366	Two functions are equal on a subset iff their equalizer contains that subset. (Contributed by Stefan O'Rear, 7-Mar-2015.)
|- ( ( F Fn A /\ G Fn A /\ X C_ A ) -> ( ( F |` X ) = ( G |` X ) <-> X C_ dom ( F i^i G ) ) )
Theorem	chfnrn 5367*	The range of a choice function (a function that chooses an element from each member of its domain) is included in the union of its domain. (Contributed by NM, 31-Aug-1999.)
|- ( ( F Fn A /\ A. x e. A ( F ` x ) e. x ) -> ran F C_ U. A )
Theorem	funfvop 5368	Ordered pair with function value. Part of Theorem 4.3(i) of [Monk1] p. 41. (Contributed by NM, 14-Oct-1996.)
|- ( ( Fun F /\ A e. dom F ) -> <. A , ( F ` A ) >. e. F )
Theorem	funfvbrb 5369	Two ways to say that A is in the domain of F. (Contributed by Mario Carneiro, 1-May-2014.)
|- ( Fun F -> ( A e. dom F <-> A F ( F ` A ) ) )
Theorem	fvimacnvi 5370	A member of a preimage is a function value argument. (Contributed by NM, 4-May-2007.)
|- ( ( Fun F /\ A e. ( `' F " B ) ) -> ( F ` A ) e. B )
Theorem	fvimacnv 5371	The argument of a function value belongs to the preimage of any class containing the function value. Raph Levien remarks: "This proof is unsatisfying, because it seems to me that funimass2 5054 could probably be strengthened to a biconditional." (Contributed by Raph Levien, 20-Nov-2006.)
|- ( ( Fun F /\ A e. dom F ) -> ( ( F ` A ) e. B <-> A e. ( `' F " B ) ) )
Theorem	funimass3 5372	A kind of contraposition law that infers an image subclass from a subclass of a preimage. Raph Levien remarks: "Likely this could be proved directly, and fvimacnv 5371 would be the special case of A being a singleton, but it works this way round too." (Contributed by Raph Levien, 20-Nov-2006.)
|- ( ( Fun F /\ A C_ dom F ) -> ( ( F " A ) C_ B <-> A C_ ( `' F " B ) ) )
Theorem	funimass5 5373*	A subclass of a preimage in terms of function values. (Contributed by NM, 15-May-2007.)
|- ( ( Fun F /\ A C_ dom F ) -> ( A C_ ( `' F " B ) <-> A. x e. A ( F ` x ) e. B ) )
Theorem	funconstss 5374*	Two ways of specifying that a function is constant on a subdomain. (Contributed by NM, 8-Mar-2007.)
|- ( ( Fun F /\ A C_ dom F ) -> ( A. x e. A ( F ` x ) = B <-> A C_ ( `' F " { B } ) ) )
Theorem	elpreima 5375	Membership in the preimage of a set under a function. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( F Fn A -> ( B e. ( `' F " C ) <-> ( B e. A /\ ( F ` B ) e. C ) ) )
Theorem	fniniseg 5376	Membership in the preimage of a singleton, under a function. (Contributed by Mario Carneiro, 12-May-2014.) (Proof shortened by Mario Carneiro, 28-Apr-2015.)
|- ( F Fn A -> ( C e. ( `' F " { B } ) <-> ( C e. A /\ ( F ` C ) = B ) ) )
Theorem	fncnvima2 5377*	Inverse images under functions expressed as abstractions. (Contributed by Stefan O'Rear, 1-Feb-2015.)
|- ( F Fn A -> ( `' F " B ) = { x e. A | ( F ` x ) e. B } )
Theorem	fniniseg2 5378*	Inverse point images under functions expressed as abstractions. (Contributed by Stefan O'Rear, 1-Feb-2015.)
|- ( F Fn A -> ( `' F " { B } ) = { x e. A | ( F ` x ) = B } )
Theorem	fnniniseg2 5379*	Support sets of functions expressed as abstractions. (Contributed by Stefan O'Rear, 1-Feb-2015.)
|- ( F Fn A -> ( `' F " ( _V \ { B } ) ) = { x e. A | ( F ` x ) =/= B } )
Theorem	rexsupp 5380*	Existential quantification restricted to a support. (Contributed by Stefan O'Rear, 23-Mar-2015.)
|- ( F Fn A -> ( E. x e. ( `' F " ( _V \ { Z } ) ) ph <-> E. x e. A ( ( F ` x ) =/= Z /\ ph ) ) )
Theorem	unpreima 5381	Preimage of a union. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( Fun F -> ( `' F " ( A u. B ) ) = ( ( `' F " A ) u. ( `' F " B ) ) )
Theorem	inpreima 5382	Preimage of an intersection. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 14-Jun-2016.)
|- ( Fun F -> ( `' F " ( A i^i B ) ) = ( ( `' F " A ) i^i ( `' F " B ) ) )
Theorem	difpreima 5383	Preimage of a difference. (Contributed by Mario Carneiro, 14-Jun-2016.)
|- ( Fun F -> ( `' F " ( A \ B ) ) = ( ( `' F " A ) \ ( `' F " B ) ) )
Theorem	respreima 5384	The preimage of a restricted function. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( Fun F -> ( `' ( F |` B ) " A ) = ( ( `' F " A ) i^i B ) )
Theorem	fimacnv 5385	The preimage of the codomain of a mapping is the mapping's domain. (Contributed by FL, 25-Jan-2007.)
|- ( F : A --> B -> ( `' F " B ) = A )
Theorem	fnopfv 5386	Ordered pair with function value. Part of Theorem 4.3(i) of [Monk1] p. 41. (Contributed by NM, 30-Sep-2004.)
|- ( ( F Fn A /\ B e. A ) -> <. B , ( F ` B ) >. e. F )
Theorem	fvelrn 5387	A function's value belongs to its range. (Contributed by NM, 14-Oct-1996.)
|- ( ( Fun F /\ A e. dom F ) -> ( F ` A ) e. ran F )
Theorem	fnfvelrn 5388	A function's value belongs to its range. (Contributed by NM, 15-Oct-1996.)
|- ( ( F Fn A /\ B e. A ) -> ( F ` B ) e. ran F )
Theorem	ffvelrn 5389	A function's value belongs to its codomain. (Contributed by NM, 12-Aug-1999.)
|- ( ( F : A --> B /\ C e. A ) -> ( F ` C ) e. B )
Theorem	ffvelrni 5390	A function's value belongs to its codomain. (Contributed by NM, 6-Apr-2005.)
|- F : A --> B   =>    |- ( C e. A -> ( F ` C ) e. B )
Theorem	ffvelrnda 5391	A function's value belongs to its codomain. (Contributed by Mario Carneiro, 29-Dec-2016.)
|- ( ph -> F : A --> B )   =>    |- ( ( ph /\ C e. A ) -> ( F ` C ) e. B )
Theorem	ffvelrnd 5392	A function's value belongs to its codomain. (Contributed by Mario Carneiro, 29-Dec-2016.)
|- ( ph -> F : A --> B )   &    |- ( ph -> C e. A )   =>    |- ( ph -> ( F ` C ) e. B )
Theorem	rexrn 5393*	Restricted existential quantification over the range of a function. (Contributed by Mario Carneiro, 24-Dec-2013.) (Revised by Mario Carneiro, 20-Aug-2014.)
|- ( x = ( F ` y ) -> ( ph <-> ps ) )   =>    |- ( F Fn A -> ( E. x e. ran F ph <-> E. y e. A ps ) )
Theorem	ralrn 5394*	Restricted universal quantification over the range of a function. (Contributed by Mario Carneiro, 24-Dec-2013.) (Revised by Mario Carneiro, 20-Aug-2014.)
|- ( x = ( F ` y ) -> ( ph <-> ps ) )   =>    |- ( F Fn A -> ( A. x e. ran F ph <-> A. y e. A ps ) )
Theorem	elrnrexdm 5395*	For any element in the range of a function there is an element in the domain of the function for which the function value is the element of the range. (Contributed by Alexander van der Vekens, 8-Dec-2017.)
|- ( Fun F -> ( Y e. ran F -> E. x e. dom F Y = ( F ` x ) ) )
Theorem	elrnrexdmb 5396*	For any element in the range of a function there is an element in the domain of the function for which the function value is the element of the range. (Contributed by Alexander van der Vekens, 17-Dec-2017.)
|- ( Fun F -> ( Y e. ran F <-> E. x e. dom F Y = ( F ` x ) ) )
Theorem	eldmrexrn 5397*	For any element in the domain of a function there is an element in the range of the function which is the function value for the element of the domain. (Contributed by Alexander van der Vekens, 8-Dec-2017.)
|- ( Fun F -> ( Y e. dom F -> E. x e. ran F x = ( F ` Y ) ) )
Theorem	ralrnmpt 5398*	A restricted quantifier over an image set. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- F = ( x e. A |-> B )   &    |- ( y = B -> ( ps <-> ch ) )   =>    |- ( A. x e. A B e. V -> ( A. y e. ran F ps <-> A. x e. A ch ) )
Theorem	rexrnmpt 5399*	A restricted quantifier over an image set. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- F = ( x e. A |-> B )   &    |- ( y = B -> ( ps <-> ch ) )   =>    |- ( A. x e. A B e. V -> ( E. y e. ran F ps <-> E. x e. A ch ) )
Theorem	dff2 5400	Alternate definition of a mapping. (Contributed by NM, 14-Nov-2007.)
|- ( F : A --> B <-> ( F Fn A /\ F C_ ( A X. B ) ) )