| 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 42820 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 771 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → 𝑦 ∈ ℝ) | |
| 3 | simplrr 778 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → (𝐵 + 𝑦) = 𝐴) | |
| 4 | 3 | eqcomd 2743 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐴 = (𝐵 + 𝑦)) |
| 5 | 4 | eqeq2d 2748 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ (𝐵 + 𝑥) = (𝐵 + 𝑦))) |
| 6 | simpr 484 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
| 7 | simplrl 777 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑦 ∈ ℝ) | |
| 8 | renegeulemv.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 9 | 8 | ad2antrr 727 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐵 ∈ ℝ) |
| 10 | readdcan 11315 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) | |
| 11 | 6, 7, 9, 10 | syl3anc 1374 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) |
| 12 | 5, 11 | bitrd 279 | . . . 4 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
| 13 | 12 | ralrimiva 3130 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
| 14 | reu6i 3675 | . . 3 ⊢ ((𝑦 ∈ ℝ ∧ ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) | |
| 15 | 2, 13, 14 | syl2anc 585 | . 2 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
| 16 | 1, 15 | rexlimddv 3145 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 ∃!wreu 3341 (class class class)co 7362 ℝcr 11032 + caddc 11036 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-resscn 11090 ax-addrcl 11094 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5521 df-po 5534 df-so 5535 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-ov 7365 df-er 8638 df-en 8889 df-dom 8890 df-sdom 8891 df-pnf 11176 df-mnf 11177 df-ltxr 11179 |
| This theorem is referenced by: renegeulem 42819 |
| Copyright terms: Public domain | W3C validator |