| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: The successor of a set is a set. |
| Ref | Expression |
|---|---|
| sucex.1 |
|
| Ref | Expression |
|---|---|
| sucex |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sucex.1 |
. 2
| |
| 2 | sucexg 3891 |
. 2
| |
| 3 | 1, 2 | ax-mp 7 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: orduninsuc 3925 onzslOLD 3929 tfindsg 3944 tfindes 3946 tfinds2 3947 finds 3979 findsg 3980 finds2 3981 findes 3983 oasuc 5208 phplem4 5605 php 5607 unifi 5648 inf0 5712 inf3lem1 5719 dfom3 5737 infensuc 5745 r1pwcl 5798 rankval4 5813 omsublim 5887 nnacda 6088 indpi 6186 cardfz 7719 dif1enOLD 10173 indexfi 10174 bnj986 13360 bnj1018 13378 dfon2lem7 13855 finsschain 15373 omsublimOLD 15396 fcluscomplem 15620 indexfiOLD 15755 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-9 1307 ax-10 1308 ax-11 1309 ax-12 1310 ax-13 1311 ax-14 1312 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-16 1580 ax-11o 1588 ax-ext 1865 ax-sep 3438 ax-nul 3445 ax-pow 3481 ax-pr 3524 ax-un 3790 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-ex 1327 df-sb 1536 df-clab 1872 df-cleq 1877 df-clel 1880 df-ne 2019 df-rex 2110 df-v 2294 df-dif 2597 df-un 2600 df-in 2603 df-ss 2605 df-nul 2876 df-pw 3035 df-sn 3049 df-pr 3050 df-uni 3178 df-suc 3663 |