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 8657 | . . 3 ⊢ ¬ 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴 | |
2 | elssuni 4871 | . . . 4 ⊢ (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴) | |
3 | ssdomg 8558 | . . . . 5 ⊢ (∪ 𝐴 ∈ V → (𝒫 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≼ ∪ 𝐴)) | |
4 | canth2g 8674 | . . . . . 6 ⊢ (∪ 𝐴 ∈ V → ∪ 𝐴 ≺ 𝒫 ∪ 𝐴) | |
5 | pwexb 7491 | . . . . . . 7 ⊢ (∪ 𝐴 ∈ V ↔ 𝒫 ∪ 𝐴 ∈ V) | |
6 | canth2g 8674 | . . . . . . 7 ⊢ (𝒫 ∪ 𝐴 ∈ V → 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) | |
7 | 5, 6 | sylbi 219 | . . . . . 6 ⊢ (∪ 𝐴 ∈ V → 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) |
8 | sdomtr 8658 | . . . . . 6 ⊢ ((∪ 𝐴 ≺ 𝒫 ∪ 𝐴 ∧ 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) → ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) | |
9 | 4, 7, 8 | syl2anc 586 | . . . . 5 ⊢ (∪ 𝐴 ∈ V → ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) |
10 | domsdomtr 8655 | . . . . . 6 ⊢ ((𝒫 𝒫 ∪ 𝐴 ≼ ∪ 𝐴 ∧ ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴) | |
11 | 10 | ex 415 | . . . . 5 ⊢ (𝒫 𝒫 ∪ 𝐴 ≼ ∪ 𝐴 → (∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴)) |
12 | 3, 9, 11 | syl6ci 71 | . . . 4 ⊢ (∪ 𝐴 ∈ V → (𝒫 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴)) |
13 | 2, 12 | syl5 34 | . . 3 ⊢ (∪ 𝐴 ∈ V → (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ≺ 𝒫 𝒫 ∪ 𝐴)) |
14 | 1, 13 | mtoi 201 | . 2 ⊢ (∪ 𝐴 ∈ V → ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴) |
15 | elex 3515 | . . . 4 ⊢ (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 𝒫 ∪ 𝐴 ∈ V) | |
16 | pwexb 7491 | . . . . 5 ⊢ (𝒫 ∪ 𝐴 ∈ V ↔ 𝒫 𝒫 ∪ 𝐴 ∈ V) | |
17 | 5, 16 | bitri 277 | . . . 4 ⊢ (∪ 𝐴 ∈ V ↔ 𝒫 𝒫 ∪ 𝐴 ∈ V) |
18 | 15, 17 | sylibr 236 | . . 3 ⊢ (𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 ∈ V) |
19 | 18 | con3i 157 | . 2 ⊢ (¬ ∪ 𝐴 ∈ V → ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴) |
20 | 14, 19 | pm2.61i 184 | 1 ⊢ ¬ 𝒫 𝒫 ∪ 𝐴 ∈ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∈ wcel 2113 Vcvv 3497 ⊆ wss 3939 𝒫 cpw 4542 ∪ cuni 4841 class class class wbr 5069 ≼ cdom 8510 ≺ csdm 8511 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 |
This theorem is referenced by: mnfnre 10687 |
Copyright terms: Public domain | W3C validator |