Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2pwuninel | Structured version Visualization version GIF version |
Description: The power set of the power set of the union of a set does not belong to the set. This theorem provides a way of constructing a new set that doesn't belong to a given set. (Contributed by NM, 27-Jun-2008.) |
Ref | Expression |
---|---|
2pwuninel | ⊢ ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sdomirr 8901 | . . 3 ⊢ ¬ 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴 | |
2 | elssuni 4871 | . . . 4 ⊢ (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴) | |
3 | ssdomg 8786 | . . . . 5 ⊢ (∪ 𝐴 ∈ V → (𝒫 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≼ ∪ 𝐴)) | |
4 | canth2g 8918 | . . . . . 6 ⊢ (∪ 𝐴 ∈ V → ∪ 𝐴 ≺ 𝒫 ∪ 𝐴) | |
5 | pwexb 7616 | . . . . . . 7 ⊢ (∪ 𝐴 ∈ V ↔ 𝒫 ∪ 𝐴 ∈ V) | |
6 | canth2g 8918 | . . . . . . 7 ⊢ (𝒫 ∪ 𝐴 ∈ V → 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) | |
7 | 5, 6 | sylbi 216 | . . . . . 6 ⊢ (∪ 𝐴 ∈ V → 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) |
8 | sdomtr 8902 | . . . . . 6 ⊢ ((∪ 𝐴 ≺ 𝒫 ∪ 𝐴 ∧ 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) → ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) | |
9 | 4, 7, 8 | syl2anc 584 | . . . . 5 ⊢ (∪ 𝐴 ∈ V → ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) |
10 | domsdomtr 8899 | . . . . . 6 ⊢ ((𝒫 𝒫 ∪ 𝐴 ≼ ∪ 𝐴 ∧ ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) | |
11 | 10 | ex 413 | . . . . 5 ⊢ (𝒫 𝒫 ∪ 𝐴 ≼ ∪ 𝐴 → (∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴)) |
12 | 3, 9, 11 | syl6ci 71 | . . . 4 ⊢ (∪ 𝐴 ∈ V → (𝒫 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴)) |
13 | 2, 12 | syl5 34 | . . 3 ⊢ (∪ 𝐴 ∈ V → (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴)) |
14 | 1, 13 | mtoi 198 | . 2 ⊢ (∪ 𝐴 ∈ V → ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴) |
15 | elex 3450 | . . . 4 ⊢ (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ∈ V) | |
16 | pwexb 7616 | . . . . 5 ⊢ (𝒫 ∪ 𝐴 ∈ V ↔ 𝒫 𝒫 ∪ 𝐴 ∈ V) | |
17 | 5, 16 | bitri 274 | . . . 4 ⊢ (∪ 𝐴 ∈ V ↔ 𝒫 𝒫 ∪ 𝐴 ∈ V) |
18 | 15, 17 | sylibr 233 | . . 3 ⊢ (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 ∈ V) |
19 | 18 | con3i 154 | . 2 ⊢ (¬ ∪ 𝐴 ∈ V → ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴) |
20 | 14, 19 | pm2.61i 182 | 1 ⊢ ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∈ wcel 2106 Vcvv 3432 ⊆ wss 3887 𝒫 cpw 4533 ∪ cuni 4839 class class class wbr 5074 ≼ cdom 8731 ≺ csdm 8732 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 |
This theorem is referenced by: mnfnre 11018 |
Copyright terms: Public domain | W3C validator |