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

Theorem nltpnft 10227
Description: An extended real is not less than plus infinity iff they are equal. (Contributed by NM, 30-Jan-2006.)
Assertion
Ref Expression
nltpnft (𝐴 ∈ ℝ* → (𝐴 = +∞ ↔ ¬ 𝐴 < +∞))

Proof of Theorem nltpnft
StepHypRef Expression
1 elxr 10189 . 2 (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2 renepnf 8374 . . . . 5 (𝐴 ∈ ℝ → 𝐴 ≠ +∞)
32neneqd 2441 . . . 4 (𝐴 ∈ ℝ → ¬ 𝐴 = +∞)
4 ltpnf 10193 . . . . 5 (𝐴 ∈ ℝ → 𝐴 < +∞)
5 notnot 638 . . . . 5 (𝐴 < +∞ → ¬ ¬ 𝐴 < +∞)
64, 5syl 14 . . . 4 (𝐴 ∈ ℝ → ¬ ¬ 𝐴 < +∞)
73, 62falsed 714 . . 3 (𝐴 ∈ ℝ → (𝐴 = +∞ ↔ ¬ 𝐴 < +∞))
8 id 19 . . . 4 (𝐴 = +∞ → 𝐴 = +∞)
9 pnfxr 8379 . . . . . 6 +∞ ∈ ℝ*
10 xrltnr 10192 . . . . . 6 (+∞ ∈ ℝ* → ¬ +∞ < +∞)
119, 10ax-mp 5 . . . . 5 ¬ +∞ < +∞
12 breq1 4133 . . . . 5 (𝐴 = +∞ → (𝐴 < +∞ ↔ +∞ < +∞))
1311, 12mtbiri 686 . . . 4 (𝐴 = +∞ → ¬ 𝐴 < +∞)
148, 132thd 175 . . 3 (𝐴 = +∞ → (𝐴 = +∞ ↔ ¬ 𝐴 < +∞))
15 mnfnepnf 8382 . . . . . 6 -∞ ≠ +∞
1615neii 2422 . . . . 5 ¬ -∞ = +∞
17 eqeq1 2245 . . . . 5 (𝐴 = -∞ → (𝐴 = +∞ ↔ -∞ = +∞))
1816, 17mtbiri 686 . . . 4 (𝐴 = -∞ → ¬ 𝐴 = +∞)
19 mnfltpnf 10198 . . . . . . 7 -∞ < +∞
20 breq1 4133 . . . . . . 7 (𝐴 = -∞ → (𝐴 < +∞ ↔ -∞ < +∞))
2119, 20mpbiri 168 . . . . . 6 (𝐴 = -∞ → 𝐴 < +∞)
2221necon3bi 2470 . . . . 5 (¬ 𝐴 < +∞ → 𝐴 ≠ -∞)
2322necon2bi 2475 . . . 4 (𝐴 = -∞ → ¬ ¬ 𝐴 < +∞)
2418, 232falsed 714 . . 3 (𝐴 = -∞ → (𝐴 = +∞ ↔ ¬ 𝐴 < +∞))
257, 14, 243jaoi 1344 . 2 ((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) → (𝐴 = +∞ ↔ ¬ 𝐴 < +∞))
261, 25sylbi 121 1 (𝐴 ∈ ℝ* → (𝐴 = +∞ ↔ ¬ 𝐴 < +∞))
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 105   ∨ w3o 1008   = wceq 1402   ∈ wcel 2209   class class class wbr 4130  ℝcr 8179  +∞cpnf 8358  -∞cmnf 8359  ℝ*cxr 8360   < clt 8361
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-pre-ltirr 8292
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-xp 4780  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366
This theorem is used by:  npnflt  10228  xgepnf  10229  xrmaxiflemlub  12033
  Copyright terms: Public domain W3C validator