| 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 43687 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 2769 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐴 = (𝐵 + 𝑦)) |
| 5 | 4 | eqeq2d 2774 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ (𝐵 + 𝑥) = (𝐵 + 𝑦))) |
| 6 | simpr 490 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
| 7 | simplrl 789 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑦 ∈ ℝ) | |
| 8 | renegeulemv.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 9 | 8 | ad2antrr 739 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐵 ∈ ℝ) |
| 10 | readdcan 11523 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) | |
| 11 | 6, 7, 9, 10 | syl3anc 1399 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) |
| 12 | 5, 11 | bitrd 282 | . . . 4 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
| 13 | 12 | ralrimiva 3158 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
| 14 | reu6i 3689 | . . 3 ⊢ ((𝑦 ∈ ℝ ∧ ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) | |
| 15 | 2, 13, 14 | syl2anc 596 | . 2 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
| 16 | 1, 15 | rexlimddv 3173 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 ∃!wreu 3367 (class class class)co 7451 ℝcr 11238 + caddc 11242 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-addrcl 11300 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-ltxr 11387 |
| This theorem is used by: renegeulem 43686 |
| Copyright terms: Public domain | W3C validator |