Theorem xrlttrd 10005

Description: Transitive law for ordering on extended reals. (Contributed by Mario Carneiro, 23-Aug-2015.)

Hypotheses

Ref	Expression
xrlttrd.1	|- ( ph -> A e. RR* )
xrlttrd.2	|- ( ph -> B e. RR* )
xrlttrd.3	|- ( ph -> C e. RR* )
xrlttrd.4	|- ( ph -> A < B )
xrlttrd.5	|- ( ph -> B < C )

Assertion

Ref	Expression
xrlttrd	|- ( ph -> A < C )

Proof of Theorem xrlttrd

Step	Hyp	Ref	Expression
1		xrlttrd.4	. 2 |- ( ph -> A < B )
2		xrlttrd.5	. 2 |- ( ph -> B < C )
3		xrlttrd.1	. . 3 |- ( ph -> A e. RR* )
4		xrlttrd.2	. . 3 |- ( ph -> B e. RR* )
5		xrlttrd.3	. . 3 |- ( ph -> C e. RR* )
6		xrlttr 9991	. . 3 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( ( A < B /\ B < C ) -> A < C ) )
7	3, 4, 5, 6	syl3anc 1271	. 2 |- ( ph -> ( ( A < B /\ B < C ) -> A < C ) )
8	1, 2, 7	mp2and 433	1 |- ( ph -> A < C )

Syntax hints:   -> wi 4   /\ wa 104   e. wcel 2200   class class class wbr 4083   RR*cxr 8180   < clt 8181

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-pre-lttrn 8113

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-xp 4725  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186

This theorem is referenced by:  xlt2add  10076  ioom  10480