Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0elsuc | Structured version Visualization version GIF version |
Description: The successor of an ordinal class contains the empty set. (Contributed by NM, 4-Apr-1995.) |
Ref | Expression |
---|---|
0elsuc | ⊢ (Ord 𝐴 → ∅ ∈ suc 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ordsuc 7523 | . 2 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
2 | nsuceq0 6265 | . . 3 ⊢ suc 𝐴 ≠ ∅ | |
3 | ord0eln0 6239 | . . 3 ⊢ (Ord suc 𝐴 → (∅ ∈ suc 𝐴 ↔ suc 𝐴 ≠ ∅)) | |
4 | 2, 3 | mpbiri 260 | . 2 ⊢ (Ord suc 𝐴 → ∅ ∈ suc 𝐴) |
5 | 1, 4 | sylbi 219 | 1 ⊢ (Ord 𝐴 → ∅ ∈ suc 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2110 ≠ wne 3016 ∅c0 4290 Ord word 6184 suc csuc 6187 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-tr 5165 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-ord 6188 df-on 6189 df-suc 6191 |
This theorem is referenced by: oesuclem 8144 axdc3lem2 9867 axdc3lem4 9869 |
Copyright terms: Public domain | W3C validator |