HomeHome Intuitionistic Logic Explorer
Theorem List (p. 52 of 102)
< Previous  Next >
Browser slow? Try the
Unicode version.

Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 5101-5200   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremf1co 5101 Composition of one-to-one functions. Exercise 30 of [TakeutiZaring] p. 25. (Contributed by NM, 28-May-1998.)
 |-  ( ( F : B -1-1-> C  /\  G : A -1-1-> B )  ->  ( F  o.  G ) : A -1-1-> C )
 
Theoremfoeq1 5102 Equality theorem for onto functions. (Contributed by NM, 1-Aug-1994.)
 |-  ( F  =  G  ->  ( F : A -onto-> B 
 <->  G : A -onto-> B ) )
 
Theoremfoeq2 5103 Equality theorem for onto functions. (Contributed by NM, 1-Aug-1994.)
 |-  ( A  =  B  ->  ( F : A -onto-> C 
 <->  F : B -onto-> C ) )
 
Theoremfoeq3 5104 Equality theorem for onto functions. (Contributed by NM, 1-Aug-1994.)
 |-  ( A  =  B  ->  ( F : C -onto-> A 
 <->  F : C -onto-> B ) )
 
Theoremnffo 5105 Bound-variable hypothesis builder for an onto function. (Contributed by NM, 16-May-2004.)
 |-  F/_ x F   &    |-  F/_ x A   &    |-  F/_ x B   =>    |- 
 F/ x  F : A -onto-> B
 
Theoremfof 5106 An onto mapping is a mapping. (Contributed by NM, 3-Aug-1994.)
 |-  ( F : A -onto-> B  ->  F : A --> B )
 
Theoremfofun 5107 An onto mapping is a function. (Contributed by NM, 29-Mar-2008.)
 |-  ( F : A -onto-> B  ->  Fun  F )
 
Theoremfofn 5108 An onto mapping is a function on its domain. (Contributed by NM, 16-Dec-2008.)
 |-  ( F : A -onto-> B  ->  F  Fn  A )
 
Theoremforn 5109 The codomain of an onto function is its range. (Contributed by NM, 3-Aug-1994.)
 |-  ( F : A -onto-> B  ->  ran  F  =  B )
 
Theoremdffo2 5110 Alternate definition of an onto function. (Contributed by NM, 22-Mar-2006.)
 |-  ( F : A -onto-> B 
 <->  ( F : A --> B  /\  ran  F  =  B ) )
 
