| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pwuninel2 | Structured version Visualization version GIF version | ||
| Description: Proof of pwuninel 8250 under the assumption that the union of the given class is a set, avoiding ax-pr 5389 and ax-un 7714. (Contributed by Stefan O'Rear, 22-Feb-2015.) |
| Ref | Expression |
|---|---|
| pwuninel2 | ⊢ (∪ 𝐴 ∈ 𝑉 → ¬ 𝒫 ∪ 𝐴 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pwnss 5307 | . 2 ⊢ (∪ 𝐴 ∈ 𝑉 → ¬ 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴) | |
| 2 | elssuni 4896 | . 2 ⊢ (𝒫 ∪ 𝐴 ∈ 𝐴 → 𝒫 ∪ 𝐴 ⊆ ∪ 𝐴) | |
| 3 | 1, 2 | nsyl 140 | 1 ⊢ (∪ 𝐴 ∈ 𝑉 → ¬ 𝒫 ∪ 𝐴 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2141 ⊆ wss 3904 𝒫 cpw 4554 ∪ cuni 4864 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5245 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-3an 1099 df-tru 1562 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3455 df-in 3911 df-ss 3921 df-pw 4556 df-uni 4865 |
| This theorem is referenced by: pwuninelOLD 8251 |
| Copyright terms: Public domain | W3C validator |