| 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 3450 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | sucexb 7758 | . 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 3429 suc csuc 6325 |
| 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 2708 ax-sep 5231 ax-pr 5375 ax-un 7689 |
| 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 2715 df-cleq 2728 df-clel 2811 df-rab 3390 df-v 3431 df-un 3894 df-in 3896 df-ss 3906 df-sn 4568 df-pr 4570 df-uni 4851 df-suc 6329 |
| This theorem is referenced by: sucex 7760 onsuc 7764 cofon1 8608 cofon2 8609 hsmexlem1 10348 fineqvnttrclse 35268 dfon2lem3 35965 dmsucmap 38789 sucmapsuc 38810 inaex 44724 |
| Copyright terms: Public domain | W3C validator |