| 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 𝐴 → (∅ ∈ 𝐴 ↔ 1o ⊆ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0elon 6380 | . . 3 ⊢ ∅ ∈ On | |
| 2 | ordelsuc 7772 | . . 3 ⊢ ((∅ ∈ On ∧ Ord 𝐴) → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴)) | |
| 3 | 1, 2 | mpan 691 | . 2 ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴)) |
| 4 | df-1o 8407 | . . 3 ⊢ 1o = suc ∅ | |
| 5 | 4 | sseq1i 3964 | . 2 ⊢ (1o ⊆ 𝐴 ↔ suc ∅ ⊆ 𝐴) |
| 6 | 3, 5 | bitr4di 289 | 1 ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 1o ⊆ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2114 ⊆ wss 3903 ∅c0 4287 Ord word 6324 Oncon0 6325 suc csuc 6327 1oc1o 8400 |
| 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 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-tr 5208 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-ord 6328 df-on 6329 df-suc 6331 df-1o 8407 |
| This theorem is referenced by: ordge1n0 8431 oe0m1 8458 omword1 8510 omword2 8511 omlimcl 8515 oen0 8524 oewordi 8529 oe0rif 43646 |
| Copyright terms: Public domain | W3C validator |