![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > snexALT | Structured version Visualization version GIF version |
Description: Alternate proof of snex 5430 using Power Set (ax-pow 5362) instead of Pairing (ax-pr 5426). Unlike in the proof of zfpair 5418, Replacement (ax-rep 5284) is not needed. (Contributed by NM, 7-Aug-1994.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
snexALT | ⊢ {𝐴} ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | snsspw 4844 | . . 3 ⊢ {𝐴} ⊆ 𝒫 𝐴 | |
2 | ssexg 5322 | . . 3 ⊢ (({𝐴} ⊆ 𝒫 𝐴 ∧ 𝒫 𝐴 ∈ V) → {𝐴} ∈ V) | |
3 | 1, 2 | mpan 686 | . 2 ⊢ (𝒫 𝐴 ∈ V → {𝐴} ∈ V) |
4 | pwexg 5375 | . . . 4 ⊢ (𝐴 ∈ V → 𝒫 𝐴 ∈ V) | |
5 | 4 | con3i 154 | . . 3 ⊢ (¬ 𝒫 𝐴 ∈ V → ¬ 𝐴 ∈ V) |
6 | snprc 4720 | . . . . 5 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅) | |
7 | 6 | biimpi 215 | . . . 4 ⊢ (¬ 𝐴 ∈ V → {𝐴} = ∅) |
8 | 0ex 5306 | . . . 4 ⊢ ∅ ∈ V | |
9 | 7, 8 | eqeltrdi 2839 | . . 3 ⊢ (¬ 𝐴 ∈ V → {𝐴} ∈ V) |
10 | 5, 9 | syl 17 | . 2 ⊢ (¬ 𝒫 𝐴 ∈ V → {𝐴} ∈ V) |
11 | 3, 10 | pm2.61i 182 | 1 ⊢ {𝐴} ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1539 ∈ wcel 2104 Vcvv 3472 ⊆ wss 3947 ∅c0 4321 𝒫 cpw 4601 {csn 4627 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pow 5362 |
This theorem depends on definitions: df-bi 206 df-an 395 df-tru 1542 df-fal 1552 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2722 df-clel 2808 df-rab 3431 df-v 3474 df-dif 3950 df-in 3954 df-ss 3964 df-nul 4322 df-pw 4603 df-sn 4628 |
This theorem is referenced by: p0exALT 5382 |
Copyright terms: Public domain | W3C validator |