![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > pw2f1o | Structured version Visualization version GIF version |
Description: The power set of a set is equinumerous to set exponentiation with an unordered pair base of ordinal 2. Generalized from Proposition 10.44 of [TakeutiZaring] p. 96. (Contributed by Mario Carneiro, 6-Oct-2014.) |
Ref | Expression |
---|---|
pw2f1o.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
pw2f1o.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
pw2f1o.3 | ⊢ (𝜑 → 𝐶 ∈ 𝑊) |
pw2f1o.4 | ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
pw2f1o.5 | ⊢ 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵))) |
Ref | Expression |
---|---|
pw2f1o | ⊢ (𝜑 → 𝐹:𝒫 𝐴–1-1-onto→({𝐵, 𝐶} ↑m 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pw2f1o.5 | . 2 ⊢ 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵))) | |
2 | eqid 2798 | . . . 4 ⊢ (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) = (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) | |
3 | pw2f1o.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
4 | pw2f1o.2 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
5 | pw2f1o.3 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
6 | pw2f1o.4 | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ 𝐶) | |
7 | 3, 4, 5, 6 | pw2f1olem 8604 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝒫 𝐴 ∧ (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) = (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵))) ↔ ((𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) ∈ ({𝐵, 𝐶} ↑m 𝐴) ∧ 𝑥 = (◡(𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) “ {𝐶})))) |
8 | 7 | biimpa 480 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 𝐴 ∧ (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) = (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)))) → ((𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) ∈ ({𝐵, 𝐶} ↑m 𝐴) ∧ 𝑥 = (◡(𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) “ {𝐶}))) |
9 | 2, 8 | mpanr2 703 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 𝐴) → ((𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) ∈ ({𝐵, 𝐶} ↑m 𝐴) ∧ 𝑥 = (◡(𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) “ {𝐶}))) |
10 | 9 | simpld 498 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 𝐴) → (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵)) ∈ ({𝐵, 𝐶} ↑m 𝐴)) |
11 | vex 3444 | . . . . 5 ⊢ 𝑦 ∈ V | |
12 | 11 | cnvex 7612 | . . . 4 ⊢ ◡𝑦 ∈ V |
13 | 12 | imaex 7603 | . . 3 ⊢ (◡𝑦 “ {𝐶}) ∈ V |
14 | 13 | a1i 11 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ ({𝐵, 𝐶} ↑m 𝐴)) → (◡𝑦 “ {𝐶}) ∈ V) |
15 | 3, 4, 5, 6 | pw2f1olem 8604 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝑧 ∈ 𝐴 ↦ if(𝑧 ∈ 𝑥, 𝐶, 𝐵))) ↔ (𝑦 ∈ ({𝐵, 𝐶} ↑m 𝐴) ∧ 𝑥 = (◡𝑦 “ {𝐶})))) |
16 | 1, 10, 14, 15 | f1od 7377 | 1 ⊢ (𝜑 → 𝐹:𝒫 𝐴–1-1-onto→({𝐵, 𝐶} ↑m 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 Vcvv 3441 ifcif 4425 𝒫 cpw 4497 {csn 4525 {cpr 4527 ↦ cmpt 5110 ◡ccnv 5518 “ cima 5522 –1-1-onto→wf1o 6323 (class class class)co 7135 ↑m cmap 8389 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-map 8391 |
This theorem is referenced by: pw2eng 8606 indf1o 31393 |
Copyright terms: Public domain | W3C validator |