xrltnsym - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > xrltnsym		GIF version

Theorem xrltnsym 9750

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 9733	. 2 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		elxr 9733	. 2 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3		ltnsym 8005	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
4		rexr 7965	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ^*)
5		pnfnlt 9744	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → ¬ +∞ < 𝐴)
6	4, 5	syl 14	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → ¬ +∞ < 𝐴)
7	6	adantr 274	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ +∞ < 𝐴)
8		breq1 3992	. . . . . . 7 ⊢ (𝐵 = +∞ → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
9	8	adantl 275	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
10	7, 9	mtbird 668	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
11	10	a1d 22	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
12		nltmnf 9745	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → ¬ 𝐴 < -∞)
13	4, 12	syl 14	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 < -∞)
14	13	adantr 274	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < -∞)
15		breq2 3993	. . . . . . 7 ⊢ (𝐵 = -∞ → (𝐴 < 𝐵 ↔ 𝐴 < -∞))
16	15	adantl 275	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 ↔ 𝐴 < -∞))
17	14, 16	mtbird 668	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
18	17	pm2.21d 614	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
19	3, 11, 18	3jaodan 1301	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
20		pnfnlt 9744	. . . . . . 7 ⊢ (𝐵 ∈ ℝ^* → ¬ +∞ < 𝐵)
21	20	adantl 275	. . . . . 6 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → ¬ +∞ < 𝐵)
22		breq1 3992	. . . . . . 7 ⊢ (𝐴 = +∞ → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
23	22	adantr 274	. . . . . 6 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
24	21, 23	mtbird 668	. . . . 5 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → ¬ 𝐴 < 𝐵)
25	24	pm2.21d 614	. . . 4 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
26	2, 25	sylan2br 286	. . 3 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
27		rexr 7965	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
28		nltmnf 9745	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ^* → ¬ 𝐵 < -∞)
29	27, 28	syl 14	. . . . . . 7 ⊢ (𝐵 ∈ ℝ → ¬ 𝐵 < -∞)
30	29	adantl 275	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < -∞)
31		breq2 3993	. . . . . . 7 ⊢ (𝐴 = -∞ → (𝐵 < 𝐴 ↔ 𝐵 < -∞))
32	31	adantr 274	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴 ↔ 𝐵 < -∞))
33	30, 32	mtbird 668	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < 𝐴)
34	33	a1d 22	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
35		mnfxr 7976	. . . . . . . 8 ⊢ -∞ ∈ ℝ^*
36		pnfnlt 9744	. . . . . . . 8 ⊢ (-∞ ∈ ℝ^* → ¬ +∞ < -∞)
37	35, 36	ax-mp 5	. . . . . . 7 ⊢ ¬ +∞ < -∞
38		breq12 3994	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → (𝐵 < 𝐴 ↔ +∞ < -∞))
39	37, 38	mtbiri 670	. . . . . 6 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → ¬ 𝐵 < 𝐴)
40	39	ancoms 266	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
41	40	a1d 22	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
42		xrltnr 9736	. . . . . . 7 ⊢ (-∞ ∈ ℝ^* → ¬ -∞ < -∞)
43	35, 42	ax-mp 5	. . . . . 6 ⊢ ¬ -∞ < -∞
44		breq12 3994	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 ↔ -∞ < -∞))
45	43, 44	mtbiri 670	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
46	45	pm2.21d 614	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
47	34, 41, 46	3jaodan 1301	. . 3 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
48	19, 26, 47	3jaoian 1300	. 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
49	1, 2, 48	syl2anb 289	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∨ w3o 972 = wceq 1348 ∈ wcel 2141 class class class wbr 3989 ℝcr 7773 +∞cpnf 7951 -∞cmnf 7952 ℝ^*cxr 7953 < clt 7954

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-cnex 7865 ax-resscn 7866 ax-pre-ltirr 7886 ax-pre-lttrn 7888

This theorem depends on definitions: df-bi 116 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-rab 2457 df-v 2732 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-br 3990 df-opab 4051 df-xp 4617 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959

This theorem is referenced by: xrltnsym2 9751 xrltle 9755

W3C validator