xrltnsym - Intuitionistic Logic Explorer

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

Theorem xrltnsym 10072

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 10055	. 2 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		elxr 10055	. 2 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3		ltnsym 8307	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
4		rexr 8267	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ^*)
5		pnfnlt 10066	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → ¬ +∞ < 𝐴)
6	4, 5	syl 14	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → ¬ +∞ < 𝐴)
7	6	adantr 276	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ +∞ < 𝐴)
8		breq1 4096	. . . . . . 7 ⊢ (𝐵 = +∞ → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
9	8	adantl 277	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
10	7, 9	mtbird 680	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
11	10	a1d 22	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
12		nltmnf 10067	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → ¬ 𝐴 < -∞)
13	4, 12	syl 14	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 < -∞)
14	13	adantr 276	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < -∞)
15		breq2 4097	. . . . . . 7 ⊢ (𝐵 = -∞ → (𝐴 < 𝐵 ↔ 𝐴 < -∞))
16	15	adantl 277	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 ↔ 𝐴 < -∞))
17	14, 16	mtbird 680	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
18	17	pm2.21d 624	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
19	3, 11, 18	3jaodan 1343	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
20		pnfnlt 10066	. . . . . . 7 ⊢ (𝐵 ∈ ℝ^* → ¬ +∞ < 𝐵)
21	20	adantl 277	. . . . . 6 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → ¬ +∞ < 𝐵)
22		breq1 4096	. . . . . . 7 ⊢ (𝐴 = +∞ → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
23	22	adantr 276	. . . . . 6 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
24	21, 23	mtbird 680	. . . . 5 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → ¬ 𝐴 < 𝐵)
25	24	pm2.21d 624	. . . 4 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
26	2, 25	sylan2br 288	. . 3 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
27		rexr 8267	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
28		nltmnf 10067	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ^* → ¬ 𝐵 < -∞)
29	27, 28	syl 14	. . . . . . 7 ⊢ (𝐵 ∈ ℝ → ¬ 𝐵 < -∞)
30	29	adantl 277	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < -∞)
31		breq2 4097	. . . . . . 7 ⊢ (𝐴 = -∞ → (𝐵 < 𝐴 ↔ 𝐵 < -∞))
32	31	adantr 276	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴 ↔ 𝐵 < -∞))
33	30, 32	mtbird 680	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < 𝐴)
34	33	a1d 22	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
35		mnfxr 8278	. . . . . . . 8 ⊢ -∞ ∈ ℝ^*
36		pnfnlt 10066	. . . . . . . 8 ⊢ (-∞ ∈ ℝ^* → ¬ +∞ < -∞)
37	35, 36	ax-mp 5	. . . . . . 7 ⊢ ¬ +∞ < -∞
38		breq12 4098	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → (𝐵 < 𝐴 ↔ +∞ < -∞))
39	37, 38	mtbiri 682	. . . . . 6 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → ¬ 𝐵 < 𝐴)
40	39	ancoms 268	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
41	40	a1d 22	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
42		xrltnr 10058	. . . . . . 7 ⊢ (-∞ ∈ ℝ^* → ¬ -∞ < -∞)
43	35, 42	ax-mp 5	. . . . . 6 ⊢ ¬ -∞ < -∞
44		breq12 4098	. . . . . 6 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 ↔ -∞ < -∞))
45	43, 44	mtbiri 682	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
46	45	pm2.21d 624	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
47	34, 41, 46	3jaodan 1343	. . 3 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
48	19, 26, 47	3jaoian 1342	. 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
49	1, 2, 48	syl2anb 291	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ w3o 1004 = wceq 1398 ∈ wcel 2202 class class class wbr 4093 ℝcr 8074 +∞cpnf 8253 -∞cmnf 8254 ℝ^*cxr 8255 < clt 8256

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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-pre-ltirr 8187 ax-pre-lttrn 8189

This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-rab 2520 df-v 2805 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-xp 4737 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261

This theorem is referenced by: xrltnsym2 10073 xrltle 10077

W3C validator