ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fmpt Unicode version

Theorem fmpt 5635
Description: Functionality of the mapping operation. (Contributed by Mario Carneiro, 26-Jul-2013.) (Revised by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
fmpt.1  |-  F  =  ( x  e.  A  |->  C )
Assertion
Ref Expression
fmpt  |-  ( A. x  e.  A  C  e.  B  <->  F : A --> B )
Distinct variable groups:    x, A    x, B
Allowed substitution hints:    C( x)    F( x)

Proof of Theorem fmpt
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 fmpt.1 . . . 4  |-  F  =  ( x  e.  A  |->  C )
21fnmpt 5314 . . 3  |-  ( A. x  e.  A  C  e.  B  ->  F  Fn  A )
31rnmpt 4852 . . . 4  |-  ran  F  =  { y  |  E. x  e.  A  y  =  C }
4 r19.29 2603 . . . . . . 7  |-  ( ( A. x  e.  A  C  e.  B  /\  E. x  e.  A  y  =  C )  ->  E. x  e.  A  ( C  e.  B  /\  y  =  C
) )
5 eleq1 2229 . . . . . . . . 9  |-  ( y  =  C  ->  (
y  e.  B  <->  C  e.  B ) )
65biimparc 297 . . . . . . . 8  |-  ( ( C  e.  B  /\  y  =  C )  ->  y  e.  B )
76rexlimivw 2579 . . . . . . 7  |-  ( E. x  e.  A  ( C  e.  B  /\  y  =  C )  ->  y  e.  B )
84, 7syl 14 . . . . . 6  |-  ( ( A. x  e.  A  C  e.  B  /\  E. x  e.  A  y  =  C )  -> 
y  e.  B )
98ex 114 . . . . 5  |-  ( A. x  e.  A  C  e.  B  ->  ( E. x  e.  A  y  =  C  ->  y  e.  B ) )
109abssdv 3216 . . . 4  |-  ( A. x  e.  A  C  e.  B  ->  { y  |  E. x  e.  A  y  =  C }  C_  B )
113, 10eqsstrid 3188 . . 3  |-  ( A. x  e.  A  C  e.  B  ->  ran  F  C_  B )
12 df-f 5192 . . 3  |-  ( F : A --> B  <->  ( F  Fn  A  /\  ran  F  C_  B ) )
132, 11, 12sylanbrc 414 . 2  |-  ( A. x  e.  A  C  e.  B  ->  F : A
--> B )
14 fimacnv 5614 . . . 4  |-  ( F : A --> B  -> 
( `' F " B )  =  A )
151mptpreima 5097 . . . 4  |-  ( `' F " B )  =  { x  e.  A  |  C  e.  B }
1614, 15eqtr3di 2214 . . 3  |-  ( F : A --> B  ->  A  =  { x  e.  A  |  C  e.  B } )
17 rabid2 2642 . . 3  |-  ( A  =  { x  e.  A  |  C  e.  B }  <->  A. x  e.  A  C  e.  B )
1816, 17sylib 121 . 2  |-  ( F : A --> B  ->  A. x  e.  A  C  e.  B )
1913, 18impbii 125 1  |-  ( A. x  e.  A  C  e.  B  <->  F : A --> B )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1343    e. wcel 2136   {cab 2151   A.wral 2444   E.wrex 2445   {crab 2448    C_ wss 3116    |-> cmpt 4043   `'ccnv 4603   ran crn 4605   "cima 4607    Fn wfn 5183   -->wf 5184
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196
This theorem is referenced by:  f1ompt  5636  fmpti  5637  fvmptelrn  5638  fmptd  5639  fmptdf  5642  rnmptss  5646  f1oresrab  5650  idref  5725  f1mpt  5739  f1stres  6127  f2ndres  6128  fmpox  6168  fmpoco  6184  iunon  6252  mptelixpg  6700  dom2lem  6738  uzf  9469  pcmptcl  12272  upxp  12922  txdis1cn  12928  cnmpt11  12933  cnmpt21  12941  fsumcncntop  13206  cncfmpt1f  13234  mulcncflem  13240  mulcncf  13241  cnmptlimc  13293  sincn  13340  coscn  13341
  Copyright terms: Public domain W3C validator