| 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 5231 | . 2 ⊢ Tr ∅ | |
| 2 | we0 5653 | . 2 ⊢ E We ∅ | |
| 3 | df-ord 6391 | . 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 4281 Tr wtr 5218 E cep 5557 We wwe 5610 Ord word 6387 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-tr 5219 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-ord 6391 |
| This theorem is used by: 0elon 6444 ord0eln0 6445 ordzsl 7890 smo0 8404 oicl 9560 alephgeom 10200 bdaypw2n0bndlem 28906 |
| Copyright terms: Public domain | W3C validator |