Theorem ontr1 4367

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

Step	Hyp	Ref	Expression
1		eloni 4353	. 2 |- ( C e. On -> Ord C )
2		ordtr1 4366	. 2 |- ( Ord C -> ( ( A e. B /\ B e. C ) -> A e. C ) )
3	1, 2	syl 14	1 |- ( C e. On -> ( ( A e. B /\ B e. C ) -> A e. C ) )

Syntax hints:   -> wi 4   /\ wa 103   e. wcel 2136   Ord word 4340   Oncon0 4341

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 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-in 3122  df-ss 3129  df-uni 3790  df-tr 4081  df-iord 4344  df-on 4346

This theorem is referenced by:  smoiun  6269  nntr2  6471  onunsnss  6882  snon0  6901  exmidontriimlem2  7178  ltsopi  7261  prarloclemarch2  7360  pwle2  13888