MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  f1ompt Structured version   Unicode version

Theorem f1ompt 6029
Description: Express bijection for a mapping operation. (Contributed by Mario Carneiro, 30-May-2015.) (Revised by Mario Carneiro, 4-Dec-2016.)
Hypothesis
Ref Expression
fmpt.1  |-  F  =  ( x  e.  A  |->  C )
Assertion
Ref Expression
f1ompt  |-  ( F : A -1-1-onto-> B  <->  ( A. x  e.  A  C  e.  B  /\  A. y  e.  B  E! x  e.  A  y  =  C ) )
Distinct variable groups:    x, y, A    x, B, y    y, C    y, F
Allowed substitution hints:    C( x)    F( x)

Proof of Theorem f1ompt
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 ffn 5713 . . . . 5  |-  ( F : A --> B  ->  F  Fn  A )
2 dff1o4 5806 . . . . . 6  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
32baib 901 . . . . 5  |-  ( F  Fn  A  ->  ( F : A -1-1-onto-> B  <->  `' F  Fn  B
) )
41, 3syl 16 . . . 4  |-  ( F : A --> B  -> 
( F : A -1-1-onto-> B  <->  `' F  Fn  B ) )
5 fnres 5679 . . . . . 6  |-  ( ( `' F  |`  B )  Fn  B  <->  A. y  e.  B  E! z 
y `' F z )
6 nfcv 2616 . . . . . . . . . 10  |-  F/_ x
z
7 fmpt.1 . . . . . . . . . . 11  |-  F  =  ( x  e.  A  |->  C )
8 nfmpt1 4528 . . . . . . . . . . 11  |-  F/_ x
( x  e.  A  |->  C )
97, 8nfcxfr 2614 . . . . . . . . . 10  |-  F/_ x F
10 nfcv 2616 . . . . . . . . . 10  |-  F/_ x
y
116, 9, 10nfbr 4483 . . . . . . . . 9  |-  F/ x  z F y
12 nfv 1712 . . . . . . . . 9  |-  F/ z ( x  e.  A  /\  y  =  C
)
13 breq1 4442 . . . . . . . . . 10  |-  ( z  =  x  ->  (
z F y  <->  x F
y ) )
14 df-mpt 4499 . . . . . . . . . . . . 13  |-  ( x  e.  A  |->  C )  =  { <. x ,  y >.  |  ( x  e.  A  /\  y  =  C ) }
157, 14eqtri 2483 . . . . . . . . . . . 12  |-  F  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) }
1615breqi 4445 . . . . . . . . . . 11  |-  ( x F y  <->  x { <. x ,  y >.  |  ( x  e.  A  /\  y  =  C ) } y )
17 df-br 4440 . . . . . . . . . . . 12  |-  ( x { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) } y  <->  <. x ,  y >.  e.  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) } )
18 opabid 4743 . . . . . . . . . . . 12  |-  ( <.
x ,  y >.  e.  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) }  <->  ( x  e.  A  /\  y  =  C ) )
1917, 18bitri 249 . . . . . . . . . . 11  |-  ( x { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) } y  <-> 
( x  e.  A  /\  y  =  C
) )
2016, 19bitri 249 . . . . . . . . . 10  |-  ( x F y  <->  ( x  e.  A  /\  y  =  C ) )
2113, 20syl6bb 261 . . . . . . . . 9  |-  ( z  =  x  ->  (
z F y  <->  ( x  e.  A  /\  y  =  C ) ) )
2211, 12, 21cbveu 2322 . . . . . . . 8  |-  ( E! z  z F y  <-> 
E! x ( x  e.  A  /\  y  =  C ) )
23 vex 3109 . . . . . . . . . 10  |-  y  e. 
_V
24 vex 3109 . . . . . . . . . 10  |-  z  e. 
_V
2523, 24brcnv 5174 . . . . . . . . 9  |-  ( y `' F z  <->  z F
y )
2625eubii 2308 . . . . . . . 8  |-  ( E! z  y `' F
z  <->  E! z  z F y )
27 df-reu 2811 . . . . . . . 8  |-  ( E! x  e.  A  y  =  C  <->  E! x
( x  e.  A  /\  y  =  C
) )
2822, 26, 273bitr4i 277 . . . . . . 7  |-  ( E! z  y `' F
z  <->  E! x  e.  A  y  =  C )
2928ralbii 2885 . . . . . 6  |-  ( A. y  e.  B  E! z  y `' F
z  <->  A. y  e.  B  E! x  e.  A  y  =  C )
305, 29bitri 249 . . . . 5  |-  ( ( `' F  |`  B )  Fn  B  <->  A. y  e.  B  E! x  e.  A  y  =  C )
31 relcnv 5362 . . . . . . 7  |-  Rel  `' F
32 df-rn 4999 . . . . . . . 8  |-  ran  F  =  dom  `' F
33 frn 5719 . . . . . . . 8  |-  ( F : A --> B  ->  ran  F  C_  B )
3432, 33syl5eqssr 3534 . . . . . . 7  |-  ( F : A --> B  ->  dom  `' F  C_  B )
35 relssres 5299 . . . . . . 7  |-  ( ( Rel  `' F  /\  dom  `' F  C_  B )  ->  ( `' F  |`  B )  =  `' F )
3631, 34, 35sylancr 661 . . . . . 6  |-  ( F : A --> B  -> 
( `' F  |`  B )  =  `' F )
3736fneq1d 5653 . . . . 5  |-  ( F : A --> B  -> 
( ( `' F  |`  B )  Fn  B  <->  `' F  Fn  B ) )
3830, 37syl5bbr 259 . . . 4  |-  ( F : A --> B  -> 
( A. y  e.  B  E! x  e.  A  y  =  C  <->  `' F  Fn  B
) )
394, 38bitr4d 256 . . 3  |-  ( F : A --> B  -> 
( F : A -1-1-onto-> B  <->  A. y  e.  B  E! x  e.  A  y  =  C ) )
4039pm5.32i 635 . 2  |-  ( ( F : A --> B  /\  F : A -1-1-onto-> B )  <->  ( F : A --> B  /\  A. y  e.  B  E! x  e.  A  y  =  C ) )
41 f1of 5798 . . 3  |-  ( F : A -1-1-onto-> B  ->  F : A
--> B )
4241pm4.71ri 631 . 2  |-  ( F : A -1-1-onto-> B  <->  ( F : A
--> B  /\  F : A
-1-1-onto-> B ) )
437fmpt 6028 . . 3  |-  ( A. x  e.  A  C  e.  B  <->  F : A --> B )
4443anbi1i 693 . 2  |-  ( ( A. x  e.  A  C  e.  B  /\  A. y  e.  B  E! x  e.  A  y  =  C )  <->  ( F : A --> B  /\  A. y  e.  B  E! x  e.  A  y  =  C ) )
4540, 42, 443bitr4i 277 1  |-  ( F : A -1-1-onto-> B  <->  ( A. x  e.  A  C  e.  B  /\  A. y  e.  B  E! x  e.  A  y  =  C ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 367    = wceq 1398    e. wcel 1823   E!weu 2284   A.wral 2804   E!wreu 2806    C_ wss 3461   <.cop 4022   class class class wbr 4439   {copab 4496    |-> cmpt 4497   `'ccnv 4987   dom cdm 4988   ran crn 4989    |` cres 4990   Rel wrel 4993    Fn wfn 5565   -->wf 5566   -1-1-onto->wf1o 5569
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-sep 4560  ax-nul 4568  ax-pr 4676
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rex 2810  df-reu 2811  df-rab 2813  df-v 3108  df-sbc 3325  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-nul 3784  df-if 3930  df-sn 4017  df-pr 4019  df-op 4023  df-uni 4236  df-br 4440  df-opab 4498  df-mpt 4499  df-id 4784  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578
This theorem is referenced by:  oaf1o  7204  xpf1o  7672  icoshftf1o  11646  fprodser  13838  dfod2  16785  gsummptf1o  17186  cusgrafilem2  24682  numclwlk2lem2f1o  25307  f1mptrn  27693  xrmulc1cn  28147
  Copyright terms: Public domain W3C validator