| 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 3474 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | sucexb 7782 | . 2 ⊢ (𝐴 ∈ V ↔ suc 𝐴 ∈ V) | |
| 3 | 1, 2 | sylib 220 | 1 ⊢ (𝐴 ∈ 𝑉 → suc 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2141 Vcvv 3453 suc csuc 6343 |
| 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 5243 ax-pr 5387 ax-un 7713 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 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-un 3907 df-in 3909 df-ss 3919 df-sn 4580 df-pr 4582 df-uni 4863 df-suc 6347 |
| This theorem is referenced by: sucex 7784 onsuc 7788 cofon1 8636 cofon2 8637 hsmexlem1 10377 fineqvnttrclse 35381 dfon2lem3 36094 dmsucmap 38928 sucmapsuc 38949 inaex 44834 |
| Copyright terms: Public domain | W3C validator |