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

Theorem xrltnsym 9700
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 9683 . 2 (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2 elxr 9683 . 2 (𝐵 ∈ ℝ* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3 ltnsym 7963 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
4 rexr 7923 . . . . . . . 8 (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*)
5 pnfnlt 9694 . . . . . . . 8 (𝐴 ∈ ℝ* → ¬ +∞ < 𝐴)
64, 5syl 14 . . . . . . 7 (𝐴 ∈ ℝ → ¬ +∞ < 𝐴)
76adantr 274 . . . . . 6 ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ +∞ < 𝐴)
8 breq1 3968 . . . . . . 7 (𝐵 = +∞ → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
98adantl 275 . . . . . 6 ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐵 < 𝐴 ↔ +∞ < 𝐴))
107, 9mtbird 663 . . . . 5 ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
1110a1d 22 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
12 nltmnf 9695 . . . . . . . 8 (𝐴 ∈ ℝ* → ¬ 𝐴 < -∞)
134, 12syl 14 . . . . . . 7 (𝐴 ∈ ℝ → ¬ 𝐴 < -∞)
1413adantr 274 . . . . . 6 ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < -∞)
15 breq2 3969 . . . . . . 7 (𝐵 = -∞ → (𝐴 < 𝐵𝐴 < -∞))
1615adantl 275 . . . . . 6 ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵𝐴 < -∞))
1714, 16mtbird 663 . . . . 5 ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
1817pm2.21d 609 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
193, 11, 183jaodan 1288 . . 3 ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
20 pnfnlt 9694 . . . . . . 7 (𝐵 ∈ ℝ* → ¬ +∞ < 𝐵)
2120adantl 275 . . . . . 6 ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ*) → ¬ +∞ < 𝐵)
22 breq1 3968 . . . . . . 7 (𝐴 = +∞ → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
2322adantr 274 . . . . . 6 ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ*) → (𝐴 < 𝐵 ↔ +∞ < 𝐵))
2421, 23mtbird 663 . . . . 5 ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ*) → ¬ 𝐴 < 𝐵)
2524pm2.21d 609 . . . 4 ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
262, 25sylan2br 286 . . 3 ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
27 rexr 7923 . . . . . . . 8 (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*)
28 nltmnf 9695 . . . . . . . 8 (𝐵 ∈ ℝ* → ¬ 𝐵 < -∞)
2927, 28syl 14 . . . . . . 7 (𝐵 ∈ ℝ → ¬ 𝐵 < -∞)
3029adantl 275 . . . . . 6 ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < -∞)
31 breq2 3969 . . . . . . 7 (𝐴 = -∞ → (𝐵 < 𝐴𝐵 < -∞))
3231adantr 274 . . . . . 6 ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐵 < 𝐴𝐵 < -∞))
3330, 32mtbird 663 . . . . 5 ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 < 𝐴)
3433a1d 22 . . . 4 ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
35 mnfxr 7934 . . . . . . . 8 -∞ ∈ ℝ*
36 pnfnlt 9694 . . . . . . . 8 (-∞ ∈ ℝ* → ¬ +∞ < -∞)
3735, 36ax-mp 5 . . . . . . 7 ¬ +∞ < -∞
38 breq12 3970 . . . . . . 7 ((𝐵 = +∞ ∧ 𝐴 = -∞) → (𝐵 < 𝐴 ↔ +∞ < -∞))
3937, 38mtbiri 665 . . . . . 6 ((𝐵 = +∞ ∧ 𝐴 = -∞) → ¬ 𝐵 < 𝐴)
4039ancoms 266 . . . . 5 ((𝐴 = -∞ ∧ 𝐵 = +∞) → ¬ 𝐵 < 𝐴)
4140a1d 22 . . . 4 ((𝐴 = -∞ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
42 xrltnr 9686 . . . . . . 7 (-∞ ∈ ℝ* → ¬ -∞ < -∞)
4335, 42ax-mp 5 . . . . . 6 ¬ -∞ < -∞
44 breq12 3970 . . . . . 6 ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 ↔ -∞ < -∞))
4543, 44mtbiri 665 . . . . 5 ((𝐴 = -∞ ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐵)
4645pm2.21d 609 . . . 4 ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
4734, 41, 463jaodan 1288 . . 3 ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
4819, 26, 473jaoian 1287 . 2 (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
491, 2, 48syl2anb 289 1 ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  w3o 962   = wceq 1335  wcel 2128   class class class wbr 3965  cr 7731  +∞cpnf 7909  -∞cmnf 7910  *cxr 7911   < clt 7912
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 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-sep 4082  ax-pow 4135  ax-pr 4169  ax-un 4393  ax-setind 4496  ax-cnex 7823  ax-resscn 7824  ax-pre-ltirr 7844  ax-pre-lttrn 7846
This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-nel 2423  df-ral 2440  df-rex 2441  df-rab 2444  df-v 2714  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-br 3966  df-opab 4026  df-xp 4592  df-pnf 7914  df-mnf 7915  df-xr 7916  df-ltxr 7917
This theorem is referenced by:  xrltnsym2  9701  xrltle  9705
  Copyright terms: Public domain W3C validator