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

Theorem f1ompt 5862
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 5556 . . . . 5  |-  ( F : A --> B  ->  F  Fn  A )
2 dff1o4 5646 . . . . . 6  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
32baib 891 . . . . 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 5524 . . . . . 6  |-  ( ( `' F  |`  B )  Fn  B  <->  A. y  e.  B  E! z 
y `' F z )
6 nfcv 2577 . . . . . . . . . 10  |-  F/_ x
z
7 fmpt.1 . . . . . . . . . . 11  |-  F  =  ( x  e.  A  |->  C )
8 nfmpt1 4378 . . . . . . . . . . 11  |-  F/_ x
( x  e.  A  |->  C )
97, 8nfcxfr 2574 . . . . . . . . . 10  |-  F/_ x F
10 nfcv 2577 . . . . . . . . . 10  |-  F/_ x
y
116, 9, 10nfbr 4333 . . . . . . . . 9  |-  F/ x  z F y
12 nfv 1678 . . . . . . . . 9  |-  F/ z ( x  e.  A  /\  y  =  C
)
13 breq1 4292 . . . . . . . . . 10  |-  ( z  =  x  ->  (
z F y  <->  x F
y ) )
14 df-mpt 4349 . . . . . . . . . . . . 13  |-  ( x  e.  A  |->  C )  =  { <. x ,  y >.  |  ( x  e.  A  /\  y  =  C ) }
157, 14eqtri 2461 . . . . . . . . . . . 12  |-  F  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) }
1615breqi 4295 . . . . . . . . . . 11  |-  ( x F y  <->  x { <. x ,  y >.  |  ( x  e.  A  /\  y  =  C ) } y )
17 df-br 4290 . . . . . . . . . . . 12  |-  ( x { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) } y  <->  <. x ,  y >.  e.  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) } )
18 opabid 4593 . . . . . . . . . . . 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 2299 . . . . . . . 8  |-  ( E! z  z F y  <-> 
E! x ( x  e.  A  /\  y  =  C ) )
23 vex 2973 . . . . . . . . . 10  |-  y  e. 
_V
24 vex 2973 . . . . . . . . . 10  |-  z  e. 
_V
2523, 24brcnv 5018 . . . . . . . . 9  |-  ( y `' F z  <->  z F
y )
2625eubii 2281 . . . . . . . 8  |-  ( E! z  y `' F
z  <->  E! z  z F y )
27 df-reu 2720 . . . . . . . 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 2737 . . . . . 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 5203 . . . . . . 7  |-  Rel  `' F
32 df-rn 4847 . . . . . . . 8  |-  ran  F  =  dom  `' F
33 frn 5562 . . . . . . . 8  |-  ( F : A --> B  ->  ran  F  C_  B )
3432, 33syl5eqssr 3398 . . . . . . 7  |-  ( F : A --> B  ->  dom  `' F  C_  B )
35 relssres 5144 . . . . . . 7  |-  ( ( Rel  `' F  /\  dom  `' F  C_  B )  ->  ( `' F  |`  B )  =  `' F )
3631, 34, 35sylancr 658 . . . . . 6  |-  ( F : A --> B  -> 
( `' F  |`  B )  =  `' F )
3736fneq1d 5498 . . . . 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 632 . 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 5638 . . 3  |-  ( F : A -1-1-onto-> B  ->  F : A
--> B )
4241pm4.71ri 628 . 2  |-  ( F : A -1-1-onto-> B  <->  ( F : A
--> B  /\  F : A
-1-1-onto-> B ) )
437fmpt 5861 . . 3  |-  ( A. x  e.  A  C  e.  B  <->  F : A --> B )
4443anbi1i 690 . 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 369    = wceq 1364    e. wcel 1761   E!weu 2257   A.wral 2713   E!wreu 2715    C_ wss 3325   <.cop 3880   class class class wbr 4289   {copab 4346    e. cmpt 4347   `'ccnv 4835   dom cdm 4836   ran crn 4837    |` cres 4838   Rel wrel 4841    Fn wfn 5410   -->wf 5411   -1-1-onto->wf1o 5414
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1713  ax-7 1733  ax-9 1765  ax-10 1780  ax-11 1785  ax-12 1797  ax-13 1948  ax-ext 2422  ax-sep 4410  ax-nul 4418  ax-pr 4528
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 962  df-tru 1367  df-ex 1592  df-nf 1595  df-sb 1706  df-eu 2261  df-mo 2262  df-clab 2428  df-cleq 2434  df-clel 2437  df-nfc 2566  df-ne 2606  df-ral 2718  df-rex 2719  df-reu 2720  df-rab 2722  df-v 2972  df-sbc 3184  df-dif 3328  df-un 3330  df-in 3332  df-ss 3339  df-nul 3635  df-if 3789  df-sn 3875  df-pr 3877  df-op 3881  df-uni 4089  df-br 4290  df-opab 4348  df-mpt 4349  df-id 4632  df-xp 4842  df-rel 4843  df-cnv 4844  df-co 4845  df-dm 4846  df-rn 4847  df-res 4848  df-ima 4849  df-iota 5378  df-fun 5417  df-fn 5418  df-f 5419  df-f1 5420  df-fo 5421  df-f1o 5422  df-fv 5423
This theorem is referenced by:  oaf1o  6998  xpf1o  7469  icoshftf1o  11404  dfod2  16058  cusgrafilem2  23323  gsummptf1o  26182  xrmulc1cn  26296  fprodser  27391  numclwlk2lem2f1o  30623
  Copyright terms: Public domain W3C validator