MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fopwdom Structured version   Visualization version   GIF version

Theorem fopwdom 9112
Description: Covering implies injection on power sets. (Contributed by Stefan O'Rear, 6-Nov-2014.) (Revised by Mario Carneiro, 24-Jun-2015.) (Revised by AV, 18-Sep-2021.)
Assertion
Ref Expression
fopwdom ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐵 ≼ 𝒫 𝐴)

Proof of Theorem fopwdom
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 imassrn 6200 . . . . . 6 (◡𝐹 “ 𝑎) ⊆ ran ◡𝐹
2 dfdm4 5878 . . . . . . 7 dom 𝐹 = ran ◡𝐹
3 fof 6801 . . . . . . . 8 (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵)
43fdmd 6725 . . . . . . 7 (𝐹:𝐴–onto→𝐵 → dom 𝐹 = 𝐴)
52, 4eqtr3id 2809 . . . . . 6 (𝐹:𝐴–onto→𝐵 → ran ◡𝐹 = 𝐴)
61, 5sseqtrid 3951 . . . . 5 (𝐹:𝐴–onto→𝐵 → (◡𝐹 “ 𝑎) ⊆ 𝐴)
76adantl 487 . . . 4 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → (◡𝐹 “ 𝑎) ⊆ 𝐴)
8 cnvexg 7940 . . . . . 6 (𝐹 ∈ 𝑉 → ◡𝐹 ∈ V)
98adantr 486 . . . . 5 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → ◡𝐹 ∈ V)
10 imaexg 7929 . . . . 5 (◡𝐹 ∈ V → (◡𝐹 “ 𝑎) ∈ V)
11 elpwg 4559 . . . . 5 ((◡𝐹 “ 𝑎) ∈ V → ((◡𝐹 “ 𝑎) ∈ 𝒫 𝐴 ↔ (◡𝐹 “ 𝑎) ⊆ 𝐴))
129, 10, 113syl 19 . . . 4 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → ((◡𝐹 “ 𝑎) ∈ 𝒫 𝐴 ↔ (◡𝐹 “ 𝑎) ⊆ 𝐴))
137, 12mpbird 260 . . 3 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → (◡𝐹 “ 𝑎) ∈ 𝒫 𝐴)
1413a1d 26 . 2 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → (𝑎 ∈ 𝒫 𝐵 → (◡𝐹 “ 𝑎) ∈ 𝒫 𝐴))
15 imaeq2 6050 . . . . . . 7 ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) → (𝐹 “ (◡𝐹 “ 𝑎)) = (𝐹 “ (◡𝐹 “ 𝑏)))
1615adantl 487 . . . . . 6 ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → (𝐹 “ (◡𝐹 “ 𝑎)) = (𝐹 “ (◡𝐹 “ 𝑏)))
17 simpllr 788 . . . . . . 7 ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝐹:𝐴–onto→𝐵)
18 simplrl 789 . . . . . . . 8 ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑎 ∈ 𝒫 𝐵)
1918elpwid 4565 . . . . . . 7 ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑎 ⊆ 𝐵)
20 foimacnv 6847 . . . . . . 7 ((𝐹:𝐴–onto→𝐵 ∧ 𝑎 ⊆ 𝐵) → (𝐹 “ (◡𝐹 “ 𝑎)) = 𝑎)
2117, 19, 20syl2anc 596 . . . . . 6 ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → (𝐹 “ (◡𝐹 “ 𝑎)) = 𝑎)
22 simplrr 790 . . . . . . . 8 ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑏 ∈ 𝒫 𝐵)
2322elpwid 4565 . . . . . . 7 ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑏 ⊆ 𝐵)
24 foimacnv 6847 . . . . . . 7 ((𝐹:𝐴–onto→𝐵 ∧ 𝑏 ⊆ 𝐵) → (𝐹 “ (◡𝐹 “ 𝑏)) = 𝑏)
2517, 23, 24syl2anc 596 . . . . . 6 ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → (𝐹 “ (◡𝐹 “ 𝑏)) = 𝑏)
2616, 21, 253eqtr3d 2803 . . . . 5 ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑎 = 𝑏)
2726ex 418 . . . 4 (((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) → ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) → 𝑎 = 𝑏))
28 imaeq2 6050 . . . 4 (𝑎 = 𝑏 → (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏))
2927, 28impbid1 228 . . 3 (((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) → ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) ↔ 𝑎 = 𝑏))
3029ex 418 . 2 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → ((𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵) → ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) ↔ 𝑎 = 𝑏)))
31 rnexg 7918 . . . . 5 (𝐹 ∈ 𝑉 → ran 𝐹 ∈ V)
32 forn 6804 . . . . . 6 (𝐹:𝐴–onto→𝐵 → ran 𝐹 = 𝐵)
3332eleq1d 2845 . . . . 5 (𝐹:𝐴–onto→𝐵 → (ran 𝐹 ∈ V ↔ 𝐵 ∈ V))
3431, 33syl5ibcom 248 . . . 4 (𝐹 ∈ 𝑉 → (𝐹:𝐴–onto→𝐵 → 𝐵 ∈ V))
3534imp 412 . . 3 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝐵 ∈ V)
3635pwexd 5341 . 2 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐵 ∈ V)
37 dmfex 7921 . . . 4 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴⟶𝐵) → 𝐴 ∈ V)
383, 37sylan2 605 . . 3 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝐴 ∈ V)
3938pwexd 5341 . 2 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐴 ∈ V)
4014, 30, 36, 39dom3d 9029 1 ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐵 ≼ 𝒫 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3896  𝒫 cpw 4556   class class class wbr 5102  ◡ccnv 5650  dom cdm 5651  ran crn 5652   “ cima 5654  ⟶wf 6539  –onto→wfo 6541   ≼ cdom 8979
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-fv 6551  df-dom 8983
This theorem is used by:  pwdom  9156  wdompwdom  9579
  Copyright terms: Public domain W3C validator