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

Theorem ontr2 5689
 Description: Transitive law for ordinal numbers. Exercise 3 of [TakeutiZaring] p. 40. (Contributed by NM, 6-Nov-2003.)
Assertion
Ref Expression
ontr2 ((𝐴 ∈ On ∧ 𝐶 ∈ On) → ((𝐴𝐵𝐵𝐶) → 𝐴𝐶))

Proof of Theorem ontr2
StepHypRef Expression
1 eloni 5650 . 2 (𝐴 ∈ On → Ord 𝐴)
2 eloni 5650 . 2 (𝐶 ∈ On → Ord 𝐶)
3 ordtr2 5685 . 2 ((Ord 𝐴 ∧ Ord 𝐶) → ((𝐴𝐵𝐵𝐶) → 𝐴𝐶))
41, 2, 3syl2an 493 1 ((𝐴 ∈ On ∧ 𝐶 ∈ On) → ((𝐴𝐵𝐵𝐶) → 𝐴𝐶))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   ∈ wcel 1977   ⊆ wss 3540  Ord word 5639  Oncon0 5640 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-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 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-sn 4126  df-pr 4128  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 This theorem is referenced by:  oeordsuc  7561  oelimcl  7567  oeeui  7569  omopthlem2  7623  omxpenlem  7946  oismo  8328  cantnflem1c  8467  cantnflem1  8469  cantnflem3  8471  rankr1ai  8544  rankxplim  8625  infxpenlem  8719  alephle  8794  pwcfsdom  9284  r1limwun  9437  nobndlem6  31096  ontopbas  31597  ontgval  31600
 Copyright terms: Public domain W3C validator