| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ord0 | Structured version Visualization version GIF version | ||
| Description: The empty set is an ordinal class. Remark 1.5 of [Schloeder] p. 1. (Contributed by NM, 11-May-1994.) |
| Ref | Expression |
|---|---|
| ord0 | ⊢ Ord ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tr0 5225 | . 2 ⊢ Tr ∅ | |
| 2 | we0 5650 | . 2 ⊢ E We ∅ | |
| 3 | df-ord 6360 | . 2 ⊢ (Ord ∅ ↔ (Tr ∅ ∧ E We ∅)) | |
| 4 | 1, 2, 3 | mpbir2an 724 | 1 ⊢ Ord ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∅c0 4279 Tr wtr 5212 E cep 5554 We wwe 5607 Ord word 6356 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-tr 5213 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-ord 6360 |
| This theorem is used by: 0elon 6413 ord0eln0 6414 ordzsl 7842 smo0 8348 oicl 9502 alephgeom 10086 bdaypw2n0bndlem 28729 |
| Copyright terms: Public domain | W3C validator |