| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elon | Structured version Visualization version GIF version | ||
| Description: An ordinal number is an ordinal set. (Contributed by NM, 5-Jun-1994.) |
| Ref | Expression |
|---|---|
| elon.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| elon | ⊢ (𝐴 ∈ On ↔ Ord 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elon.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | elong 6331 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴 ∈ On ↔ Ord 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2114 Vcvv 3429 Ord word 6322 Oncon0 6323 |
| 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 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-v 3431 df-ss 3906 df-uni 4851 df-tr 5193 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-ord 6326 df-on 6327 |
| This theorem is referenced by: tron 6346 0elon 6378 smogt 8307 dfrecs3 8312 rdglim2 8371 omeulem1 8517 naddcllem 8612 isfinite2 9208 r0weon 9934 cflim3 10184 inar1 10698 addsproplem7 27967 ellimits 36090 dford3lem2 43455 |
| Copyright terms: Public domain | W3C validator |