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

Theorem xrltnsym 9232
Description: Ordering on the extended reals is not symmetric. (Contributed by NM, 15-Oct-2005.)
Assertion
Ref Expression
xrltnsym ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))

Proof of Theorem xrltnsym
StepHypRef Expression
1 elxr 9216 . 2 (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2 elxr 9216 . 2 (𝐵 ∈ ℝ* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3 ltnsym 7550 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
4 rexr 7512 . . . . . . . 8 (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*)
5 pnfnlt 9226 . . . . . . . 8 (𝐴 ∈ ℝ* → ¬ +∞ < 𝐴)
64, 5syl 14 . . . . . . 7 (𝐴 ∈ ℝ → ¬ +∞ < 𝐴)
76adantr 270 . . . . . 6 ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ +∞ < 𝐴)
8 breq1 3840 . . . . . . 7 (𝐵 = +∞ → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
98adantl 271 . . . . . 6 ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
107, 9mtbird 633 . . . . 5 ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
1110a1d 22 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
12 nltmnf 9227 . . . . . . . 8 (𝐴 ∈ ℝ* → ¬ 𝐴 < -∞)
134, 12syl 14 . . . . . . 7 (𝐴 ∈ ℝ → ¬ 𝐴 < -∞)
1413adantr 270 . . . . . 6 ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < -∞)
15 breq2 3841 . . . . . . 7 (𝐵 = -∞ → (𝐴 < 𝐵𝐴 < -∞))
1615adantl 271 . . . . . 6 ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵𝐴 < -∞))
1714, 16mtbird 633 . . . . 5 ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
1817pm2.21d 584 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
193, 11, 183jaodan 1242 . . 3 ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
20 pnfnlt 9226 . . . . . . 7 (𝐵 ∈ ℝ* → ¬ +∞ < 𝐵)
2120adantl 271 . . . . . 6 ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ*) → ¬ +∞ < 𝐵)
22 breq1 3840 . . . . . . 7 (𝐴 = +∞ → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
2322adantr 270 . . . . . 6 ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ*) → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
2421, 23mtbird 633 . . . . 5 ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ*) → ¬ 𝐴 < 𝐵)
2524pm2.21d 584 . . . 4 ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
262, 25sylan2br 282 . . 3 ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
27 rexr 7512 . . . . . . . 8 (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*)
28 nltmnf 9227 . . . . . . . 8 (𝐵 ∈ ℝ* → ¬ 𝐵 < -∞)
2927, 28syl 14 . . . . . . 7 (𝐵 ∈ ℝ → ¬ 𝐵 < -∞)
3029adantl 271 . . . . . 6 ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < -∞)
31 breq2 3841 . . . . . . 7 (𝐴 = -∞ → (𝐵 < 𝐴𝐵 < -∞))
3231adantr 270 . . . . . 6 ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴𝐵 < -∞))
3330, 32mtbird 633 . . . . 5 ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < 𝐴)
3433a1d 22 . . . 4 ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
35 mnfxr 7523 . . . . . . . 8 -∞ ∈ ℝ*
36 pnfnlt 9226 . . . . . . . 8 (-∞ ∈ ℝ* → ¬ +∞ < -∞)
3735, 36ax-mp 7 . . . . . . 7 ¬ +∞ < -∞
38 breq12 3842 . . . . . . 7 ((𝐵 = +∞ ∧ 𝐴 = -∞) → (𝐵 < 𝐴 ↔ +∞ < -∞))
3937, 38mtbiri 635 . . . . . 6 ((𝐵 = +∞ ∧ 𝐴 = -∞) → ¬ 𝐵 < 𝐴)
4039ancoms 264 . . . . 5 ((𝐴 = -∞ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
4140a1d 22 . . . 4 ((𝐴 = -∞ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
42 xrltnr 9219 . . . . . . 7 (-∞ ∈ ℝ* → ¬ -∞ < -∞)
4335, 42ax-mp 7 . . . . . 6 ¬ -∞ < -∞
44 breq12 3842 . . . . . 6 ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 ↔ -∞ < -∞))
4543, 44mtbiri 635 . . . . 5 ((𝐴 = -∞ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
4645pm2.21d 584 . . . 4 ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
4734, 41, 463jaodan 1242 . . 3 ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
4819, 26, 473jaoian 1241 . 2 (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
491, 2, 48syl2anb 285 1 ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102  wb 103  w3o 923   = wceq 1289  wcel 1438   class class class wbr 3837  cr 7328  +∞cpnf 7498  -∞cmnf 7499  *cxr 7500   < clt 7501
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3949  ax-pow 4001  ax-pr 4027  ax-un 4251  ax-setind 4343  ax-cnex 7415  ax-resscn 7416  ax-pre-ltirr 7436  ax-pre-lttrn 7438
This theorem depends on definitions:  df-bi 115  df-3or 925  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-nel 2351  df-ral 2364  df-rex 2365  df-rab 2368  df-v 2621  df-dif 2999  df-un 3001  df-in 3003  df-ss 3010  df-pw 3427  df-sn 3447  df-pr 3448  df-op 3450  df-uni 3649  df-br 3838  df-opab 3892  df-xp 4434  df-pnf 7503  df-mnf 7504  df-xr 7505  df-ltxr 7506
This theorem is referenced by:  xrltnsym2  9233  xrltle  9237
  Copyright terms: Public domain W3C validator