| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elrealeu | GIF version | ||
| Description: The real number mapping in elreal 8201 is unique. (Contributed by Jim Kingdon, 11-Jul-2021.) |
| Ref | Expression |
|---|---|
| elrealeu | ⊢ (𝐴 ∈ ℝ ↔ ∃!𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elreal 8201 | . . . 4 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) | |
| 2 | 1 | biimpi 120 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) |
| 3 | eqtr3 2258 | . . . . . . . 8 ⊢ ((〈𝑥, 0R〉 = 𝐴 ∧ 〈𝑦, 0R〉 = 𝐴) → 〈𝑥, 0R〉 = 〈𝑦, 0R〉) | |
| 4 | 0r 8123 | . . . . . . . . . 10 ⊢ 0R ∈ R | |
| 5 | opthg 4380 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ R ∧ 0R ∈ R) → (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ↔ (𝑥 = 𝑦 ∧ 0R = 0R))) | |
| 6 | 4, 5 | mpan2 429 | . . . . . . . . 9 ⊢ (𝑥 ∈ R → (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ↔ (𝑥 = 𝑦 ∧ 0R = 0R))) |
| 7 | 6 | ad2antlr 493 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝑥 ∈ R) ∧ 𝑦 ∈ R) → (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ↔ (𝑥 = 𝑦 ∧ 0R = 0R))) |
| 8 | 3, 7 | imbitrid 154 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝑥 ∈ R) ∧ 𝑦 ∈ R) → ((〈𝑥, 0R〉 = 𝐴 ∧ 〈𝑦, 0R〉 = 𝐴) → (𝑥 = 𝑦 ∧ 0R = 0R))) |
| 9 | simpl 109 | . . . . . . 7 ⊢ ((𝑥 = 𝑦 ∧ 0R = 0R) → 𝑥 = 𝑦) | |
| 10 | 8, 9 | syl6 33 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝑥 ∈ R) ∧ 𝑦 ∈ R) → ((〈𝑥, 0R〉 = 𝐴 ∧ 〈𝑦, 0R〉 = 𝐴) → 𝑥 = 𝑦)) |
| 11 | 10 | ralrimiva 2623 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ R) → ∀𝑦 ∈ R ((〈𝑥, 0R〉 = 𝐴 ∧ 〈𝑦, 0R〉 = 𝐴) → 𝑥 = 𝑦)) |
| 12 | 11 | ralrimiva 2623 | . . . 4 ⊢ (𝐴 ∈ ℝ → ∀𝑥 ∈ R ∀𝑦 ∈ R ((〈𝑥, 0R〉 = 𝐴 ∧ 〈𝑦, 0R〉 = 𝐴) → 𝑥 = 𝑦)) |
| 13 | opeq1 3904 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 〈𝑥, 0R〉 = 〈𝑦, 0R〉) | |
| 14 | 13 | eqeq1d 2247 | . . . . 5 ⊢ (𝑥 = 𝑦 → (〈𝑥, 0R〉 = 𝐴 ↔ 〈𝑦, 0R〉 = 𝐴)) |
| 15 | 14 | rmo4 3019 | . . . 4 ⊢ (∃*𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴 ↔ ∀𝑥 ∈ R ∀𝑦 ∈ R ((〈𝑥, 0R〉 = 𝐴 ∧ 〈𝑦, 0R〉 = 𝐴) → 𝑥 = 𝑦)) |
| 16 | 12, 15 | sylibr 134 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃*𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) |
| 17 | reu5 2770 | . . 3 ⊢ (∃!𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴 ↔ (∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴 ∧ ∃*𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴)) | |
| 18 | 2, 16, 17 | sylanbrc 421 | . 2 ⊢ (𝐴 ∈ ℝ → ∃!𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) |
| 19 | reurex 2771 | . . 3 ⊢ (∃!𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴 → ∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) | |
| 20 | 19, 1 | sylibr 134 | . 2 ⊢ (∃!𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴 → 𝐴 ∈ ℝ) |
| 21 | 18, 20 | impbii 126 | 1 ⊢ (𝐴 ∈ ℝ ↔ ∃!𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∀wral 2528 ∃wrex 2529 ∃!wreu 2530 ∃*wrmo 2531 〈cop 3712 Rcnr 7670 0Rc0r 7671 ℝcr 8184 |
| 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-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 |
| 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-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-eprel 4436 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-1o 6691 df-oadd 6695 df-omul 6696 df-er 6811 df-ec 6813 df-qs 6817 df-ni 7677 df-pli 7678 df-mi 7679 df-lti 7680 df-plpq 7717 df-mpq 7718 df-enq 7720 df-nqqs 7721 df-plqqs 7722 df-mqqs 7723 df-1nqqs 7724 df-rq 7725 df-ltnqqs 7726 df-inp 7839 df-i1p 7840 df-enr 8099 df-nr 8100 df-0r 8104 df-r 8195 |
| This theorem is used by: axcaucvglemcl 8268 axcaucvglemval 8270 |
| Copyright terms: Public domain | W3C validator |