Theorem xrlttri 13099

Description: Ordering on the extended reals satisfies strict trichotomy. New proofs should generally use this instead of ax-pre-lttri 11142 or axlttri 11245. (Contributed by NM, 14-Oct-2005.)

Assertion

Ref	Expression
xrlttri	⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 < 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))

Proof of Theorem xrlttri

Step	Hyp	Ref	Expression
1		xrltnr 13079	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ* → ¬ 𝐴 < 𝐴)
2	1	adantr 480	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 𝐵) → ¬ 𝐴 < 𝐴)
3		breq2 5111	. . . . . . . 8 ⊢ (𝐴 = 𝐵 → (𝐴 < 𝐴 ↔ 𝐴 < 𝐵))
4	3	adantl 481	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 𝐵) → (𝐴 < 𝐴 ↔ 𝐴 < 𝐵))
5	2, 4	mtbid 324	. . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 𝐵) → ¬ 𝐴 < 𝐵)
6	5	ex 412	. . . . 5 ⊢ (𝐴 ∈ ℝ* → (𝐴 = 𝐵 → ¬ 𝐴 < 𝐵))
7	6	adantr 480	. . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 = 𝐵 → ¬ 𝐴 < 𝐵))
8		xrltnsym 13097	. . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐴 ∈ ℝ*) → (𝐵 < 𝐴 → ¬ 𝐴 < 𝐵))
9	8	ancoms 458	. . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐵 < 𝐴 → ¬ 𝐴 < 𝐵))
10	7, 9	jaod 859	. . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → ¬ 𝐴 < 𝐵))
11		elxr 13076	. . . 4 ⊢ (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
12		elxr 13076	. . . 4 ⊢ (𝐵 ∈ ℝ* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
13		axlttri 11245	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
14	13	biimprd 248	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (¬ (𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → 𝐴 < 𝐵))
15	14	con1d 145	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
16		ltpnf 13080	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → 𝐴 < +∞)
17	16	adantr 480	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → 𝐴 < +∞)
18		breq2 5111	. . . . . . . . 9 ⊢ (𝐵 = +∞ → (𝐴 < 𝐵 ↔ 𝐴 < +∞))
19	18	adantl 481	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 ↔ 𝐴 < +∞))
20	17, 19	mpbird 257	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → 𝐴 < 𝐵)
21	20	pm2.24d 151	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
22		mnflt 13083	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴)
23	22	adantr 480	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → -∞ < 𝐴)
24		breq1 5110	. . . . . . . . . 10 ⊢ (𝐵 = -∞ → (𝐵 < 𝐴 ↔ -∞ < 𝐴))
25	24	adantl 481	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐵 < 𝐴 ↔ -∞ < 𝐴))
26	23, 25	mpbird 257	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → 𝐵 < 𝐴)
27	26	olcd 874	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴))
28	27	a1d 25	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
29	15, 21, 28	3jaodan 1433	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
30		ltpnf 13080	. . . . . . . . . 10 ⊢ (𝐵 ∈ ℝ → 𝐵 < +∞)
31	30	adantl 481	. . . . . . . . 9 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ) → 𝐵 < +∞)
32		breq2 5111	. . . . . . . . . 10 ⊢ (𝐴 = +∞ → (𝐵 < 𝐴 ↔ 𝐵 < +∞))
33	32	adantr 480	. . . . . . . . 9 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴 ↔ 𝐵 < +∞))
34	31, 33	mpbird 257	. . . . . . . 8 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ) → 𝐵 < 𝐴)
35	34	olcd 874	. . . . . . 7 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴))
36	35	a1d 25	. . . . . 6 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
37		eqtr3 2751	. . . . . . . 8 ⊢ ((𝐴 = +∞ ∧ 𝐵 = +∞) → 𝐴 = 𝐵)
38	37	orcd 873	. . . . . . 7 ⊢ ((𝐴 = +∞ ∧ 𝐵 = +∞) → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴))
39	38	a1d 25	. . . . . 6 ⊢ ((𝐴 = +∞ ∧ 𝐵 = +∞) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
40		mnfltpnf 13086	. . . . . . . . . 10 ⊢ -∞ < +∞
41		breq12 5112	. . . . . . . . . 10 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → (𝐵 < 𝐴 ↔ -∞ < +∞))
42	40, 41	mpbiri 258	. . . . . . . . 9 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → 𝐵 < 𝐴)
43	42	ancoms 458	. . . . . . . 8 ⊢ ((𝐴 = +∞ ∧ 𝐵 = -∞) → 𝐵 < 𝐴)
44	43	olcd 874	. . . . . . 7 ⊢ ((𝐴 = +∞ ∧ 𝐵 = -∞) → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴))
45	44	a1d 25	. . . . . 6 ⊢ ((𝐴 = +∞ ∧ 𝐵 = -∞) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
46	36, 39, 45	3jaodan 1433	. . . . 5 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
47		mnflt 13083	. . . . . . . . 9 ⊢ (𝐵 ∈ ℝ → -∞ < 𝐵)
48	47	adantl 481	. . . . . . . 8 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → -∞ < 𝐵)
49		breq1 5110	. . . . . . . . 9 ⊢ (𝐴 = -∞ → (𝐴 < 𝐵 ↔ -∞ < 𝐵))
50	49	adantr 480	. . . . . . . 8 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ -∞ < 𝐵))
51	48, 50	mpbird 257	. . . . . . 7 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → 𝐴 < 𝐵)
52	51	pm2.24d 151	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
53		breq12 5112	. . . . . . . 8 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 ↔ -∞ < +∞))
54	40, 53	mpbiri 258	. . . . . . 7 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → 𝐴 < 𝐵)
55	54	pm2.24d 151	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
56		eqtr3 2751	. . . . . . . 8 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → 𝐴 = 𝐵)
57	56	orcd 873	. . . . . . 7 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴))
58	57	a1d 25	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
59	52, 55, 58	3jaodan 1433	. . . . 5 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
60	29, 46, 59	3jaoian 1432	. . . 4 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
61	11, 12, 60	syl2anb 598	. . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ 𝐴 < 𝐵 → (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))
62	10, 61	impbid 212	. 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴 = 𝐵 ∨ 𝐵 < 𝐴) ↔ ¬ 𝐴 < 𝐵))
63	62	con2bid 354	1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 < 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 < 𝐴)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∨ w3o 1085   = wceq 1540   ∈ wcel 2109   class class class wbr 5107  ℝcr 11067  +∞cpnf 11205  -∞cmnf 11206  ℝ^*cxr 11207   < clt 11208

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-pre-lttri 11142  ax-pre-lttrn 11143

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-po 5546  df-so 5547  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-er 8671  df-en 8919  df-dom 8920  df-sdom 8921  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213

This theorem is referenced by:  xrltso  13101  xrleloe  13104  xrltlen  13106