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

Theorem ontr1 4374
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 4360 . 2  |-  ( C  e.  On  ->  Ord  C )
2 ordtr1 4373 . 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 103    e. wcel 2141   Ord word 4347   Oncon0 4348
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-in 3127  df-ss 3134  df-uni 3797  df-tr 4088  df-iord 4351  df-on 4353
This theorem is referenced by:  smoiun  6280  nntr2  6482  onunsnss  6894  snon0  6913  exmidontriimlem2  7199  ltsopi  7282  prarloclemarch2  7381  pwle2  14031
  Copyright terms: Public domain W3C validator