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

Theorem f1ompt 5893
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 5593 . . . . 5  |-  ( F : A --> B  ->  F  Fn  A )
2 dff1o4 5684 . . . . . 6  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
32baib 873 . . . . 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 5563 . . . . . 6  |-  ( ( `' F  |`  B )  Fn  B  <->  A. y  e.  B  E! z 
y `' F z )
6 nfcv 2574 . . . . . . . . . 10  |-  F/_ x
z
7 fmpt.1 . . . . . . . . . . 11  |-  F  =  ( x  e.  A  |->  C )
8 nfmpt1 4300 . . . . . . . . . . 11  |-  F/_ x
( x  e.  A  |->  C )
97, 8nfcxfr 2571 . . . . . . . . . 10  |-  F/_ x F
10 nfcv 2574 . . . . . . . . . 10  |-  F/_ x
y
116, 9, 10nfbr 4258 . . . . . . . . 9  |-  F/ x  z F y
12 nfv 1630 . . . . . . . . 9  |-  F/ z ( x  e.  A  /\  y  =  C
)
13 breq1 4217 . . . . . . . . . 10  |-  ( z  =  x  ->  (
z F y  <->  x F
y ) )
14 df-mpt 4270 . . . . . . . . . . . . 13  |-  ( x  e.  A  |->  C )  =  { <. x ,  y >.  |  ( x  e.  A  /\  y  =  C ) }
157, 14eqtri 2458 . . . . . . . . . . . 12  |-  F  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) }
1615breqi 4220 . . . . . . . . . . 11  |-  ( x F y  <->  x { <. x ,  y >.  |  ( x  e.  A  /\  y  =  C ) } y )
17 df-br 4215 . . . . . . . . . . . 12  |-  ( x { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) } y  <->  <. x ,  y >.  e.  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) } )
18 opabid 4463 . . . . . . . . . . . 12  |-  ( <.
x ,  y >.  e.  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) }  <->  ( x  e.  A  /\  y  =  C ) )
1917, 18bitri 242 . . . . . . . . . . 11  |-  ( x { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  C ) } y  <-> 
( x  e.  A  /\  y  =  C
) )
2016, 19bitri 242 . . . . . . . . . 10  |-  ( x F y  <->  ( x  e.  A  /\  y  =  C ) )
2113, 20syl6bb 254 . . . . . . . . 9  |-  ( z  =  x  ->  (
z F y  <->  ( x  e.  A  /\  y  =  C ) ) )
2211, 12, 21cbveu 2303 . . . . . . . 8  |-  ( E! z  z F y  <-> 
E! x ( x  e.  A  /\  y  =  C ) )
23 vex 2961 . . . . . . . . . 10  |-  y  e. 
_V
24 vex 2961 . . . . . . . . . 10  |-  z  e. 
_V
2523, 24brcnv 5057 . . . . . . . . 9  |-  ( y `' F z  <->  z F
y )
2625eubii 2292 . . . . . . . 8  |-  ( E! z  y `' F
z  <->  E! z  z F y )
27 df-reu 2714 . . . . . . . 8  |-  ( E! x  e.  A  y  =  C  <->  E! x
( x  e.  A  /\  y  =  C
) )
2822, 26, 273bitr4i 270 . . . . . . 7  |-  ( E! z  y `' F
z  <->  E! x  e.  A  y  =  C )
2928ralbii 2731 . . . . . 6  |-  ( A. y  e.  B  E! z  y `' F
z  <->  A. y  e.  B  E! x  e.  A  y  =  C )
305, 29bitri 242 . . . . 5  |-  ( ( `' F  |`  B )  Fn  B  <->  A. y  e.  B  E! x  e.  A  y  =  C )
31 relcnv 5244 . . . . . . 7  |-  Rel  `' F
32 df-rn 4891 . . . . . . . 8  |-  ran  F  =  dom  `' F
33 frn 5599 . . . . . . . 8  |-  ( F : A --> B  ->  ran  F  C_  B )
3432, 33syl5eqssr 3395 . . . . . . 7  |-  ( F : A --> B  ->  dom  `' F  C_  B )
35 relssres 5185 . . . . . . 7  |-  ( ( Rel  `' F  /\  dom  `' F  C_  B )  ->  ( `' F  |`  B )  =  `' F )
3631, 34, 35sylancr 646 . . . . . 6  |-  ( F : A --> B  -> 
( `' F  |`  B )  =  `' F )
3736fneq1d 5538 . . . . 5  |-  ( F : A --> B  -> 
( ( `' F  |`  B )  Fn  B  <->  `' F  Fn  B ) )
3830, 37syl5bbr 252 . . . 4  |-  ( F : A --> B  -> 
( A. y  e.  B  E! x  e.  A  y  =  C  <->  `' F  Fn  B
) )
394, 38bitr4d 249 . . 3  |-  ( F : A --> B  -> 
( F : A -1-1-onto-> B  <->  A. y  e.  B  E! x  e.  A  y  =  C ) )
4039pm5.32i 620 . 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 5676 . . 3  |-  ( F : A -1-1-onto-> B  ->  F : A
--> B )
4241pm4.71ri 616 . 2  |-  ( F : A -1-1-onto-> B  <->  ( F : A
--> B  /\  F : A
-1-1-onto-> B ) )
437fmpt 5892 . . 3  |-  ( A. x  e.  A  C  e.  B  <->  F : A --> B )
4443anbi1i 678 . 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 270 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 set class
Syntax hints:    <-> wb 178    /\ wa 360    = wceq 1653    e. wcel 1726   E!weu 2283   A.wral 2707   E!wreu 2709    C_ wss 3322   <.cop 3819   class class class wbr 4214   {copab 4267    e. cmpt 4268   `'ccnv 4879   dom cdm 4880   ran crn 4881    |` cres 4882   Rel wrel 4885    Fn wfn 5451   -->wf 5452   -1-1-onto->wf1o 5455
This theorem is referenced by:  oaf1o  6808  xpf1o  7271  icoshftf1o  11022  dfod2  15202  cusgrafilem2  21491  xrmulc1cn  24318  fprodser  25277
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-sep 4332  ax-nul 4340  ax-pr 4405
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-mo 2288  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2712  df-rex 2713  df-reu 2714  df-rab 2716  df-v 2960  df-sbc 3164  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-sn 3822  df-pr 3823  df-op 3825  df-uni 4018  df-br 4215  df-opab 4269  df-mpt 4270  df-id 4500  df-xp 4886  df-rel 4887  df-cnv 4888  df-co 4889  df-dm 4890  df-rn 4891  df-res 4892  df-ima 4893  df-iota 5420  df-fun 5458  df-fn 5459  df-f 5460  df-f1 5461  df-fo 5462  df-f1o 5463  df-fv 5464
  Copyright terms: Public domain W3C validator