ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ontr1 Unicode version

Theorem ontr1 4437
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 4423 . 2  |-  ( C  e.  On  ->  Ord  C )
2 ordtr1 4436 . 2  |-  ( Ord 
C  ->  ( ( A  e.  B  /\  B  e.  C )  ->  A  e.  C ) )
31, 2syl 14 1  |-  ( C  e.  On  ->  (
( A  e.  B  /\  B  e.  C
)  ->  A  e.  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2176   Ord word 4410   Oncon0 4411
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-in 3172  df-ss 3179  df-uni 3851  df-tr 4144  df-iord 4414  df-on 4416
This theorem is referenced by:  smoiun  6389  nntr2  6591  onunsnss  7016  snon0  7039  exmidontriimlem2  7336  ltsopi  7435  prarloclemarch2  7534  pwle2  15972
  Copyright terms: Public domain W3C validator