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

Theorem f1opw2 5984
Description: A one-to-one mapping induces a one-to-one mapping on power sets. This version of f1opw 5985 avoids the Axiom of Replacement. (Contributed by Mario Carneiro, 26-Jun-2015.)
Hypotheses
Ref Expression
f1opw2.1  |-  ( ph  ->  F : A -1-1-onto-> B )
f1opw2.2  |-  ( ph  ->  ( `' F "
a )  e.  _V )
f1opw2.3  |-  ( ph  ->  ( F " b
)  e.  _V )
Assertion
Ref Expression
f1opw2  |-  ( ph  ->  ( b  e.  ~P A  |->  ( F "
b ) ) : ~P A -1-1-onto-> ~P B )
Distinct variable groups:    a, b, A    B, a, b    F, a, b    ph, a, b

Proof of Theorem f1opw2
StepHypRef Expression
1 eqid 2140 . 2  |-  ( b  e.  ~P A  |->  ( F " b ) )  =  ( b  e.  ~P A  |->  ( F " b ) )
2 imassrn 4900 . . . . 5  |-  ( F
" b )  C_  ran  F
3 f1opw2.1 . . . . . . 7  |-  ( ph  ->  F : A -1-1-onto-> B )
4 f1ofo 5382 . . . . . . 7  |-  ( F : A -1-1-onto-> B  ->  F : A -onto-> B )
53, 4syl 14 . . . . . 6  |-  ( ph  ->  F : A -onto-> B
)
6 forn 5356 . . . . . 6  |-  ( F : A -onto-> B  ->  ran  F  =  B )
75, 6syl 14 . . . . 5  |-  ( ph  ->  ran  F  =  B )
82, 7sseqtrid 3152 . . . 4  |-  ( ph  ->  ( F " b
)  C_  B )
9 f1opw2.3 . . . . 5  |-  ( ph  ->  ( F " b
)  e.  _V )
10 elpwg 3523 . . . . 5  |-  ( ( F " b )  e.  _V  ->  (
( F " b
)  e.  ~P B  <->  ( F " b ) 
C_  B ) )
119, 10syl 14 . . . 4  |-  ( ph  ->  ( ( F "
b )  e.  ~P B 
<->  ( F " b
)  C_  B )
)
128, 11mpbird 166 . . 3  |-  ( ph  ->  ( F " b
)  e.  ~P B
)
1312adantr 274 . 2  |-  ( (
ph  /\  b  e.  ~P A )  ->  ( F " b )  e. 
~P B )
14 imassrn 4900 . . . . 5  |-  ( `' F " a ) 
C_  ran  `' F
15 dfdm4 4739 . . . . . 6  |-  dom  F  =  ran  `' F
16 f1odm 5379 . . . . . . 7  |-  ( F : A -1-1-onto-> B  ->  dom  F  =  A )
173, 16syl 14 . . . . . 6  |-  ( ph  ->  dom  F  =  A )
1815, 17syl5eqr 2187 . . . . 5  |-  ( ph  ->  ran  `' F  =  A )
1914, 18sseqtrid 3152 . . . 4  |-  ( ph  ->  ( `' F "
a )  C_  A
)
20 f1opw2.2 . . . . 5  |-  ( ph  ->  ( `' F "
a )  e.  _V )
21 elpwg 3523 . . . . 5  |-  ( ( `' F " a )  e.  _V  ->  (
( `' F "
a )  e.  ~P A 
<->  ( `' F "
a )  C_  A
) )
2220, 21syl 14 . . . 4  |-  ( ph  ->  ( ( `' F " a )  e.  ~P A 
<->  ( `' F "
a )  C_  A
) )
2319, 22mpbird 166 . . 3  |-  ( ph  ->  ( `' F "
a )  e.  ~P A )
2423adantr 274 . 2  |-  ( (
ph  /\  a  e.  ~P B )  ->  ( `' F " a )  e.  ~P A )
25 elpwi 3524 . . . . . . 7  |-  ( a  e.  ~P B  -> 
a  C_  B )
2625adantl 275 . . . . . 6  |-  ( ( b  e.  ~P A  /\  a  e.  ~P B )  ->  a  C_  B )
27 foimacnv 5393 . . . . . 6  |-  ( ( F : A -onto-> B  /\  a  C_  B )  ->  ( F "
( `' F "
a ) )  =  a )
285, 26, 27syl2an 287 . . . . 5  |-  ( (
ph  /\  ( b  e.  ~P A  /\  a  e.  ~P B ) )  ->  ( F "
( `' F "
a ) )  =  a )
2928eqcomd 2146 . . . 4  |-  ( (
ph  /\  ( b  e.  ~P A  /\  a  e.  ~P B ) )  ->  a  =  ( F " ( `' F " a ) ) )
30 imaeq2 4885 . . . . 5  |-  ( b  =  ( `' F " a )  ->  ( F " b )  =  ( F " ( `' F " a ) ) )
3130eqeq2d 2152 . . . 4  |-  ( b  =  ( `' F " a )  ->  (
a  =  ( F
" b )  <->  a  =  ( F " ( `' F " a ) ) ) )
3229, 31syl5ibrcom 156 . . 3  |-  ( (
ph  /\  ( b  e.  ~P A  /\  a  e.  ~P B ) )  ->  ( b  =  ( `' F "
a )  ->  a  =  ( F "
b ) ) )
33 f1of1 5374 . . . . . . 7  |-  ( F : A -1-1-onto-> B  ->  F : A -1-1-> B )
343, 33syl 14 . . . . . 6  |-  ( ph  ->  F : A -1-1-> B
)
35 elpwi 3524 . . . . . . 7  |-  ( b  e.  ~P A  -> 
b  C_  A )
3635adantr 274 . . . . . 6  |-  ( ( b  e.  ~P A  /\  a  e.  ~P B )  ->  b  C_  A )
37 f1imacnv 5392 . . . . . 6  |-  ( ( F : A -1-1-> B  /\  b  C_  A )  ->  ( `' F " ( F " b
) )  =  b )
3834, 36, 37syl2an 287 . . . . 5  |-  ( (
ph  /\  ( b  e.  ~P A  /\  a  e.  ~P B ) )  ->  ( `' F " ( F " b
) )  =  b )
3938eqcomd 2146 . . . 4  |-  ( (
ph  /\  ( b  e.  ~P A  /\  a  e.  ~P B ) )  ->  b  =  ( `' F " ( F
" b ) ) )
40 imaeq2 4885 . . . . 5  |-  ( a  =  ( F "
b )  ->  ( `' F " a )  =  ( `' F " ( F " b
) ) )
4140eqeq2d 2152 . . . 4  |-  ( a  =  ( F "
b )  ->  (
b  =  ( `' F " a )  <-> 
b  =  ( `' F " ( F
" b ) ) ) )
4239, 41syl5ibrcom 156 . . 3  |-  ( (
ph  /\  ( b  e.  ~P A  /\  a  e.  ~P B ) )  ->  ( a  =  ( F " b
)  ->  b  =  ( `' F " a ) ) )
4332, 42impbid 128 . 2  |-  ( (
ph  /\  ( b  e.  ~P A  /\  a  e.  ~P B ) )  ->  ( b  =  ( `' F "
a )  <->  a  =  ( F " b ) ) )
441, 13, 24, 43f1o2d 5983 1  |-  ( ph  ->  ( b  e.  ~P A  |->  ( F "
b ) ) : ~P A -1-1-onto-> ~P B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1332    e. wcel 1481   _Vcvv 2689    C_ wss 3076   ~Pcpw 3515    |-> cmpt 3997   `'ccnv 4546   dom cdm 4547   ran crn 4548   "cima 4550   -1-1->wf1 5128   -onto->wfo 5129   -1-1-onto->wf1o 5130
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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138
This theorem is referenced by:  f1opw  5985
  Copyright terms: Public domain W3C validator