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

Theorem ontr1 4410
Description: Transitive law for ordinal numbers. Theorem 7M(b) of [Enderton] p. 192. (Contributed by NM, 11-Aug-1994.)
Assertion
Ref Expression
ontr1  |-  ( C  e.  On  ->  (
( A  e.  B  /\  B  e.  C
)  ->  A  e.  C ) )

Proof of Theorem ontr1
StepHypRef Expression
1 eloni 4374 . 2  |-  ( C  e.  On  ->  Ord  C )
2 ordtr1 4407 . 2  |-  ( Ord 
C  ->  ( ( A  e.  B  /\  B  e.  C )  ->  A  e.  C ) )
31, 2syl 17 1  |-  ( C  e.  On  ->  (
( A  e.  B  /\  B  e.  C
)  ->  A  e.  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 6    /\ wa 360    e. wcel 1621   Ord word 4363   Oncon0 4364
This theorem is referenced by:  smoiun  6346  dif20el  6472  oeordi  6553  omabs  6613  omsmolem  6619  cofsmo  7863  cfsmolem  7864  inar1  8365  grur1a  8409
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2239
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-clab 2245  df-cleq 2251  df-clel 2254  df-nfc 2383  df-ral 2523  df-rex 2524  df-v 2765  df-in 3134  df-ss 3141  df-uni 3802  df-tr 4088  df-po 4286  df-so 4287  df-fr 4324  df-we 4326  df-ord 4367  df-on 4368
  Copyright terms: Public domain W3C validator