Theoremfoima 5111 The image of the domain of an onto function. (Contributed by NM, 29-Nov-2002.)
 |-  ( F : A -onto-> B  ->  ( F " A )  =  B )
 
Theoremdffn4 5112 A function maps onto its range. (Contributed by NM, 10-May-1998.)
 |-  ( F  Fn  A  <->  F : A -onto-> ran  F )
 
Theoremfunforn 5113 A function maps its domain onto its range. (Contributed by NM, 23-Jul-2004.)
 |-  ( Fun  A  <->  A : dom  A -onto-> ran  A )
 
Theoremfodmrnu 5114 An onto function has unique domain and range. (Contributed by NM, 5-Nov-2006.)
 |-  ( ( F : A -onto-> B  /\  F : C -onto-> D )  ->  ( A  =  C  /\  B  =  D )
 )
 
Theoremfores 5115 Restriction of a function. (Contributed by NM, 4-Mar-1997.)
 |-  ( ( Fun  F  /\  A  C_  dom  F ) 
 ->  ( F  |`  A ) : A -onto-> ( F
 " A ) )
 
Theoremfoco 5116 Composition of onto functions. (Contributed by NM, 22-Mar-2006.)
 |-  ( ( F : B -onto-> C  /\  G : A -onto-> B )  ->  ( F  o.  G ) : A -onto-> C )
 
Theoremf1oeq1 5117 Equality theorem for one-to-one onto functions. (Contributed by NM, 10-Feb-1997.)
 |-  ( F  =  G  ->  ( F : A -1-1-onto-> B  <->  G : A -1-1-onto-> B ) )
 
Theoremf1oeq2 5118 Equality theorem for one-to-one onto functions. (Contributed by NM, 10-Feb-1997.)
 |-  ( A  =  B  ->  ( F : A -1-1-onto-> C  <->  F : B -1-1-onto-> C ) )
 
Theoremf1oeq3 5119 Equality theorem for one-to-one onto functions. (Contributed by NM, 10-Feb-1997.)
 |-  ( A  =  B  ->  ( F : C -1-1-onto-> A  <->  F : C -1-1-onto-> B ) )
 
Theoremf1oeq23 5120 Equality theorem for one-to-one onto functions. (Contributed by FL, 14-Jul-2012.)
 |-  ( ( A  =  B  /\  C  =  D )  ->  ( F : A
 -1-1-onto-> C 
 <->  F : B -1-1-onto-> D ) )
 
Theoremf1eq123d 5121 Equality deduction for one-to-one functions. (Contributed by Mario Carneiro, 27-Jan-2017.)
 |-  ( ph  ->  F  =  G )   &    |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  C  =  D )   =>    |-  ( ph  ->  ( F : A -1-1-> C  <->  G : B -1-1-> D ) )
 
Theoremfoeq123d 5122 Equality deduction for onto functions. (Contributed by Mario Carneiro, 27-Jan-2017.)
 |-  ( ph  ->  F  =  G )   &    |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  C  =  D )   =>    |-  ( ph  ->  ( F : A -onto-> C  <->  G : B -onto-> D ) )
 
Theoremf1oeq123d 5123 Equality deduction for one-to-one onto functions. (Contributed by Mario Carneiro, 27-Jan-2017.)
 |-  ( ph  ->  F  =  G )   &    |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  C  =  D )   =>    |-  ( ph  ->  ( F : A -1-1-onto-> C  <->  G : B -1-1-onto-> D ) )
 
Theoremnff1o 5124 Bound-variable hypothesis builder for a one-to-one onto function. (Contributed by NM, 16-May-2004.)
 |-  F/_ x F   &    |-  F/_ x A   &    |-  F/_ x B   =>    |- 
 F/ x  F : A
 -1-1-onto-> B
 
Theoremf1of1 5125 A one-to-one onto mapping is a one-to-one mapping. (Contributed by NM, 12-Dec-2003.)
 |-  ( F : A -1-1-onto-> B  ->  F : A -1-1-> B )
 
Theoremf1of 5126 A one-to-one onto mapping is a mapping. (Contributed by NM, 12-Dec-2003.)
 |-  ( F : A -1-1-onto-> B  ->  F : A --> B )
 
Theoremf1ofn 5127 A one-to-one onto mapping is function on its domain. (Contributed by NM, 12-Dec-2003.)
 |-  ( F : A -1-1-onto-> B  ->  F  Fn  A )
 
Theoremf1ofun 5128 A one-to-one onto mapping is a function. (Contributed by NM, 12-Dec-2003.)
 |-  ( F : A -1-1-onto-> B  ->  Fun  F )
 
Theoremf1orel 5129 A one-to-one onto mapping is a relation. (Contributed by NM, 13-Dec-2003.)
 |-  ( F : A -1-1-onto-> B  ->  Rel  F )
 
Theoremf1odm 5130 The domain of a one-to-one onto mapping. (Contributed by NM, 8-Mar-2014.)
 |-  ( F : A -1-1-onto-> B  ->  dom  F  =  A )
 
Theoremdff1o2 5131 Alternate definition of one-to-one onto function. (Contributed by NM, 10-Feb-1997.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  Fun  `' F  /\  ran  F  =  B ) )
 
Theoremdff1o3 5132 Alternate definition of one-to-one onto function. (Contributed by NM, 25-Mar-1998.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( F : A -1-1-onto-> B  <->  ( F : A -onto-> B  /\  Fun  `' F ) )
 
Theoremf1ofo 5133 A one-to-one onto function is an onto function. (Contributed by NM, 28-Apr-2004.)
 |-  ( F : A -1-1-onto-> B  ->  F : A -onto-> B )
 
Theoremdff1o4 5134 Alternate definition of one-to-one onto function. (Contributed by NM, 25-Mar-1998.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
 
Theoremdff1o5 5135 Alternate definition of one-to-one onto function. (Contributed by NM, 10-Dec-2003.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( F : A -1-1-onto-> B  <->  ( F : A -1-1-> B  /\  ran  F  =  B ) )
 
Theoremf1orn 5136 A one-to-one function maps onto its range. (Contributed by NM, 13-Aug-2004.)
 |-  ( F : A -1-1-onto-> ran  F  <-> 
 ( F  Fn  A  /\  Fun  `' F ) )
 
Theoremf1f1orn 5137 A one-to-one function maps one-to-one onto its range. (Contributed by NM, 4-Sep-2004.)
 |-  ( F : A -1-1-> B 
 ->  F : A -1-1-onto-> ran  F )
 
Theoremf1oabexg 5138* The class of all 1-1-onto functions mapping one set to another is a set. (Contributed by Paul Chapman, 25-Feb-2008.)
 |-  F  =  { f  |  ( f : A -1-1-onto-> B  /\  ph ) }   =>    |-  ( ( A  e.  C  /\  B  e.  D )  ->  F  e.  _V )
 
Theoremf1ocnv 5139 The converse of a one-to-one onto function is also one-to-one onto. (Contributed by NM, 11-Feb-1997.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( F : A -1-1-onto-> B  ->  `' F : B -1-1-onto-> A )
 
Theoremf1ocnvb 5140 A relation is a one-to-one onto function iff its converse is a one-to-one onto function with domain and range interchanged. (Contributed by NM, 8-Dec-2003.)
 |-  ( Rel  F  ->  ( F : A -1-1-onto-> B  <->  `' F : B -1-1-onto-> A ) )
 
Theoremf1ores 5141 The restriction of a one-to-one function maps one-to-one onto the image. (Contributed by NM, 25-Mar-1998.)
 |-  ( ( F : A -1-1-> B  /\  C  C_  A )  ->  ( F  |`  C ) : C -1-1-onto-> ( F " C ) )
 
Theoremf1orescnv 5142 The converse of a one-to-one-onto restricted function. (Contributed by Paul Chapman, 21-Apr-2008.)
 |-  ( ( Fun  `' F  /\  ( F  |`  R ) : R -1-1-onto-> P )  ->  ( `' F  |`  P ) : P -1-1-onto-> R )
 
Theoremf1imacnv 5143 Preimage of an image. (Contributed by NM, 30-Sep-2004.)
 |-  ( ( F : A -1-1-> B  /\  C  C_  A )  ->  ( `' F " ( F
 " C ) )  =  C )
 
Theoremfoimacnv 5144 A reverse version of f1imacnv 5143. (Contributed by Jeff Hankins, 16-Jul-2009.)
 |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( F
 " ( `' F " C ) )  =  C )
 
Theoremfoun 5145 The union of two onto functions with disjoint domains is an onto function. (Contributed by Mario Carneiro, 22-Jun-2016.)
 |-  ( ( ( F : A -onto-> B  /\  G : C -onto-> D ) 
 /\  ( A  i^i  C )  =  (/) )  ->  ( F  u.  G ) : ( A  u.  C ) -onto-> ( B  u.  D ) )
 
Theoremf1oun 5146 The union of two one-to-one onto functions with disjoint domains and ranges. (Contributed by NM, 26-Mar-1998.)
 |-  ( ( ( F : A -1-1-onto-> B  /\  G : C
 -1-1-onto-> D )  /\  ( ( A  i^i  C )  =  (/)  /\  ( B  i^i  D )  =  (/) ) )  ->  ( F  u.  G ) : ( A  u.  C )
 -1-1-onto-> ( B  u.  D ) )
 
Theoremfun11iun 5147* The union of a chain (with respect to inclusion) of one-to-one functions is a one-to-one function. (Contributed by Mario Carneiro, 20-May-2013.) (Revised by Mario Carneiro, 24-Jun-2015.)
 |-  ( x  =  y 
 ->  B  =  C )   &    |-  B  e.  _V   =>    |-  ( A. x  e.  A  ( B : D -1-1-> S  /\  A. y  e.  A  ( B  C_  C  \/  C  C_  B ) )  ->  U_ x  e.  A  B : U_ x  e.  A  D -1-1-> S )
 
Theoremresdif 5148 The restriction of a one-to-one onto function to a difference maps onto the difference of the images. (Contributed by Paul Chapman, 11-Apr-2009.)
 |-  ( ( Fun  `' F  /\  ( F  |`  A ) : A -onto-> C  /\  ( F  |`  B ) : B -onto-> D ) 
 ->  ( F  |`  ( A 
 \  B ) ) : ( A  \  B ) -1-1-onto-> ( C  \  D ) )
 
Theoremf1oco 5149 Composition of one-to-one onto functions. (Contributed by NM, 19-Mar-1998.)
 |-  ( ( F : B
 -1-1-onto-> C  /\  G : A -1-1-onto-> B )  ->  ( F  o.  G ) : A -1-1-onto-> C )
 
Theoremf1cnv 5150 The converse of an injective function is bijective. (Contributed by FL, 11-Nov-2011.)
 |-  ( F : A -1-1-> B 
 ->  `' F : ran  F -1-1-onto-> A )
 
Theoremfuncocnv2 5151 Composition with the converse. (Contributed by Jeff Madsen, 2-Sep-2009.)
 |-  ( Fun  F  ->  ( F  o.  `' F )  =  (  _I  |` 
 ran  F ) )
 
Theoremfococnv2 5152 The composition of an onto function and its converse. (Contributed by Stefan O'Rear, 12-Feb-2015.)
 |-  ( F : A -onto-> B  ->  ( F  o.  `' F )  =  (  _I  |`  B )
 )
 
Theoremf1ococnv2 5153 The composition of a one-to-one onto function and its converse equals the identity relation restricted to the function's range. (Contributed by NM, 13-Dec-2003.) (Proof shortened by Stefan O'Rear, 12-Feb-2015.)
 |-  ( F : A -1-1-onto-> B  ->  ( F  o.  `' F )  =  (  _I  |`  B ) )
 
Theoremf1cocnv2 5154 Composition of an injective function with its converse. (Contributed by FL, 11-Nov-2011.)
 |-  ( F : A -1-1-> B 
 ->  ( F  o.  `' F )  =  (  _I  |`  ran  F )
 )
 
Theoremf1ococnv1 5155 The composition of a one-to-one onto function's converse and itself equals the identity relation restricted to the function's domain. (Contributed by NM, 13-Dec-2003.)
 |-  ( F : A -1-1-onto-> B  ->  ( `' F  o.  F )  =  (  _I  |`  A ) )
 
Theoremf1cocnv1 5156 Composition of an injective function with its converse. (Contributed by FL, 11-Nov-2011.)
 |-  ( F : A -1-1-> B 
 ->  ( `' F  o.  F )  =  (  _I  |`  A ) )
 
Theoremfuncoeqres 5157 Re-express a constraint on a composition as a constraint on the composand. (Contributed by Stefan O'Rear, 7-Mar-2015.)
 |-  ( ( Fun  G  /\  ( F  o.  G )  =  H )  ->  ( F  |`  ran  G )  =  ( H  o.  `' G ) )
 
Theoremffoss 5158* Relationship between a mapping and an onto mapping. Figure 38 of [Enderton] p. 145. (Contributed by NM, 10-May-1998.)
 |-  F  e.  _V   =>    |-  ( F : A
 --> B  <->  E. x ( F : A -onto-> x  /\  x  C_  B ) )
 
Theoremf11o 5159* Relationship between one-to-one and one-to-one onto function. (Contributed by NM, 4-Apr-1998.)
 |-  F  e.  _V   =>    |-  ( F : A -1-1-> B  <->  E. x ( F : A -1-1-onto-> x  /\  x  C_  B ) )
 
Theoremf10 5160 The empty set maps one-to-one into any class. (Contributed by NM, 7-Apr-1998.)
 |-  (/) : (/) -1-1-> A
 
Theoremf1o00 5161 One-to-one onto mapping of the empty set. (Contributed by NM, 15-Apr-1998.)
 |-  ( F : (/) -1-1-onto-> A  <->  ( F  =  (/)  /\  A  =  (/) ) )
 
Theoremfo00 5162 Onto mapping of the empty set. (Contributed by NM, 22-Mar-2006.)
 |-  ( F : (/) -onto-> A  <-> 
 ( F  =  (/)  /\  A  =  (/) ) )
 
Theoremf1o0 5163 One-to-one onto mapping of the empty set. (Contributed by NM, 10-Sep-2004.)
 |-  (/) : (/)
 -1-1-onto-> (/)
 
Theoremf1oi 5164 A restriction of the identity relation is a one-to-one onto function. (Contributed by NM, 30-Apr-1998.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  (  _I  |`  A ) : A -1-1-onto-> A
 
Theoremf1ovi 5165 The identity relation is a one-to-one onto function on the universe. (Contributed by NM, 16-May-2004.)
 |- 
 _I  : _V -1-1-onto-> _V
 
Theoremf1osn 5166 A singleton of an ordered pair is one-to-one onto function. (Contributed by NM, 18-May-1998.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |- 
 { <. A ,  B >. } : { A }
 -1-1-onto-> { B }
 
Theoremf1osng 5167 A singleton of an ordered pair is one-to-one onto function. (Contributed by Mario Carneiro, 12-Jan-2013.)
 |-  ( ( A  e.  V  /\  B  e.  W )  ->  { <. A ,  B >. } : { A } -1-1-onto-> { B } )
 
Theoremf1oprg 5168 An unordered pair of ordered pairs with different elements is a one-to-one onto function. (Contributed by Alexander van der Vekens, 14-Aug-2017.)
 |-  ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
 )  ->  ( ( A  =/=  C  /\  B  =/=  D )  ->  { <. A ,  B >. ,  <. C ,  D >. } : { A ,  C } -1-1-onto-> { B ,  D }
 ) )
 
Theoremtz6.12-2 5169* Function value when  F is not a function. Theorem 6.12(2) of [TakeutiZaring] p. 27. (Contributed by NM, 30-Apr-2004.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
 |-  ( -.  E! x  A F x  ->  ( F `  A )  =  (/) )
 
Theoremfveu 5170* The value of a function at a unique point. (Contributed by Scott Fenton, 6-Oct-2017.)
 |-  ( E! x  A F x  ->  ( F `
  A )  = 
 U. { x  |  A F x } )
 
Theorembrprcneu 5171* If  A is a proper class, then there is no unique binary relationship with  A as the first element. (Contributed by Scott Fenton, 7-Oct-2017.)
 |-  ( -.  A  e.  _V 
 ->  -.  E! x  A F x )
 
Theoremfvprc 5172 A function's value at a proper class is the empty set. (Contributed by NM, 20-May-1998.)
 |-  ( -.  A  e.  _V 
 ->  ( F `  A )  =  (/) )
 
Theoremfv2 5173* Alternate definition of function value. Definition 10.11 of [Quine] p. 68. (Contributed by NM, 30-Apr-2004.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) (Revised by Mario Carneiro, 31-Aug-2015.)
 |-  ( F `  A )  =  U. { x  |  A. y ( A F y  <->  y  =  x ) }
 
Theoremdffv3g 5174* A definition of function value in terms of iota. (Contributed by Jim Kingdon, 29-Dec-2018.)
 |-  ( A  e.  V  ->  ( F `  A )  =  ( iota x x  e.  ( F
 " { A }
 ) ) )
 
Theoremdffv4g 5175* The previous definition of function value, from before the  iota operator was introduced. Although based on the idea embodied by Definition 10.2 of [Quine] p. 65 (see args 4694), this definition apparently does not appear in the literature. (Contributed by NM, 1-Aug-1994.)
 |-  ( A  e.  V  ->  ( F `  A )  =  U. { x  |  ( F " { A } )  =  { x } } )
 
Theoremelfv 5176* Membership in a function value. (Contributed by NM, 30-Apr-2004.)
 |-  ( A  e.  ( F `  B )  <->  E. x ( A  e.  x  /\  A. y ( B F y 
 <->  y  =  x ) ) )
 
Theoremfveq1 5177 Equality theorem for function value. (Contributed by NM, 29-Dec-1996.)
 |-  ( F  =  G  ->  ( F `  A )  =  ( G `  A ) )
 
Theoremfveq2 5178 Equality theorem for function value. (Contributed by NM, 29-Dec-1996.)
 |-  ( A  =  B  ->  ( F `  A )  =  ( F `  B ) )
 
Theoremfveq1i 5179 Equality inference for function value. (Contributed by NM, 2-Sep-2003.)
 |-  F  =  G   =>    |-  ( F `  A )  =  ( G `  A )
 
Theoremfveq1d 5180 Equality deduction for function value. (Contributed by NM, 2-Sep-2003.)
 |-  ( ph  ->  F  =  G )   =>    |-  ( ph  ->  ( F `  A )  =  ( G `  A ) )
 
Theoremfveq2i 5181 Equality inference for function value. (Contributed by NM, 28-Jul-1999.)
 |-  A  =  B   =>    |-  ( F `  A )  =  ( F `  B )
 
Theoremfveq2d 5182 Equality deduction for function value. (Contributed by NM, 29-May-1999.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  ( F `  A )  =  ( F `  B ) )
 
Theoremfveq12i 5183 Equality deduction for function value. (Contributed by FL, 27-Jun-2014.)
 |-  F  =  G   &    |-  A  =  B   =>    |-  ( F `  A )  =  ( G `  B )
 
Theoremfveq12d 5184 Equality deduction for function value. (Contributed by FL, 22-Dec-2008.)
 |-  ( ph  ->  F  =  G )   &    |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  ( F `  A )  =  ( G `  B ) )
 
Theoremnffv 5185 Bound-variable hypothesis builder for function value. (Contributed by NM, 14-Nov-1995.) (Revised by Mario Carneiro, 15-Oct-2016.)
 |-  F/_ x F   &    |-  F/_ x A   =>    |-  F/_ x ( F `
  A )
 
Theoremnffvmpt1 5186* Bound-variable hypothesis builder for mapping, special case. (Contributed by Mario Carneiro, 25-Dec-2016.)
 |-  F/_ x ( ( x  e.  A  |->  B ) `
  C )
 
Theoremnffvd 5187 Deduction version of bound-variable hypothesis builder nffv 5185. (Contributed by NM, 10-Nov-2005.) (Revised by Mario Carneiro, 15-Oct-2016.)
 |-  ( ph  ->  F/_ x F )   &    |-  ( ph  ->  F/_ x A )   =>    |-  ( ph  ->  F/_ x ( F `  A ) )
 
Theoremfunfveu 5188* A function has one value given an argument in its domain. (Contributed by Jim Kingdon, 29-Dec-2018.)
 |-  ( ( Fun  F  /\  A  e.  dom  F )  ->  E! y  A F y )
 
Theoremfvss 5189* The value of a function is a subset of  B if every element that could be a candidate for the value is a subset of  B. (Contributed by Mario Carneiro, 24-May-2019.)
 |-  ( A. x ( A F x  ->  x  C_  B )  ->  ( F `  A ) 
 C_  B )
 
Theoremfvssunirng 5190 The result of a function value is always a subset of the union of the range, if the input is a set. (Contributed by Stefan O'Rear, 2-Nov-2014.) (Revised by Mario Carneiro, 24-May-2019.)
 |-  ( A  e.  _V  ->  ( F `  A )  C_  U. ran  F )
 
Theoremrelfvssunirn 5191 The result of a function value is always a subset of the union of the range, even if it is invalid and thus empty. (Contributed by Stefan O'Rear, 2-Nov-2014.) (Revised by Mario Carneiro, 24-May-2019.)
 |-  ( Rel  F  ->  ( F `  A ) 
 C_  U. ran  F )
 
Theoremfunfvex 5192 The value of a function exists. A special case of Corollary 6.13 of [TakeutiZaring] p. 27. (Contributed by Jim Kingdon, 29-Dec-2018.)
 |-  ( ( Fun  F  /\  A  e.  dom  F )  ->  ( F `  A )  e.  _V )
 
Theoremrelrnfvex 5193 If a function has a set range, then the function value exists unconditional on the domain. (Contributed by Mario Carneiro, 24-May-2019.)
 |-  ( ( Rel  F  /\  ran  F  e.  _V )  ->  ( F `  A )  e.  _V )
 
Theoremfvexg 5194 Evaluating a set function at a set exists. (Contributed by Mario Carneiro and Jim Kingdon, 28-May-2019.)
 |-  ( ( F  e.  V  /\  A  e.  W )  ->  ( F `  A )  e.  _V )
 
Theoremfvex 5195 Evaluating a set function at a set exists. (Contributed by Mario Carneiro and Jim Kingdon, 28-May-2019.)
 |-  F  e.  V   &    |-  A  e.  W   =>    |-  ( F `  A )  e.  _V
 
Theoremsefvex 5196 If a function is set-like, then the function value exists if the input does. (Contributed by Mario Carneiro, 24-May-2019.)
 |-  ( ( `' F Se  _V 
 /\  A  e.  _V )  ->  ( F `  A )  e.  _V )
 
Theoremfv3 5197* Alternate definition of the value of a function. Definition 6.11 of [TakeutiZaring] p. 26. (Contributed by NM, 30-Apr-2004.) (Revised by Mario Carneiro, 31-Aug-2015.)
 |-  ( F `  A )  =  { x  |  ( E. y ( x  e.  y  /\  A F y )  /\  E! y  A F y ) }
 
Theoremfvres 5198 The value of a restricted function. (Contributed by NM, 2-Aug-1994.)
 |-  ( A  e.  B  ->  ( ( F  |`  B ) `
  A )  =  ( F `  A ) )
 
Theoremfunssfv 5199 The value of a member of the domain of a subclass of a function. (Contributed by NM, 15-Aug-1994.)
 |-  ( ( Fun  F  /\  G  C_  F  /\  A  e.  dom  G ) 
 ->  ( F `  A )  =  ( G `  A ) )
 
Theoremtz6.12-1 5200* Function value. Theorem 6.12(1) of [TakeutiZaring] p. 27. (Contributed by NM, 30-Apr-2004.)
 |-  ( ( A F y  /\  E! y  A F y )  ->  ( F `  A )  =  y )
    < Previous  Next >

Page List
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-10124
  Copyright terms: Public domain < Previous  Next >