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

Theorem ordgt0ge1 8539
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 6444 . . 3 ∅ ∈ On
2 ordelsuc 7865 . . 3 ((∅ ∈ On ∧ Ord 𝐴) → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴))
31, 2mpan 703 . 2 (Ord 𝐴 → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴))
4 df-1o 8514 . . 3 1o = suc ∅
54sseq1i 3941 . 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 2147   ⊆ wss 3900  ∅c0 4281  Ord word 6387  Oncon0 6388  suc csuc 6390  1oc1o 8507
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6391  df-on 6392  df-suc 6394  df-1o 8514
This theorem is used by:  ordge1n0  8540  oe0m1  8567  omword1  8619  omword2  8620  omlimcl  8624  oen0  8633  oewordi  8638  oe0rif  44609
  Copyright terms: Public domain W3C validator