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 7982 | . . 3 ⊢ ¬ 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴 | |
2 | elssuni 4403 | . . . 4 ⊢ (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴) | |
3 | ssdomg 7887 | . . . . 5 ⊢ (∪ 𝐴 ∈ V → (𝒫 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≼ ∪ 𝐴)) | |
4 | canth2g 7999 | . . . . . 6 ⊢ (∪ 𝐴 ∈ V → ∪ 𝐴 ≺ 𝒫 ∪ 𝐴) | |
5 | pwexb 6867 | . . . . . . 7 ⊢ (∪ 𝐴 ∈ V ↔ 𝒫 ∪ 𝐴 ∈ V) | |
6 | canth2g 7999 | . . . . . . 7 ⊢ (𝒫 ∪ 𝐴 ∈ V → 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) | |
7 | 5, 6 | sylbi 206 | . . . . . 6 ⊢ (∪ 𝐴 ∈ V → 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) |
8 | sdomtr 7983 | . . . . . 6 ⊢ ((∪ 𝐴 ≺ 𝒫 ∪ 𝐴 ∧ 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) → ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) | |
9 | 4, 7, 8 | syl2anc 691 | . . . . 5 ⊢ (∪ 𝐴 ∈ V → ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) |
10 | domsdomtr 7980 | . . . . . 6 ⊢ ((𝒫 𝒫 ∪ 𝐴 ≼ ∪ 𝐴 ∧ ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) | |
11 | 10 | ex 449 | . . . . 5 ⊢ (𝒫 𝒫 ∪ 𝐴 ≼ ∪ 𝐴 → (∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴)) |
12 | 3, 9, 11 | syl6ci 69 | . . . 4 ⊢ (∪ 𝐴 ∈ V → (𝒫 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴)) |
13 | 2, 12 | syl5 33 | . . 3 ⊢ (∪ 𝐴 ∈ V → (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴)) |
14 | 1, 13 | mtoi 189 | . 2 ⊢ (∪ 𝐴 ∈ V → ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴) |
15 | elex 3185 | . . . 4 ⊢ (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ∈ V) | |
16 | pwexb 6867 | . . . . 5 ⊢ (𝒫 ∪ 𝐴 ∈ V ↔ 𝒫 𝒫 ∪ 𝐴 ∈ V) | |
17 | 5, 16 | bitri 263 | . . . 4 ⊢ (∪ 𝐴 ∈ V ↔ 𝒫 𝒫 ∪ 𝐴 ∈ V) |
18 | 15, 17 | sylibr 223 | . . 3 ⊢ (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 ∈ V) |
19 | 18 | con3i 149 | . 2 ⊢ (¬ ∪ 𝐴 ∈ V → ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴) |
20 | 14, 19 | pm2.61i 175 | 1 ⊢ ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∈ wcel 1977 Vcvv 3173 ⊆ wss 3540 𝒫 cpw 4108 ∪ cuni 4372 class class class wbr 4583 ≼ cdom 7839 ≺ csdm 7840 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 |
This theorem is referenced by: mnfnre 9961 |
Copyright terms: Public domain | W3C validator |