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

Theorem fopwdom 6310
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 4679 . . . . . 6  |-  ( `' F " a ) 
C_  ran  `' F
2 dfdm4 4527 . . . . . . 7  |-  dom  F  =  ran  `' F
3 fof 5106 . . . . . . . 8  |-  ( F : A -onto-> B  ->  F : A --> B )
4 fdm 5050 . . . . . . . 8  |-  ( F : A --> B  ->  dom  F  =  A )
53, 4syl 14 . . . . . . 7  |-  ( F : A -onto-> B  ->  dom  F  =  A )
62, 5syl5eqr 2086 . . . . . 6  |-  ( F : A -onto-> B  ->  ran  `' F  =  A
)
71, 6syl5sseq 2993 . . . . 5  |-  ( F : A -onto-> B  -> 
( `' F "
a )  C_  A
)
87adantl 262 . . . 4  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ( `' F " a )  C_  A
)
9 cnvexg 4855 . . . . . 6  |-  ( F  e.  _V  ->  `' F  e.  _V )
109adantr 261 . . . . 5  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  `' F  e. 
_V )
11 imaexg 4680 . . . . 5  |-  ( `' F  e.  _V  ->  ( `' F " a )  e.  _V )
12 elpwg 3367 . . . . 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 156 . . 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 4664 . . . . . . 7  |-  ( ( `' F " a )  =  ( `' F " b )  ->  ( F " ( `' F " a ) )  =  ( F " ( `' F " b ) ) )
1716adantl 262 . . . . . 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 486 . . . . . . 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 487 . . . . . . . 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 3369 . . . . . . 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 5144 . . . . . . 7  |-  ( ( F : A -onto-> B  /\  a  C_  B )  ->  ( F "
( `' F "
a ) )  =  a )
2218, 20, 21syl2anc 391 . . . . . 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 488 . . . . . . . 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 3369 . . . . . . 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 5144 . . . . . . 7  |-  ( ( F : A -onto-> B  /\  b  C_  B )  ->  ( F "
( `' F "
b ) )  =  b )
2618, 24, 25syl2anc 391 . . . . . 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 2080 . . . . 5  |-  ( ( ( ( F  e. 
_V  /\  F : A -onto-> B )  /\  (
a  e.  ~P B  /\  b  e.  ~P B ) )  /\  ( `' F " a )  =  ( `' F " b ) )  -> 
a  =  b )
2827ex 108 . . . 4  |-  ( ( ( F  e.  _V  /\  F : A -onto-> B
)  /\  ( a  e.  ~P B  /\  b  e.  ~P B ) )  ->  ( ( `' F " a )  =  ( `' F " b )  ->  a  =  b ) )
29 imaeq2 4664 . . . 4  |-  ( a  =  b  ->  ( `' F " a )  =  ( `' F " b ) )
3028, 29impbid1 130 . . 3  |-  ( ( ( F  e.  _V  /\  F : A -onto-> B
)  /\  ( a  e.  ~P B  /\  b  e.  ~P B ) )  ->  ( ( `' F " a )  =  ( `' F " b )  <->  a  =  b ) )
3130ex 108 . 2  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ( ( a  e.  ~P B  /\  b  e.  ~P B
)  ->  ( ( `' F " a )  =  ( `' F " b )  <->  a  =  b ) ) )
32 rnexg 4597 . . . . 5  |-  ( F  e.  _V  ->  ran  F  e.  _V )
33 forn 5109 . . . . . 6  |-  ( F : A -onto-> B  ->  ran  F  =  B )
3433eleq1d 2106 . . . . 5  |-  ( F : A -onto-> B  -> 
( ran  F  e.  _V 
<->  B  e.  _V )
)
3532, 34syl5ibcom 144 . . . 4  |-  ( F  e.  _V  ->  ( F : A -onto-> B  ->  B  e.  _V )
)
3635imp 115 . . 3  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  B  e.  _V )
37 pwexg 3933 . . 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 5079 . . . 4  |-  ( ( F  e.  _V  /\  F : A --> B )  ->  A  e.  _V )
403, 39sylan2 270 . . 3  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  A  e.  _V )
41 pwexg 3933 . . 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 6254 1  |-  ( ( F  e.  _V  /\  F : A -onto-> B )  ->  ~P B  ~<_  ~P A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98    = wceq 1243    e. wcel 1393   _Vcvv 2557    C_ wss 2917   ~Pcpw 3359   class class class wbr 3764   `'ccnv 4344   dom cdm 4345   ran crn 4346   "cima 4348   -->wf 4898   -onto->wfo 4900    ~<_ cdom 6220
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-fv 4910  df-dom 6223
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator