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

Theorem ontr1 5688
Description: Transitive law for ordinal numbers. Theorem 7M(b) of [Enderton] p. 192. (Contributed by NM, 11-Aug-1994.)
Assertion
Ref Expression
ontr1 (𝐶 ∈ On → ((𝐴𝐵𝐵𝐶) → 𝐴𝐶))

Proof of Theorem ontr1
StepHypRef Expression
1 eloni 5650 . 2 (𝐶 ∈ On → Ord 𝐶)
2 ordtr1 5684 . 2 (Ord 𝐶 → ((𝐴𝐵𝐵𝐶) → 𝐴𝐶))
31, 2syl 17 1 (𝐶 ∈ On → ((𝐴𝐵𝐵𝐶) → 𝐴𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  wcel 1977  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-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-v 3175  df-in 3547  df-ss 3554  df-uni 4373  df-tr 4681  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-ord 5643  df-on 5644
This theorem is referenced by:  smoiun  7345  dif20el  7472  oeordi  7554  omabs  7614  omsmolem  7620  cofsmo  8974  cfsmolem  8975  inar1  9476  grur1a  9520
  Copyright terms: Public domain W3C validator