Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordgt0ge1 | Structured version Visualization version GIF version |
Description: Two ways to express that an ordinal class is positive. (Contributed by NM, 21-Dec-2004.) |
Ref | Expression |
---|---|
ordgt0ge1 | ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 1𝑜 ⊆ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0elon 5695 | . . 3 ⊢ ∅ ∈ On | |
2 | ordelsuc 6912 | . . 3 ⊢ ((∅ ∈ On ∧ Ord 𝐴) → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴)) | |
3 | 1, 2 | mpan 702 | . 2 ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴)) |
4 | df-1o 7447 | . . 3 ⊢ 1𝑜 = suc ∅ | |
5 | 4 | sseq1i 3592 | . 2 ⊢ (1𝑜 ⊆ 𝐴 ↔ suc ∅ ⊆ 𝐴) |
6 | 3, 5 | syl6bbr 277 | 1 ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 1𝑜 ⊆ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∈ wcel 1977 ⊆ wss 3540 ∅c0 3874 Ord word 5639 Oncon0 5640 suc csuc 5642 1𝑜c1o 7440 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-tr 4681 df-eprel 4949 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-ord 5643 df-on 5644 df-suc 5646 df-1o 7447 |
This theorem is referenced by: ordge1n0 7465 oe0m1 7488 omword1 7540 omword2 7541 omlimcl 7545 oen0 7553 oewordi 7558 |
Copyright terms: Public domain | W3C validator |