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

Theorem fopwdom 6380
Description: Covering implies injection on power sets. (Contributed by Stefan O'Rear, 6-Nov-2014.) (Revised by Mario Carneiro, 24-Jun-2015.)
Assertion
Ref Expression
fopwdom  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ~P B  ~<_  ~P A )

Proof of Theorem fopwdom
Dummy variables  a  b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 imassrn 4709 . . . . . 6  |-  ( `' F " a ) 
C_  ran  `' F
2 dfdm4 4555 . . . . . . 7  |-  dom  F  =  ran  `' F
3 fof 5137 . . . . . . . 8  |-  ( F : A -onto-> B  ->  F : A --> B )
4 fdm 5081 . . . . . . . 8  |-  ( F : A --> B  ->  dom  F  =  A )
53, 4syl 14 . . . . . . 7  |-  ( F : A -onto-> B  ->  dom  F  =  A )
62, 5syl5eqr 2128 . . . . . 6  |-  ( F : A -onto-> B  ->  ran  `' F  =  A
)
71, 6syl5sseq 3048 . . . . 5  |-  ( F : A -onto-> B  -> 
( `' F "
a )  C_  A
)
87adantl 271 . . . 4  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ( `' F " a )  C_  A
)
9 cnvexg 4885 . . . . . 6  |-  ( F  e.  _V  ->  `' F  e.  _V )
109adantr 270 . . . . 5  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  `' F  e. 
_V )
11 imaexg 4710 . . . . 5  |-  ( `' F  e.  _V  ->  ( `' F " a )  e.  _V )
12 elpwg 3398 . . . . 5  |-  ( ( `' F " a )  e.  _V  ->  (
( `' F "
a )  e.  ~P A 
<->  ( `' F "
a )  C_  A
) )
1310, 11, 123syl 17 . . . 4  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ( ( `' F " a )  e.  ~P A  <->  ( `' F " a )  C_  A ) )
148, 13mpbird 165 . . 3  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ( `' F " a )  e.  ~P A )
1514a1d 22 . 2  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ( a  e. 
~P B  ->  ( `' F " a )  e.  ~P A ) )
16 imaeq2 4694 . . . . . . 7  |-  ( ( `' F " a )  =  ( `' F " b )  ->  ( F " ( `' F " a ) )  =  ( F " ( `' F " b ) ) )
1716adantl 271 . . . . . 6  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  -> 
( F " ( `' F " a ) )  =  ( F
" ( `' F " b ) ) )
18 simpllr 501 . . . . . . 7  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  ->  F : A -onto-> B )
19 simplrl 502 . . . . . . . 8  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  -> 
a  e.  ~P B
)
2019elpwid 3400 . . . . . . 7  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  -> 
a  C_  B )
21 foimacnv 5175 . . . . . . 7  |-  ( ( F : A -onto-> B  /\  a  C_  B )  ->  ( F "
( `' F "
a ) )  =  a )
2218, 20, 21syl2anc 403 . . . . . 6  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  -> 
( F " ( `' F " a ) )  =  a )
23 simplrr 503 . . . . . . . 8  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  -> 
b  e.  ~P B
)
2423elpwid 3400 . . . . . . 7  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  -> 
b  C_  B )
25 foimacnv 5175 . . . . . . 7  |-  ( ( F : A -onto-> B  /\  b  C_  B )  ->  ( F "
( `' F "
b ) )  =  b )
2618, 24, 25syl2anc 403 . . . . . 6  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  -> 
( F " ( `' F " b ) )  =  b )
2717, 22, 263eqtr3d 2122 . . . . 5  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  -> 
a  =  b )
2827ex 113 . . . 4  |-  ( ( ( F  e.  _V  /\  F : A -onto-> B
)  /\  ( a  e.  ~P B  /\  b  e.  ~P B ) )  ->  ( ( `' F " a )  =  ( `' F " b )  ->  a  =  b ) )
29 imaeq2 4694 . . . 4  |-  ( a  =  b  ->  ( `' F " a )  =  ( `' F " b ) )
3028, 29impbid1 140 . . 3  |-  ( ( ( F  e.  _V  /\  F : A -onto-> B
)  /\  ( a  e.  ~P B  /\  b  e.  ~P B ) )  ->  ( ( `' F " a )  =  ( `' F " b )  <->  a  =  b ) )
3130ex 113 . 2  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ( ( a  e.  ~P B  /\  b  e.  ~P B
)  ->  ( ( `' F " a )  =  ( `' F " b )  <->  a  =  b ) ) )
32 rnexg 4625 . . . . 5  |-  ( F  e.  _V  ->  ran  F  e.  _V )
33 forn 5140 . . . . . 6  |-  ( F : A -onto-> B  ->  ran  F  =  B )
3433eleq1d 2148 . . . . 5  |-  ( F : A -onto-> B  -> 
( ran  F  e.  _V 
<->  B  e.  _V )
)
3532, 34syl5ibcom 153 . . . 4  |-  ( F  e.  _V  ->  ( F : A -onto-> B  ->  B  e.  _V )
)
3635imp 122 . . 3  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  B  e.  _V )
37 pwexg 3962 . . 3  |-  ( B  e.  _V  ->  ~P B  e.  _V )
3836, 37syl 14 . 2  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ~P B  e. 
_V )
39 dmfex 5110 . . . 4  |-  ( ( F  e.  _V  /\  F : A --> B )  ->  A  e.  _V )
403, 39sylan2 280 . . 3  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  A  e.  _V )
41 pwexg 3962 . . 3  |-  ( A  e.  _V  ->  ~P A  e.  _V )
4240, 41syl 14 . 2  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ~P A  e. 
_V )
4315, 31, 38, 42dom3d 6321 1  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ~P B  ~<_  ~P A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1285    e. wcel 1434   _Vcvv 2602    C_ wss 2974   ~Pcpw 3390   class class class wbr 3793   `'ccnv 4370   dom cdm 4371   ran crn 4372   "cima 4374   -->wf 4928   -onto->wfo 4930    ~<_ cdom 6286
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-sep 3904  ax-pow 3956  ax-pr 3972  ax-un 4196
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1687  df-eu 1945  df-mo 1946  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ral 2354  df-rex 2355  df-rab 2358  df-v 2604  df-sbc 2817  df-csb 2910  df-un 2978  df-in 2980  df-ss 2987  df-pw 3392  df-sn 3412  df-pr 3413  df-op 3415  df-uni 3610  df-br 3794  df-opab 3848  df-mpt 3849  df-id 4056  df-xp 4377  df-rel 4378  df-cnv 4379  df-co 4380  df-dm 4381  df-rn 4382  df-res 4383  df-ima 4384  df-iota 4897  df-fun 4934  df-fn 4935  df-f 4936  df-f1 4937  df-fo 4938  df-fv 4940  df-dom 6289
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator