| 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 6371 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴 ∈ On ↔ Ord 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∈ wcel 2149 Vcvv 3463 Ord word 6362 Oncon0 6363 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-v 3465 df-ss 3930 df-uni 4877 df-tr 5223 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-ord 6366 df-on 6367 |
| This theorem is referenced by: tron 6386 0elon 6419 smogt 8356 dfrecs3 8361 rdglim2 8421 omeulem1 8569 naddcllem 8664 isfinite2 9260 r0weon 9998 cflim3 10248 inar1 10762 addsproplem7 28136 ellimits 36335 dford3lem2 43683 |
| Copyright terms: Public domain | W3C validator |