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

Theorem fopwdom 6333
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 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → 𝒫 𝐵 ≼ 𝒫 𝐴)

Proof of Theorem fopwdom
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 imassrn 4699 . . . . . 6 (𝐹𝑎) ⊆ ran 𝐹
2 dfdm4 4545 . . . . . . 7 dom 𝐹 = ran 𝐹
3 fof 5126 . . . . . . . 8 (𝐹:𝐴onto𝐵𝐹:𝐴𝐵)
4 fdm 5070 . . . . . . . 8 (𝐹:𝐴𝐵 → dom 𝐹 = 𝐴)
53, 4syl 14 . . . . . . 7 (𝐹:𝐴onto𝐵 → dom 𝐹 = 𝐴)
62, 5syl5eqr 2127 . . . . . 6 (𝐹:𝐴onto𝐵 → ran 𝐹 = 𝐴)
71, 6syl5sseq 3047 . . . . 5 (𝐹:𝐴onto𝐵 → (𝐹𝑎) ⊆ 𝐴)
87adantl 271 . . . 4 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → (𝐹𝑎) ⊆ 𝐴)
9 cnvexg 4875 . . . . . 6 (𝐹 ∈ V → 𝐹 ∈ V)
109adantr 270 . . . . 5 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → 𝐹 ∈ V)
11 imaexg 4700 . . . . 5 (𝐹 ∈ V → (𝐹𝑎) ∈ V)
12 elpwg 3390 . . . . 5 ((𝐹𝑎) ∈ V → ((𝐹𝑎) ∈ 𝒫 𝐴 ↔ (𝐹𝑎) ⊆ 𝐴))
1310, 11, 123syl 17 . . . 4 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → ((𝐹𝑎) ∈ 𝒫 𝐴 ↔ (𝐹𝑎) ⊆ 𝐴))
148, 13mpbird 165 . . 3 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → (𝐹𝑎) ∈ 𝒫 𝐴)
1514a1d 22 . 2 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → (𝑎 ∈ 𝒫 𝐵 → (𝐹𝑎) ∈ 𝒫 𝐴))
16 imaeq2 4684 . . . . . . 7 ((𝐹𝑎) = (𝐹𝑏) → (𝐹 “ (𝐹𝑎)) = (𝐹 “ (𝐹𝑏)))
1716adantl 271 . . . . . 6 ((((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) ∧ (𝐹𝑎) = (𝐹𝑏)) → (𝐹 “ (𝐹𝑎)) = (𝐹 “ (𝐹𝑏)))
18 simpllr 500 . . . . . . 7 ((((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) ∧ (𝐹𝑎) = (𝐹𝑏)) → 𝐹:𝐴onto𝐵)
19 simplrl 501 . . . . . . . 8 ((((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) ∧ (𝐹𝑎) = (𝐹𝑏)) → 𝑎 ∈ 𝒫 𝐵)
2019elpwid 3392 . . . . . . 7 ((((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) ∧ (𝐹𝑎) = (𝐹𝑏)) → 𝑎𝐵)
21 foimacnv 5164 . . . . . . 7 ((𝐹:𝐴onto𝐵𝑎𝐵) → (𝐹 “ (𝐹𝑎)) = 𝑎)
2218, 20, 21syl2anc 403 . . . . . 6 ((((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) ∧ (𝐹𝑎) = (𝐹𝑏)) → (𝐹 “ (𝐹𝑎)) = 𝑎)
23 simplrr 502 . . . . . . . 8 ((((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) ∧ (𝐹𝑎) = (𝐹𝑏)) → 𝑏 ∈ 𝒫 𝐵)
2423elpwid 3392 . . . . . . 7 ((((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) ∧ (𝐹𝑎) = (𝐹𝑏)) → 𝑏𝐵)
25 foimacnv 5164 . . . . . . 7 ((𝐹:𝐴onto𝐵𝑏𝐵) → (𝐹 “ (𝐹𝑏)) = 𝑏)
2618, 24, 25syl2anc 403 . . . . . 6 ((((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) ∧ (𝐹𝑎) = (𝐹𝑏)) → (𝐹 “ (𝐹𝑏)) = 𝑏)
2717, 22, 263eqtr3d 2121 . . . . 5 ((((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) ∧ (𝐹𝑎) = (𝐹𝑏)) → 𝑎 = 𝑏)
2827ex 113 . . . 4 (((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) → ((𝐹𝑎) = (𝐹𝑏) → 𝑎 = 𝑏))
29 imaeq2 4684 . . . 4 (𝑎 = 𝑏 → (𝐹𝑎) = (𝐹𝑏))
3028, 29impbid1 140 . . 3 (((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) ∧ (𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵)) → ((𝐹𝑎) = (𝐹𝑏) ↔ 𝑎 = 𝑏))
3130ex 113 . 2 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → ((𝑎 ∈ 𝒫 𝐵𝑏 ∈ 𝒫 𝐵) → ((𝐹𝑎) = (𝐹𝑏) ↔ 𝑎 = 𝑏)))
32 rnexg 4615 . . . . 5 (𝐹 ∈ V → ran 𝐹 ∈ V)
33 forn 5129 . . . . . 6 (𝐹:𝐴onto𝐵 → ran 𝐹 = 𝐵)
3433eleq1d 2147 . . . . 5 (𝐹:𝐴onto𝐵 → (ran 𝐹 ∈ V ↔ 𝐵 ∈ V))
3532, 34syl5ibcom 153 . . . 4 (𝐹 ∈ V → (𝐹:𝐴onto𝐵𝐵 ∈ V))
3635imp 122 . . 3 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → 𝐵 ∈ V)
37 pwexg 3954 . . 3 (𝐵 ∈ V → 𝒫 𝐵 ∈ V)
3836, 37syl 14 . 2 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → 𝒫 𝐵 ∈ V)
39 dmfex 5099 . . . 4 ((𝐹 ∈ V ∧ 𝐹:𝐴𝐵) → 𝐴 ∈ V)
403, 39sylan2 280 . . 3 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → 𝐴 ∈ V)
41 pwexg 3954 . . 3 (𝐴 ∈ V → 𝒫 𝐴 ∈ V)
4240, 41syl 14 . 2 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → 𝒫 𝐴 ∈ V)
4315, 31, 38, 42dom3d 6277 1 ((𝐹 ∈ V ∧ 𝐹:𝐴onto𝐵) → 𝒫 𝐵 ≼ 𝒫 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1284  wcel 1433  Vcvv 2601  wss 2973  𝒫 cpw 3382   class class class wbr 3785  ccnv 4362  dom cdm 4363  ran crn 4364  cima 4366  wf 4918  ontowfo 4920  cdom 6243
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 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-fv 4930  df-dom 6246
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator