| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > renegeulemv | Structured version Visualization version GIF version | ||
| Description: Lemma for renegeu 43209 and similar. Derive existential uniqueness from existence. (Contributed by Steven Nguyen, 28-Jan-2023.) |
| Ref | Expression |
|---|---|
| renegeulemv.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| renegeulemv.1 | ⊢ (𝜑 → ∃𝑦 ∈ ℝ (𝐵 + 𝑦) = 𝐴) |
| Ref | Expression |
|---|---|
| renegeulemv | ⊢ (𝜑 → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | renegeulemv.1 | . 2 ⊢ (𝜑 → ∃𝑦 ∈ ℝ (𝐵 + 𝑦) = 𝐴) | |
| 2 | simprl 783 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → 𝑦 ∈ ℝ) | |
| 3 | simplrr 790 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → (𝐵 + 𝑦) = 𝐴) | |
| 4 | 3 | eqcomd 2771 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐴 = (𝐵 + 𝑦)) |
| 5 | 4 | eqeq2d 2776 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ (𝐵 + 𝑥) = (𝐵 + 𝑦))) |
| 6 | simpr 490 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
| 7 | simplrl 789 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑦 ∈ ℝ) | |
| 8 | renegeulemv.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 9 | 8 | ad2antrr 739 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐵 ∈ ℝ) |
| 10 | readdcan 11404 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) | |
| 11 | 6, 7, 9, 10 | syl3anc 1398 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) |
| 12 | 5, 11 | bitrd 282 | . . . 4 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
| 13 | 12 | ralrimiva 3159 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
| 14 | reu6i 3693 | . . 3 ⊢ ((𝑦 ∈ ℝ ∧ ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) | |
| 15 | 2, 13, 14 | syl2anc 596 | . 2 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
| 16 | 1, 15 | rexlimddv 3174 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ∃wrex 3091 ∃!wreu 3369 (class class class)co 7420 ℝcr 11119 + caddc 11123 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7743 ax-resscn 11177 ax-addrcl 11181 ax-pre-lttri 11194 ax-pre-lttrn 11195 ax-pre-ltadd 11196 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6497 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-ov 7423 df-er 8701 df-en 8951 df-dom 8952 df-sdom 8953 df-pnf 11265 df-mnf 11266 df-ltxr 11268 |
| This theorem is used by: renegeulem 43208 |
| Copyright terms: Public domain | W3C validator |