xrltnsym - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > xrltnsym		Structured version Visualization version GIF version

Theorem xrltnsym 13011

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

**Assertion**
Ref	Expression
xrltnsym	⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))

**Proof of Theorem xrltnsym**
Step	Hyp	Ref	Expression
1		elxr 12992	. 2 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		elxr 12992	. 2 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3		ltnsym 11212	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
4		rexr 11160	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ^*)
5		pnfnlt 13004	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → ¬ +∞ < 𝐴)
6	4, 5	syl 17	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → ¬ +∞ < 𝐴)
7	6	adantr 482	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ +∞ < 𝐴)
8		breq1 5107	. . . . . . 7 ⊢ (𝐵 = +∞ → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
9	8	adantl 483	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
10	7, 9	mtbird 325	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
11	10	a1d 25	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
12		nltmnf 13005	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → ¬ 𝐴 < -∞)
13	4, 12	syl 17	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 < -∞)
14	13	adantr 482	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < -∞)
15		breq2 5108	. . . . . . 7 ⊢ (𝐵 = -∞ → (𝐴 < 𝐵 ↔ 𝐴 < -∞))
16	15	adantl 483	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 ↔ 𝐴 < -∞))
17	14, 16	mtbird 325	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
18	17	pm2.21d 121	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
19	3, 11, 18	3jaodan 1431	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
20		pnfnlt 13004	. . . . . . 7 ⊢ (𝐵 ∈ ℝ^* → ¬ +∞ < 𝐵)
21	20	adantl 483	. . . . . 6 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → ¬ +∞ < 𝐵)
22		breq1 5107	. . . . . . 7 ⊢ (𝐴 = +∞ → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
23	22	adantr 482	. . . . . 6 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
24	21, 23	mtbird 325	. . . . 5 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → ¬ 𝐴 < 𝐵)
25	24	pm2.21d 121	. . . 4 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
26	2, 25	sylan2br 596	. . 3 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
27		rexr 11160	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
28		nltmnf 13005	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ^* → ¬ 𝐵 < -∞)
29	27, 28	syl 17	. . . . . . 7 ⊢ (𝐵 ∈ ℝ → ¬ 𝐵 < -∞)
30	29	adantl 483	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < -∞)
31		breq2 5108	. . . . . . 7 ⊢ (𝐴 = -∞ → (𝐵 < 𝐴 ↔ 𝐵 < -∞))
32	31	adantr 482	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴 ↔ 𝐵 < -∞))
33	30, 32	mtbird 325	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < 𝐴)
34	33	a1d 25	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
35		mnfxr 11171	. . . . . . . 8 ⊢ -∞ ∈ ℝ^*
36		pnfnlt 13004	. . . . . . . 8 ⊢ (-∞ ∈ ℝ^* → ¬ +∞ < -∞)
37	35, 36	ax-mp 5	. . . . . . 7 ⊢ ¬ +∞ < -∞
38		breq12 5109	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → (𝐵 < 𝐴 ↔ +∞ < -∞))
39	37, 38	mtbiri 327	. . . . . 6 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → ¬ 𝐵 < 𝐴)
40	39	ancoms 460	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
41	40	a1d 25	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
42		xrltnr 12995	. . . . . . 7 ⊢ (-∞ ∈ ℝ^* → ¬ -∞ < -∞)
43	35, 42	ax-mp 5	. . . . . 6 ⊢ ¬ -∞ < -∞
44		breq12 5109	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 ↔ -∞ < -∞))
45	43, 44	mtbiri 327	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
46	45	pm2.21d 121	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
47	34, 41, 46	3jaodan 1431	. . 3 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
48	19, 26, 47	3jaoian 1430	. 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
49	1, 2, 48	syl2anb 599	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∨ w3o 1087 = wceq 1542 ∈ wcel 2107 class class class wbr 5104 ℝcr 11009 +∞cpnf 11145 -∞cmnf 11146 ℝ^*cxr 11147 < clt 11148

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2709 ax-sep 5255 ax-nul 5262 ax-pow 5319 ax-pr 5383 ax-un 7665 ax-cnex 11066 ax-resscn 11067 ax-pre-lttri 11084 ax-pre-lttrn 11085

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3064 df-rex 3073 df-rab 3407 df-v 3446 df-sbc 3739 df-csb 3855 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-br 5105 df-opab 5167 df-mpt 5188 df-id 5530 df-po 5544 df-so 5545 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6446 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-er 8607 df-en 8843 df-dom 8844 df-sdom 8845 df-pnf 11150 df-mnf 11151 df-xr 11152 df-ltxr 11153

This theorem is referenced by: xrltnsym2 13012 xrlttri 13013 xmullem2 13139 sgnp 14935 iccpartnel 45525

W3C validator