MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ltxrlt Structured version   Visualization version   GIF version

Theorem ltxrlt 10700
Description: The standard less-than < and the extended real less-than < are identical when restricted to the non-extended reals . (Contributed by NM, 13-Oct-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
ltxrlt ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵𝐴 < 𝐵))

Proof of Theorem ltxrlt
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 brun 5081 . . . . 5 (𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵 ↔ (𝐴((ℝ ∪ {-∞}) × {+∞})𝐵𝐴({-∞} × ℝ)𝐵))
2 brxp 5565 . . . . . . 7 (𝐴((ℝ ∪ {-∞}) × {+∞})𝐵 ↔ (𝐴 ∈ (ℝ ∪ {-∞}) ∧ 𝐵 ∈ {+∞}))
3 elsni 4542 . . . . . . . 8 (𝐵 ∈ {+∞} → 𝐵 = +∞)
4 pnfnre 10671 . . . . . . . . . 10 +∞ ∉ ℝ
54neli 3093 . . . . . . . . 9 ¬ +∞ ∈ ℝ
6 simpr 488 . . . . . . . . . 10 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ)
7 eleq1 2877 . . . . . . . . . 10 (𝐵 = +∞ → (𝐵 ∈ ℝ ↔ +∞ ∈ ℝ))
86, 7syl5ib 247 . . . . . . . . 9 (𝐵 = +∞ → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → +∞ ∈ ℝ))
95, 8mtoi 202 . . . . . . . 8 (𝐵 = +∞ → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
103, 9syl 17 . . . . . . 7 (𝐵 ∈ {+∞} → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
112, 10simplbiim 508 . . . . . 6 (𝐴((ℝ ∪ {-∞}) × {+∞})𝐵 → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
12 brxp 5565 . . . . . . 7 (𝐴({-∞} × ℝ)𝐵 ↔ (𝐴 ∈ {-∞} ∧ 𝐵 ∈ ℝ))
13 elsni 4542 . . . . . . . . 9 (𝐴 ∈ {-∞} → 𝐴 = -∞)
14 mnfnre 10673 . . . . . . . . . . 11 -∞ ∉ ℝ
1514neli 3093 . . . . . . . . . 10 ¬ -∞ ∈ ℝ
16 simpl 486 . . . . . . . . . . 11 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℝ)
17 eleq1 2877 . . . . . . . . . . 11 (𝐴 = -∞ → (𝐴 ∈ ℝ ↔ -∞ ∈ ℝ))
1816, 17syl5ib 247 . . . . . . . . . 10 (𝐴 = -∞ → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → -∞ ∈ ℝ))
1915, 18mtoi 202 . . . . . . . . 9 (𝐴 = -∞ → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2013, 19syl 17 . . . . . . . 8 (𝐴 ∈ {-∞} → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2120adantr 484 . . . . . . 7 ((𝐴 ∈ {-∞} ∧ 𝐵 ∈ ℝ) → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2212, 21sylbi 220 . . . . . 6 (𝐴({-∞} × ℝ)𝐵 → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2311, 22jaoi 854 . . . . 5 ((𝐴((ℝ ∪ {-∞}) × {+∞})𝐵𝐴({-∞} × ℝ)𝐵) → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
241, 23sylbi 220 . . . 4 (𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵 → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2524con2i 141 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵)
26 df-ltxr 10669 . . . . . . 7 < = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)} ∪ (((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ)))
2726equncomi 4082 . . . . . 6 < = ((((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ)) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)})
2827breqi 5036 . . . . 5 (𝐴 < 𝐵𝐴((((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ)) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)})𝐵)
29 brun 5081 . . . . 5 (𝐴((((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ)) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)})𝐵 ↔ (𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
30 df-or 845 . . . . 5 ((𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵) ↔ (¬ 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
3128, 29, 303bitri 300 . . . 4 (𝐴 < 𝐵 ↔ (¬ 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
32 biimt 364 . . . 4 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵 → (𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵 ↔ (¬ 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵)))
3331, 32bitr4id 293 . . 3 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵 → (𝐴 < 𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
3425, 33syl 17 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
35 breq12 5035 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 < 𝑦𝐴 < 𝐵))
36 df-3an 1086 . . . . 5 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦) ↔ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ 𝑥 < 𝑦))
3736opabbii 5097 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ 𝑥 < 𝑦)}
3835, 37brab2a 5608 . . 3 (𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵 ↔ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐴 < 𝐵))
3938baibr 540 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
4034, 39bitr4d 285 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵𝐴 < 𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  wo 844  w3a 1084   = wceq 1538  wcel 2111  cun 3879  {csn 4525   class class class wbr 5030  {copab 5092   × cxp 5517  cr 10525   < cltrr 10530  +∞cpnf 10661  -∞cmnf 10662   < clt 10664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-resscn 10583
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-er 8272  df-en 8493  df-dom 8494  df-sdom 8495  df-pnf 10666  df-mnf 10667  df-ltxr 10669
This theorem is referenced by:  axlttri  10701  axlttrn  10702  axltadd  10703  axmulgt0  10704  axsup  10705
  Copyright terms: Public domain W3C validator