| 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 42984 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 780 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → 𝑦 ∈ ℝ) | |
| 3 | simplrr 787 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → (𝐵 + 𝑦) = 𝐴) | |
| 4 | 3 | eqcomd 2770 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐴 = (𝐵 + 𝑦)) |
| 5 | 4 | eqeq2d 2775 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ (𝐵 + 𝑥) = (𝐵 + 𝑦))) |
| 6 | simpr 488 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
| 7 | simplrl 786 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑦 ∈ ℝ) | |
| 8 | renegeulemv.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 9 | 8 | ad2antrr 736 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐵 ∈ ℝ) |
| 10 | readdcan 11359 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) | |
| 11 | 6, 7, 9, 10 | syl3anc 1392 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) |
| 12 | 5, 11 | bitrd 281 | . . . 4 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
| 13 | 12 | ralrimiva 3156 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
| 14 | reu6i 3693 | . . 3 ⊢ ((𝑦 ∈ ℝ ∧ ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) | |
| 15 | 2, 13, 14 | syl2anc 593 | . 2 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
| 16 | 1, 15 | rexlimddv 3171 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1562 ∈ wcel 2144 ∀wral 3078 ∃wrex 3088 ∃!wreu 3367 (class class class)co 7398 ℝcr 11074 + caddc 11078 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-resscn 11132 ax-addrcl 11136 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-po 5557 df-so 5558 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-ov 7401 df-er 8680 df-en 8930 df-dom 8931 df-sdom 8932 df-pnf 11220 df-mnf 11221 df-ltxr 11223 |
| This theorem is referenced by: renegeulem 42983 |
| Copyright terms: Public domain | W3C validator |