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 39206 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 769 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → 𝑦 ∈ ℝ) | |
3 | simplrr 776 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → (𝐵 + 𝑦) = 𝐴) | |
4 | 3 | eqcomd 2830 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐴 = (𝐵 + 𝑦)) |
5 | 4 | eqeq2d 2835 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ (𝐵 + 𝑥) = (𝐵 + 𝑦))) |
6 | simpr 487 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
7 | simplrl 775 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝑦 ∈ ℝ) | |
8 | renegeulemv.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
9 | 8 | ad2antrr 724 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → 𝐵 ∈ ℝ) |
10 | readdcan 10817 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) | |
11 | 6, 7, 9, 10 | syl3anc 1367 | . . . . 5 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = (𝐵 + 𝑦) ↔ 𝑥 = 𝑦)) |
12 | 5, 11 | bitrd 281 | . . . 4 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) ∧ 𝑥 ∈ ℝ) → ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
13 | 12 | ralrimiva 3185 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) |
14 | reu6i 3722 | . . 3 ⊢ ((𝑦 ∈ ℝ ∧ ∀𝑥 ∈ ℝ ((𝐵 + 𝑥) = 𝐴 ↔ 𝑥 = 𝑦)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) | |
15 | 2, 13, 14 | syl2anc 586 | . 2 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ (𝐵 + 𝑦) = 𝐴)) → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
16 | 1, 15 | rexlimddv 3294 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ ℝ (𝐵 + 𝑥) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∀wral 3141 ∃wrex 3142 ∃!wreu 3143 (class class class)co 7159 ℝcr 10539 + caddc 10543 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-resscn 10597 ax-addrcl 10601 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-po 5477 df-so 5478 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7162 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-ltxr 10683 |
This theorem is referenced by: renegeulem 39205 |
Copyright terms: Public domain | W3C validator |