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

Theorem f1opw2 7660
Description: A one-to-one mapping induces a one-to-one mapping on power sets. This version of f1opw 7661 avoids the Axiom of Replacement. (Contributed by Mario Carneiro, 26-Jun-2015.)
Hypotheses
Ref Expression
f1opw2.1 (𝜑𝐹:𝐴1-1-onto𝐵)
f1opw2.2 (𝜑 → (𝐹𝑎) ∈ V)
f1opw2.3 (𝜑 → (𝐹𝑏) ∈ V)
Assertion
Ref Expression
f1opw2 (𝜑 → (𝑏 ∈ 𝒫 𝐴 ↦ (𝐹𝑏)):𝒫 𝐴1-1-onto→𝒫 𝐵)
Distinct variable groups:   𝑎,𝑏,𝐴   𝐵,𝑎,𝑏   𝐹,𝑎,𝑏   𝜑,𝑎,𝑏

Proof of Theorem f1opw2
StepHypRef Expression
1 eqid 2732 . 2 (𝑏 ∈ 𝒫 𝐴 ↦ (𝐹𝑏)) = (𝑏 ∈ 𝒫 𝐴 ↦ (𝐹𝑏))
2 f1opw2.3 . . . 4 (𝜑 → (𝐹𝑏) ∈ V)
3 imassrn 6070 . . . . 5 (𝐹𝑏) ⊆ ran 𝐹
4 f1opw2.1 . . . . . . 7 (𝜑𝐹:𝐴1-1-onto𝐵)
5 f1ofo 6840 . . . . . . 7 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴onto𝐵)
64, 5syl 17 . . . . . 6 (𝜑𝐹:𝐴onto𝐵)
7 forn 6808 . . . . . 6 (𝐹:𝐴onto𝐵 → ran 𝐹 = 𝐵)
86, 7syl 17 . . . . 5 (𝜑 → ran 𝐹 = 𝐵)
93, 8sseqtrid 4034 . . . 4 (𝜑 → (𝐹𝑏) ⊆ 𝐵)
102, 9elpwd 4608 . . 3 (𝜑 → (𝐹𝑏) ∈ 𝒫 𝐵)
1110adantr 481 . 2 ((𝜑𝑏 ∈ 𝒫 𝐴) → (𝐹𝑏) ∈ 𝒫 𝐵)
12 f1opw2.2 . . . 4 (𝜑 → (𝐹𝑎) ∈ V)
13 imassrn 6070 . . . . 5 (𝐹𝑎) ⊆ ran 𝐹
14 dfdm4 5895 . . . . . 6 dom 𝐹 = ran 𝐹
15 f1odm 6837 . . . . . . 7 (𝐹:𝐴1-1-onto𝐵 → dom 𝐹 = 𝐴)
164, 15syl 17 . . . . . 6 (𝜑 → dom 𝐹 = 𝐴)
1714, 16eqtr3id 2786 . . . . 5 (𝜑 → ran 𝐹 = 𝐴)
1813, 17sseqtrid 4034 . . . 4 (𝜑 → (𝐹𝑎) ⊆ 𝐴)
1912, 18elpwd 4608 . . 3 (𝜑 → (𝐹𝑎) ∈ 𝒫 𝐴)
2019adantr 481 . 2 ((𝜑𝑎 ∈ 𝒫 𝐵) → (𝐹𝑎) ∈ 𝒫 𝐴)
21 elpwi 4609 . . . . . . 7 (𝑎 ∈ 𝒫 𝐵𝑎𝐵)
2221adantl 482 . . . . . 6 ((𝑏 ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐵) → 𝑎𝐵)
23 foimacnv 6850 . . . . . 6 ((𝐹:𝐴onto𝐵𝑎𝐵) → (𝐹 “ (𝐹𝑎)) = 𝑎)
246, 22, 23syl2an 596 . . . . 5 ((𝜑 ∧ (𝑏 ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐵)) → (𝐹 “ (𝐹𝑎)) = 𝑎)
2524eqcomd 2738 . . . 4 ((𝜑 ∧ (𝑏 ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐵)) → 𝑎 = (𝐹 “ (𝐹𝑎)))
26 imaeq2 6055 . . . . 5 (𝑏 = (𝐹𝑎) → (𝐹𝑏) = (𝐹 “ (𝐹𝑎)))
2726eqeq2d 2743 . . . 4 (𝑏 = (𝐹𝑎) → (𝑎 = (𝐹𝑏) ↔ 𝑎 = (𝐹 “ (𝐹𝑎))))
2825, 27syl5ibrcom 246 . . 3 ((𝜑 ∧ (𝑏 ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐵)) → (𝑏 = (𝐹𝑎) → 𝑎 = (𝐹𝑏)))
29 f1of1 6832 . . . . . . 7 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴1-1𝐵)
304, 29syl 17 . . . . . 6 (𝜑𝐹:𝐴1-1𝐵)
31 elpwi 4609 . . . . . . 7 (𝑏 ∈ 𝒫 𝐴𝑏𝐴)
3231adantr 481 . . . . . 6 ((𝑏 ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐵) → 𝑏𝐴)
33 f1imacnv 6849 . . . . . 6 ((𝐹:𝐴1-1𝐵𝑏𝐴) → (𝐹 “ (𝐹𝑏)) = 𝑏)
3430, 32, 33syl2an 596 . . . . 5 ((𝜑 ∧ (𝑏 ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐵)) → (𝐹 “ (𝐹𝑏)) = 𝑏)
3534eqcomd 2738 . . . 4 ((𝜑 ∧ (𝑏 ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐵)) → 𝑏 = (𝐹 “ (𝐹𝑏)))
36 imaeq2 6055 . . . . 5 (𝑎 = (𝐹𝑏) → (𝐹𝑎) = (𝐹 “ (𝐹𝑏)))
3736eqeq2d 2743 . . . 4 (𝑎 = (𝐹𝑏) → (𝑏 = (𝐹𝑎) ↔ 𝑏 = (𝐹 “ (𝐹𝑏))))
3835, 37syl5ibrcom 246 . . 3 ((𝜑 ∧ (𝑏 ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐵)) → (𝑎 = (𝐹𝑏) → 𝑏 = (𝐹𝑎)))
3928, 38impbid 211 . 2 ((𝜑 ∧ (𝑏 ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐵)) → (𝑏 = (𝐹𝑎) ↔ 𝑎 = (𝐹𝑏)))
401, 11, 20, 39f1o2d 7659 1 (𝜑 → (𝑏 ∈ 𝒫 𝐴 ↦ (𝐹𝑏)):𝒫 𝐴1-1-onto→𝒫 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106  Vcvv 3474  wss 3948  𝒫 cpw 4602  cmpt 5231  ccnv 5675  dom cdm 5676  ran crn 5677  cima 5679  1-1wf1 6540  ontowfo 6541  1-1-ontowf1o 6542
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550
This theorem is referenced by:  f1opw  7661
  Copyright terms: Public domain W3C validator