MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordgt0ge1 Structured version   Visualization version   GIF version

Theorem ordgt0ge1 8501
Description: Two ways to express that an ordinal class is positive. (Contributed by NM, 21-Dec-2004.)
Assertion
Ref Expression
ordgt0ge1 (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 1o ⊆ 𝐴))

Proof of Theorem ordgt0ge1
StepHypRef Expression
1 0elon 6418 . . 3 ∅ ∈ On
2 ordelsuc 7831 . . 3 ((∅ ∈ On ∧ Ord 𝐴) → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴))
31, 2mpan 703 . 2 (Ord 𝐴 → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴))
4 df-1o 8476 . . 3 1o = suc ∅
54sseq1i 3936 . 2 (1o ⊆ 𝐴 ↔ suc ∅ ⊆ 𝐴)
63, 5bitr4di 292 1 (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 1o ⊆ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∈ wcel 2144   ⊆ wss 3895  ∅c0 4278  Ord word 6361  Oncon0 6362  suc csuc 6364  1oc1o 8469
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-ord 6365  df-on 6366  df-suc 6368  df-1o 8476
This theorem is used by:  ordge1n0  8502  oe0m1  8529  omword1  8581  omword2  8582  omlimcl  8586  oen0  8595  oewordi  8600  oe0rif  44287
  Copyright terms: Public domain W3C validator