Metamath Proof Explorer


Theorem xrlttr

Description: Ordering on the extended reals is transitive. (Contributed by NM, 15-Oct-2005)

Ref Expression
Assertion xrlttr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * → A < B ∧ B < C → A < C

Proof

Step Hyp Ref Expression
1 elxr ⊢ A ∈ ℝ * ↔ A ∈ ℝ ∨ A = +∞ ∨ A = −∞
2 elxr ⊢ C ∈ ℝ * ↔ C ∈ ℝ ∨ C = +∞ ∨ C = −∞
3 elxr ⊢ B ∈ ℝ * ↔ B ∈ ℝ ∨ B = +∞ ∨ B = −∞
4 lttr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ → A < B ∧ B < C → A < C
5 4 3expa ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ → A < B ∧ B < C → A < C
6 5 an32s ⊢ A ∈ ℝ ∧ C ∈ ℝ ∧ B ∈ ℝ → A < B ∧ B < C → A < C
7 rexr ⊢ C ∈ ℝ → C ∈ ℝ *
8 pnfnlt ⊢ C ∈ ℝ * → ¬ +∞ < C
9 7 8 syl ⊢ C ∈ ℝ → ¬ +∞ < C
10 9 adantr ⊢ C ∈ ℝ ∧ B = +∞ → ¬ +∞ < C
11 breq1 ⊢ B = +∞ → B < C ↔ +∞ < C
12 11 adantl ⊢ C ∈ ℝ ∧ B = +∞ → B < C ↔ +∞ < C
13 10 12 mtbird ⊢ C ∈ ℝ ∧ B = +∞ → ¬ B < C
14 13 pm2.21d ⊢ C ∈ ℝ ∧ B = +∞ → B < C → A < C
15 14 adantll ⊢ A ∈ ℝ ∧ C ∈ ℝ ∧ B = +∞ → B < C → A < C
16 15 adantld ⊢ A ∈ ℝ ∧ C ∈ ℝ ∧ B = +∞ → A < B ∧ B < C → A < C
17 rexr ⊢ A ∈ ℝ → A ∈ ℝ *
18 nltmnf ⊢ A ∈ ℝ * → ¬ A < −∞
19 17 18 syl ⊢ A ∈ ℝ → ¬ A < −∞
20 19 adantr ⊢ A ∈ ℝ ∧ B = −∞ → ¬ A < −∞
21 breq2 ⊢ B = −∞ → A < B ↔ A < −∞
22 21 adantl ⊢ A ∈ ℝ ∧ B = −∞ → A < B ↔ A < −∞
23 20 22 mtbird ⊢ A ∈ ℝ ∧ B = −∞ → ¬ A < B
24 23 pm2.21d ⊢ A ∈ ℝ ∧ B = −∞ → A < B → A < C
25 24 adantlr ⊢ A ∈ ℝ ∧ C ∈ ℝ ∧ B = −∞ → A < B → A < C
26 25 adantrd ⊢ A ∈ ℝ ∧ C ∈ ℝ ∧ B = −∞ → A < B ∧ B < C → A < C
27 6 16 26 3jaodan ⊢ A ∈ ℝ ∧ C ∈ ℝ ∧ B ∈ ℝ ∨ B = +∞ ∨ B = −∞ → A < B ∧ B < C → A < C
28 3 27 sylan2b ⊢ A ∈ ℝ ∧ C ∈ ℝ ∧ B ∈ ℝ * → A < B ∧ B < C → A < C
29 28 an32s ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ C ∈ ℝ → A < B ∧ B < C → A < C
30 ltpnf ⊢ A ∈ ℝ → A < +∞
31 30 adantr ⊢ A ∈ ℝ ∧ C = +∞ → A < +∞
32 breq2 ⊢ C = +∞ → A < C ↔ A < +∞
33 32 adantl ⊢ A ∈ ℝ ∧ C = +∞ → A < C ↔ A < +∞
34 31 33 mpbird ⊢ A ∈ ℝ ∧ C = +∞ → A < C
35 34 adantlr ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ C = +∞ → A < C
36 35 a1d ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ C = +∞ → A < B ∧ B < C → A < C
37 nltmnf ⊢ B ∈ ℝ * → ¬ B < −∞
38 37 adantr ⊢ B ∈ ℝ * ∧ C = −∞ → ¬ B < −∞
39 breq2 ⊢ C = −∞ → B < C ↔ B < −∞
40 39 adantl ⊢ B ∈ ℝ * ∧ C = −∞ → B < C ↔ B < −∞
41 38 40 mtbird ⊢ B ∈ ℝ * ∧ C = −∞ → ¬ B < C
42 41 pm2.21d ⊢ B ∈ ℝ * ∧ C = −∞ → B < C → A < C
43 42 adantld ⊢ B ∈ ℝ * ∧ C = −∞ → A < B ∧ B < C → A < C
44 43 adantll ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ C = −∞ → A < B ∧ B < C → A < C
45 29 36 44 3jaodan ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ C ∈ ℝ ∨ C = +∞ ∨ C = −∞ → A < B ∧ B < C → A < C
46 45 anasss ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ C ∈ ℝ ∨ C = +∞ ∨ C = −∞ → A < B ∧ B < C → A < C
47 pnfnlt ⊢ B ∈ ℝ * → ¬ +∞ < B
48 47 adantl ⊢ A = +∞ ∧ B ∈ ℝ * → ¬ +∞ < B
49 breq1 ⊢ A = +∞ → A < B ↔ +∞ < B
50 49 adantr ⊢ A = +∞ ∧ B ∈ ℝ * → A < B ↔ +∞ < B
51 48 50 mtbird ⊢ A = +∞ ∧ B ∈ ℝ * → ¬ A < B
52 51 pm2.21d ⊢ A = +∞ ∧ B ∈ ℝ * → A < B → A < C
53 52 adantrd ⊢ A = +∞ ∧ B ∈ ℝ * → A < B ∧ B < C → A < C
54 53 adantrr ⊢ A = +∞ ∧ B ∈ ℝ * ∧ C ∈ ℝ ∨ C = +∞ ∨ C = −∞ → A < B ∧ B < C → A < C
55 mnflt ⊢ C ∈ ℝ → −∞ < C
56 55 adantl ⊢ A = −∞ ∧ C ∈ ℝ → −∞ < C
57 breq1 ⊢ A = −∞ → A < C ↔ −∞ < C
58 57 adantr ⊢ A = −∞ ∧ C ∈ ℝ → A < C ↔ −∞ < C
59 56 58 mpbird ⊢ A = −∞ ∧ C ∈ ℝ → A < C
60 59 a1d ⊢ A = −∞ ∧ C ∈ ℝ → A < B ∧ B < C → A < C
61 60 adantlr ⊢ A = −∞ ∧ B ∈ ℝ * ∧ C ∈ ℝ → A < B ∧ B < C → A < C
62 mnfltpnf ⊢ −∞ < +∞
63 breq12 ⊢ A = −∞ ∧ C = +∞ → A < C ↔ −∞ < +∞
64 62 63 mpbiri ⊢ A = −∞ ∧ C = +∞ → A < C
65 64 a1d ⊢ A = −∞ ∧ C = +∞ → A < B ∧ B < C → A < C
66 65 adantlr ⊢ A = −∞ ∧ B ∈ ℝ * ∧ C = +∞ → A < B ∧ B < C → A < C
67 43 adantll ⊢ A = −∞ ∧ B ∈ ℝ * ∧ C = −∞ → A < B ∧ B < C → A < C
68 61 66 67 3jaodan ⊢ A = −∞ ∧ B ∈ ℝ * ∧ C ∈ ℝ ∨ C = +∞ ∨ C = −∞ → A < B ∧ B < C → A < C
69 68 anasss ⊢ A = −∞ ∧ B ∈ ℝ * ∧ C ∈ ℝ ∨ C = +∞ ∨ C = −∞ → A < B ∧ B < C → A < C
70 46 54 69 3jaoian ⊢ A ∈ ℝ ∨ A = +∞ ∨ A = −∞ ∧ B ∈ ℝ * ∧ C ∈ ℝ ∨ C = +∞ ∨ C = −∞ → A < B ∧ B < C → A < C
71 70 3impb ⊢ A ∈ ℝ ∨ A = +∞ ∨ A = −∞ ∧ B ∈ ℝ * ∧ C ∈ ℝ ∨ C = +∞ ∨ C = −∞ → A < B ∧ B < C → A < C
72 2 71 syl3an3b ⊢ A ∈ ℝ ∨ A = +∞ ∨ A = −∞ ∧ B ∈ ℝ * ∧ C ∈ ℝ * → A < B ∧ B < C → A < C
73 1 72 syl3an1b ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * → A < B ∧ B < C → A < C