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

Theorem ltxrlt 10713
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 5119 . . . . 5 (𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵 ↔ (𝐴((ℝ ∪ {-∞}) × {+∞})𝐵𝐴({-∞} × ℝ)𝐵))
2 brxp 5603 . . . . . . 7 (𝐴((ℝ ∪ {-∞}) × {+∞})𝐵 ↔ (𝐴 ∈ (ℝ ∪ {-∞}) ∧ 𝐵 ∈ {+∞}))
3 elsni 4586 . . . . . . . 8 (𝐵 ∈ {+∞} → 𝐵 = +∞)
4 pnfnre 10684 . . . . . . . . . 10 +∞ ∉ ℝ
54neli 3127 . . . . . . . . 9 ¬ +∞ ∈ ℝ
6 simpr 487 . . . . . . . . . 10 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ)
7 eleq1 2902 . . . . . . . . . 10 (𝐵 = +∞ → (𝐵 ∈ ℝ ↔ +∞ ∈ ℝ))
86, 7syl5ib 246 . . . . . . . . 9 (𝐵 = +∞ → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → +∞ ∈ ℝ))
95, 8mtoi 201 . . . . . . . 8 (𝐵 = +∞ → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
103, 9syl 17 . . . . . . 7 (𝐵 ∈ {+∞} → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
112, 10simplbiim 507 . . . . . 6 (𝐴((ℝ ∪ {-∞}) × {+∞})𝐵 → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
12 brxp 5603 . . . . . . 7 (𝐴({-∞} × ℝ)𝐵 ↔ (𝐴 ∈ {-∞} ∧ 𝐵 ∈ ℝ))
13 elsni 4586 . . . . . . . . 9 (𝐴 ∈ {-∞} → 𝐴 = -∞)
14 mnfnre 10686 . . . . . . . . . . 11 -∞ ∉ ℝ
1514neli 3127 . . . . . . . . . 10 ¬ -∞ ∈ ℝ
16 simpl 485 . . . . . . . . . . 11 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℝ)
17 eleq1 2902 . . . . . . . . . . 11 (𝐴 = -∞ → (𝐴 ∈ ℝ ↔ -∞ ∈ ℝ))
1816, 17syl5ib 246 . . . . . . . . . 10 (𝐴 = -∞ → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → -∞ ∈ ℝ))
1915, 18mtoi 201 . . . . . . . . 9 (𝐴 = -∞ → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2013, 19syl 17 . . . . . . . 8 (𝐴 ∈ {-∞} → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2120adantr 483 . . . . . . 7 ((𝐴 ∈ {-∞} ∧ 𝐵 ∈ ℝ) → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2212, 21sylbi 219 . . . . . 6 (𝐴({-∞} × ℝ)𝐵 → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2311, 22jaoi 853 . . . . 5 ((𝐴((ℝ ∪ {-∞}) × {+∞})𝐵𝐴({-∞} × ℝ)𝐵) → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
241, 23sylbi 219 . . . 4 (𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵 → ¬ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
2524con2i 141 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵)
26 biimt 363 . . . 4 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵 → (𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵 ↔ (¬ 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵)))
27 df-ltxr 10682 . . . . . . 7 < = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)} ∪ (((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ)))
2827equncomi 4133 . . . . . 6 < = ((((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ)) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)})
2928breqi 5074 . . . . 5 (𝐴 < 𝐵𝐴((((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ)) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)})𝐵)
30 brun 5119 . . . . 5 (𝐴((((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ)) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)})𝐵 ↔ (𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
31 df-or 844 . . . . 5 ((𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵) ↔ (¬ 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
3229, 30, 313bitri 299 . . . 4 (𝐴 < 𝐵 ↔ (¬ 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
3326, 32syl6rbbr 292 . . 3 𝐴(((ℝ ∪ {-∞}) × {+∞}) ∪ ({-∞} × ℝ))𝐵 → (𝐴 < 𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
3425, 33syl 17 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
35 breq12 5073 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 < 𝑦𝐴 < 𝐵))
36 df-3an 1085 . . . . 5 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦) ↔ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ 𝑥 < 𝑦))
3736opabbii 5135 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ 𝑥 < 𝑦)}
3835, 37brab2a 5646 . . 3 (𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵 ↔ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐴 < 𝐵))
3938baibr 539 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵𝐴{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑥 < 𝑦)}𝐵))
4034, 39bitr4d 284 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵𝐴 < 𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843  w3a 1083   = wceq 1537  wcel 2114  cun 3936  {csn 4569   class class class wbr 5068  {copab 5130   × cxp 5555  cr 10538   < cltrr 10543  +∞cpnf 10674  -∞cmnf 10675   < clt 10677
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-resscn 10596
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-er 8291  df-en 8512  df-dom 8513  df-sdom 8514  df-pnf 10679  df-mnf 10680  df-ltxr 10682
This theorem is referenced by:  axlttri  10714  axlttrn  10715  axltadd  10716  axmulgt0  10717  axsup  10718
  Copyright terms: Public domain W3C validator