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

Theorem elrealeu 7630
Description: The real number mapping in elreal 7629 is unique. (Contributed by Jim Kingdon, 11-Jul-2021.)
Assertion
Ref Expression
elrealeu (𝐴 ∈ ℝ ↔ ∃!𝑥R𝑥, 0R⟩ = 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem elrealeu
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 elreal 7629 . . . 4 (𝐴 ∈ ℝ ↔ ∃𝑥R𝑥, 0R⟩ = 𝐴)
21biimpi 119 . . 3 (𝐴 ∈ ℝ → ∃𝑥R𝑥, 0R⟩ = 𝐴)
3 eqtr3 2157 . . . . . . . 8 ((⟨𝑥, 0R⟩ = 𝐴 ∧ ⟨𝑦, 0R⟩ = 𝐴) → ⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩)
4 0r 7551 . . . . . . . . . 10 0RR
5 opthg 4155 . . . . . . . . . 10 ((𝑥R ∧ 0RR) → (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ↔ (𝑥 = 𝑦 ∧ 0R = 0R)))
64, 5mpan2 421 . . . . . . . . 9 (𝑥R → (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ↔ (𝑥 = 𝑦 ∧ 0R = 0R)))
76ad2antlr 480 . . . . . . . 8 (((𝐴 ∈ ℝ ∧ 𝑥R) ∧ 𝑦R) → (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ↔ (𝑥 = 𝑦 ∧ 0R = 0R)))
83, 7syl5ib 153 . . . . . . 7 (((𝐴 ∈ ℝ ∧ 𝑥R) ∧ 𝑦R) → ((⟨𝑥, 0R⟩ = 𝐴 ∧ ⟨𝑦, 0R⟩ = 𝐴) → (𝑥 = 𝑦 ∧ 0R = 0R)))
9 simpl 108 . . . . . . 7 ((𝑥 = 𝑦 ∧ 0R = 0R) → 𝑥 = 𝑦)
108, 9syl6 33 . . . . . 6 (((𝐴 ∈ ℝ ∧ 𝑥R) ∧ 𝑦R) → ((⟨𝑥, 0R⟩ = 𝐴 ∧ ⟨𝑦, 0R⟩ = 𝐴) → 𝑥 = 𝑦))
1110ralrimiva 2503 . . . . 5 ((𝐴 ∈ ℝ ∧ 𝑥R) → ∀𝑦R ((⟨𝑥, 0R⟩ = 𝐴 ∧ ⟨𝑦, 0R⟩ = 𝐴) → 𝑥 = 𝑦))
1211ralrimiva 2503 . . . 4 (𝐴 ∈ ℝ → ∀𝑥R𝑦R ((⟨𝑥, 0R⟩ = 𝐴 ∧ ⟨𝑦, 0R⟩ = 𝐴) → 𝑥 = 𝑦))
13 opeq1 3700 . . . . . 6 (𝑥 = 𝑦 → ⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩)
1413eqeq1d 2146 . . . . 5 (𝑥 = 𝑦 → (⟨𝑥, 0R⟩ = 𝐴 ↔ ⟨𝑦, 0R⟩ = 𝐴))
1514rmo4 2872 . . . 4 (∃*𝑥R𝑥, 0R⟩ = 𝐴 ↔ ∀𝑥R𝑦R ((⟨𝑥, 0R⟩ = 𝐴 ∧ ⟨𝑦, 0R⟩ = 𝐴) → 𝑥 = 𝑦))
1612, 15sylibr 133 . . 3 (𝐴 ∈ ℝ → ∃*𝑥R𝑥, 0R⟩ = 𝐴)
17 reu5 2641 . . 3 (∃!𝑥R𝑥, 0R⟩ = 𝐴 ↔ (∃𝑥R𝑥, 0R⟩ = 𝐴 ∧ ∃*𝑥R𝑥, 0R⟩ = 𝐴))
182, 16, 17sylanbrc 413 . 2 (𝐴 ∈ ℝ → ∃!𝑥R𝑥, 0R⟩ = 𝐴)
19 reurex 2642 . . 3 (∃!𝑥R𝑥, 0R⟩ = 𝐴 → ∃𝑥R𝑥, 0R⟩ = 𝐴)
2019, 1sylibr 133 . 2 (∃!𝑥R𝑥, 0R⟩ = 𝐴𝐴 ∈ ℝ)
2118, 20impbii 125 1 (𝐴 ∈ ℝ ↔ ∃!𝑥R𝑥, 0R⟩ = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1331  wcel 1480  wral 2414  wrex 2415  ∃!wreu 2416  ∃*wrmo 2417  cop 3525  Rcnr 7098  0Rc0r 7099  cr 7612
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rmo 2422  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-eprel 4206  df-id 4210  df-po 4213  df-iso 4214  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-1o 6306  df-oadd 6310  df-omul 6311  df-er 6422  df-ec 6424  df-qs 6428  df-ni 7105  df-pli 7106  df-mi 7107  df-lti 7108  df-plpq 7145  df-mpq 7146  df-enq 7148  df-nqqs 7149  df-plqqs 7150  df-mqqs 7151  df-1nqqs 7152  df-rq 7153  df-ltnqqs 7154  df-inp 7267  df-i1p 7268  df-enr 7527  df-nr 7528  df-0r 7532  df-r 7623
This theorem is referenced by:  axcaucvglemcl  7696  axcaucvglemval  7698
  Copyright terms: Public domain W3C validator