| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sucexg | Structured version Visualization version GIF version | ||
| Description: The successor of a set is a set (generalization). (Contributed by NM, 5-Jun-1994.) |
| Ref | Expression |
|---|---|
| sucexg | ⊢ (𝐴 ∈ 𝑉 → suc 𝐴 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3472 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | sucexb 7816 | . 2 ⊢ (𝐴 ∈ V ↔ suc 𝐴 ∈ V) | |
| 3 | 1, 2 | sylib 221 | 1 ⊢ (𝐴 ∈ 𝑉 → suc 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2145 Vcvv 3451 suc csuc 6363 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-pr 5391 ax-un 7749 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3453 df-un 3904 df-in 3906 df-ss 3916 df-sn 4585 df-pr 4587 df-uni 4868 df-suc 6367 |
| This theorem is used by: sucex 7818 onsuc 7822 cofon1 8674 cofon2 8675 hsmexlem1 10497 fineqvnttrclse 35775 dfon2lem3 36527 dmsucmap 39380 sucmapsuc 39401 inaex 45266 |
| Copyright terms: Public domain | W3C validator |