Theorem lelttr 8311

Description: Transitive law. Part of Definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 23-May-1999.)

Assertion

Ref	Expression
lelttr	|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A <_ B /\ B < C ) -> A < C ) )

Proof of Theorem lelttr

Step	Hyp	Ref	Expression
1		simprl 531	. . . . 5 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> A <_ B )
2		simpl1 1027	. . . . . 6 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> A e. RR )
3		simpl2 1028	. . . . . 6 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> B e. RR )
4		lenlt 8298	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> ( A <_ B <-> -. B < A ) )
5	2, 3, 4	syl2anc 411	. . . . 5 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> ( A <_ B <-> -. B < A ) )
6	1, 5	mpbid 147	. . . 4 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> -. B < A )
7	6	pm2.21d 624	. . 3 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> ( B < A -> A < C ) )
8		idd 21	. . 3 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> ( A < C -> A < C ) )
9		simprr 533	. . . 4 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> B < C )
10		simpl3 1029	. . . . 5 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> C e. RR )
11		axltwlin 8290	. . . . 5 |- ( ( B e. RR /\ C e. RR /\ A e. RR ) -> ( B < C -> ( B < A \/ A < C ) ) )
12	3, 10, 2, 11	syl3anc 1274	. . . 4 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> ( B < C -> ( B < A \/ A < C ) ) )
13	9, 12	mpd 13	. . 3 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> ( B < A \/ A < C ) )
14	7, 8, 13	mpjaod 726	. 2 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ B /\ B < C ) ) -> A < C )
15	14	ex 115	1 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A <_ B /\ B < C ) -> A < C ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 716   /\ w3a 1005   e. wcel 2202   class class class wbr 4093   RRcr 8074   < clt 8257   <_ cle 8258

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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-pre-ltwlin 8188

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-xp 4737  df-cnv 4739  df-pnf 8259  df-mnf 8260  df-xr 8261  df-ltxr 8262  df-le 8263

This theorem is referenced by:  lelttri  8328  lelttrd  8347  letrp1  9071  ltmul12a  9083  bndndx  9444  uzind  9634  fnn0ind  9639  nn0p1elfzo  10465  elfzo0z  10467  fzofzim  10471  elfzodifsumelfzo  10490  flqge  10586  modfzo0difsn  10701  expnlbnd2  10971  ccat2s1fvwd  11271  swrdswrd  11333  pfxccatin12lem3  11360  caubnd2  11738  mulcn2  11933  cn1lem  11935  climsqz  11956  climsqz2  11957  climcvg1nlem  11970  ltoddhalfle  12515  algcvgblem  12682  pclemub  12921  metss2lem  15288  logdivlti  15672  gausslemma2dlem2  15861