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

Theorem fmpt 5829
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 5487 . . 3  |-  ( A. x  e.  A  C  e.  B  ->  F  Fn  A )
31rnmpt 5007 . . . 4  |-  ran  F  =  { y  |  E. x  e.  A  y  =  C }
4 r19.29 2682 . . . . . . 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 2297 . . . . . . . . 9  |-  ( y  =  C  ->  (
y  e.  B  <->  C  e.  B ) )
65biimparc 299 . . . . . . . 8  |-  ( ( C  e.  B  /\  y  =  C )  ->  y  e.  B )
76rexlimivw 2658 . . . . . . 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 115 . . . . 5  |-  ( A. x  e.  A  C  e.  B  ->  ( E. x  e.  A  y  =  C  ->  y  e.  B ) )
109abssdv 3314 . . . 4  |-  ( A. x  e.  A  C  e.  B  ->  { y  |  E. x  e.  A  y  =  C }  C_  B )
113, 10eqsstrid 3286 . . 3  |-  ( A. x  e.  A  C  e.  B  ->  ran  F  C_  B )
12 df-f 5358 . . 3  |-  ( F : A --> B  <->  ( F  Fn  A  /\  ran  F  C_  B ) )
132, 11, 12sylanbrc 417 . 2  |-  ( A. x  e.  A  C  e.  B  ->  F : A
--> B )
14 fimacnv 5808 . . . 4  |-  ( F : A --> B  -> 
( `' F " B )  =  A )
151mptpreima 5258 . . . 4  |-  ( `' F " B )  =  { x  e.  A  |  C  e.  B }
1614, 15eqtr3di 2282 . . 3  |-  ( F : A --> B  ->  A  =  { x  e.  A  |  C  e.  B } )
17 rabid2 2723 . . 3  |-  ( A  =  { x  e.  A  |  C  e.  B }  <->  A. x  e.  A  C  e.  B )
1816, 17sylib 122 . 2  |-  ( F : A --> B  ->  A. x  e.  A  C  e.  B )
1913, 18impbii 126 1  |-  ( A. x  e.  A  C  e.  B  <->  F : A --> B )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   {cab 2220   A.wral 2522   E.wrex 2523   {crab 2526    C_ wss 3213    |-> cmpt 4173   `'ccnv 4750   ran crn 4752   "cima 4754    Fn wfn 5349   -->wf 5350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3045  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-fv 5362
This theorem is referenced by:  f1ompt  5830  fmpti  5831  fvmptelcdm  5832  fmptd  5833  fmptdf  5836  rnmptss  5840  f1oresrab  5844  idref  5931  f1mpt  5946  f1stres  6355  f2ndres  6356  fmpox  6398  fmpoco  6414  iunon  6517  mptelixpg  6971  dom2lem  7013  uzf  9859  ccatalpha  11305  pcmptcl  13044  gsumfzmhm2  14078  upxp  15154  txdis1cn  15160  cnmpt11  15165  cnmpt21  15173  fsumcncntop  15449  cncfmpt1f  15480  mulcncflem  15489  mulcncf  15490  cnmptlimc  15556  sincn  15651  coscn  15652  lgseisenlem3  15962  repiecef  16829
  Copyright terms: Public domain W3C validator