| 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 3452 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | sucexb 7747 | . 2 ⊢ (𝐴 ∈ V ↔ suc 𝐴 ∈ V) | |
| 3 | 1, 2 | sylib 219 | 1 ⊢ (𝐴 ∈ 𝑉 → suc 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2119 Vcvv 3431 suc csuc 6312 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rab 3392 df-v 3433 df-un 3888 df-in 3890 df-ss 3900 df-sn 4556 df-pr 4558 df-uni 4839 df-suc 6316 |
| This theorem is referenced by: sucex 7749 onsuc 7753 cofon1 8598 cofon2 8599 hsmexlem1 10339 fineqvnttrclse 35305 dfon2lem3 36011 dmsucmap 38835 sucmapsuc 38856 inaex 44741 |
| Copyright terms: Public domain | W3C validator |