| 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 3463 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | sucexb 7759 | . 2 ⊢ (𝐴 ∈ V ↔ suc 𝐴 ∈ V) | |
| 3 | 1, 2 | sylib 218 | 1 ⊢ (𝐴 ∈ 𝑉 → suc 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2114 Vcvv 3442 suc csuc 6327 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-un 3908 df-in 3910 df-ss 3920 df-sn 4583 df-pr 4585 df-uni 4866 df-suc 6331 |
| This theorem is referenced by: sucex 7761 onsuc 7765 cofon1 8610 cofon2 8611 hsmexlem1 10348 fineqvnttrclse 35302 dfon2lem3 35999 dmsucmap 38719 sucmapsuc 38740 inaex 44653 |
| Copyright terms: Public domain | W3C validator |