Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  tridceq GIF version

Theorem tridceq 17313
Description: Real trichotomy implies decidability of real number equality. Or in other words, analytic LPO implies analytic WLPO (see trilpo 17299 and redcwlpo 17312). Thus, this is an analytic analogue to lpowlpo 7514. (Contributed by Jim Kingdon, 24-Jul-2024.)
Assertion
Ref Expression
tridceq (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) → ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦)
Distinct variable group:   𝑥,𝑦

Proof of Theorem tridceq
StepHypRef Expression
1 ltne 8416 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑥 < 𝑦) → 𝑦 ≠ 𝑥)
21ex 115 . . . . . 6 (𝑥 ∈ ℝ → (𝑥 < 𝑦 → 𝑦 ≠ 𝑥))
32adantr 276 . . . . 5 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 < 𝑦 → 𝑦 ≠ 𝑥))
4 olc 723 . . . . . 6 (𝑥 ≠ 𝑦 → (𝑥 = 𝑦 ∨ 𝑥 ≠ 𝑦))
5 necom 2504 . . . . . 6 (𝑦 ≠ 𝑥 ↔ 𝑥 ≠ 𝑦)
6 dcne 2431 . . . . . 6 (DECID 𝑥 = 𝑦 ↔ (𝑥 = 𝑦 ∨ 𝑥 ≠ 𝑦))
74, 5, 63imtr4i 201 . . . . 5 (𝑦 ≠ 𝑥 → DECID 𝑥 = 𝑦)
83, 7syl6 33 . . . 4 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 < 𝑦 → DECID 𝑥 = 𝑦))
9 orc 724 . . . . . 6 (𝑥 = 𝑦 → (𝑥 = 𝑦 ∨ 𝑥 ≠ 𝑦))
109, 6sylibr 134 . . . . 5 (𝑥 = 𝑦 → DECID 𝑥 = 𝑦)
1110a1i 9 . . . 4 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 = 𝑦 → DECID 𝑥 = 𝑦))
12 ltne 8416 . . . . . . 7 ((𝑦 ∈ ℝ ∧ 𝑦 < 𝑥) → 𝑥 ≠ 𝑦)
1312ex 115 . . . . . 6 (𝑦 ∈ ℝ → (𝑦 < 𝑥 → 𝑥 ≠ 𝑦))
1413adantl 277 . . . . 5 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑦 < 𝑥 → 𝑥 ≠ 𝑦))
154, 6sylibr 134 . . . . 5 (𝑥 ≠ 𝑦 → DECID 𝑥 = 𝑦)
1614, 15syl6 33 . . . 4 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑦 < 𝑥 → DECID 𝑥 = 𝑦))
178, 11, 163jaod 1345 . . 3 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) → DECID 𝑥 = 𝑦))
1817ralimdva 2617 . 2 (𝑥 ∈ ℝ → (∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) → ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦))
1918ralimia 2611 1 (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) → ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∨ wo 720  DECID wdc 846   ∨ w3o 1008   ∈ wcel 2209   ≠ wne 2420  ∀wral 2528   class class class wbr 4131  ℝcr 8184   < clt 8366
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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-pre-ltirr 8297
This proof depends on definitions:  df-bi 117  df-dc 847  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 4132  df-opab 4194  df-xp 4782  df-pnf 8368  df-mnf 8369  df-ltxr 8371
This theorem is used by:  dcapnconstALT  17319
  Copyright terms: Public domain W3C validator