![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > pwuninel2 | Structured version Visualization version GIF version |
Description: Proof of pwuninel 8299 under the assumption that the union of the given class is a set, avoiding ax-pr 5438 and ax-un 7754. (Contributed by Stefan O'Rear, 22-Feb-2015.) |
Ref | Expression |
---|---|
pwuninel2 | ⊢ (∪ 𝐴 ∈ 𝑉 → ¬ 𝒫 ∪ 𝐴 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pwnss 5358 | . 2 ⊢ (∪ 𝐴 ∈ 𝑉 → ¬ 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴) | |
2 | elssuni 4942 | . 2 ⊢ (𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴) | |
3 | 1, 2 | nsyl 140 | 1 ⊢ (∪ 𝐴 ∈ 𝑉 → ¬ 𝒫 ∪ 𝐴 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2106 ⊆ wss 3963 𝒫 cpw 4605 ∪ cuni 4912 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 |
This theorem depends on definitions: df-bi 207 df-an 396 df-3an 1088 df-tru 1540 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-rab 3434 df-v 3480 df-in 3970 df-ss 3980 df-pw 4607 df-uni 4913 |
This theorem is referenced by: pwuninel 8299 |
Copyright terms: Public domain | W3C validator |