| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > subadd | Structured version Visualization version GIF version | ||
| Description: Relationship between subtraction and addition. (Contributed by NM, 20-Jan-1997.) (Revised by Mario Carneiro, 21-Dec-2013.) |
| Ref | Expression |
|---|---|
| subadd | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐵 + 𝐶) = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subval 11551 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴)) | |
| 2 | 1 | eqeq1d 2762 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 3 | 2 | 3adant3 1150 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 4 | negeu 11550 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) | |
| 5 | oveq2 7428 | . . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝐵 + 𝑥) = (𝐵 + 𝐶)) | |
| 6 | 5 | eqeq1d 2762 | . . . . . 6 ⊢ (𝑥 = 𝐶 → ((𝐵 + 𝑥) = 𝐴 ↔ (𝐵 + 𝐶) = 𝐴)) |
| 7 | 6 | riota2 7402 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 8 | 4, 7 | sylan2 605 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ)) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 9 | 8 | 3impb 1132 | . . 3 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 10 | 9 | 3com13 1142 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 11 | 3, 10 | bitr4d 285 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐵 + 𝐶) = 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∃!wreu 3363 ℩crio 7376 (class class class)co 7420 ℂcc 11201 + caddc 11206 − cmin 11544 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-pnf 11348 df-mnf 11349 df-ltxr 11351 df-sub 11546 |
| This theorem is used by: subadd2 11564 subsub23 11565 pncan 11566 pncan3 11568 addsubeq4 11575 subsub2 11589 renegcli 11622 subaddi 11648 subaddd 11690 fzen 13677 nn0ennn 14125 hashssdif 14560 cos2t 16351 cos2tsin 16352 odd2np1 16516 divalglem4 16571 divalglem8 16575 divalgb 16579 mplmonmul 22350 sincosq1eq 26846 coskpi 26856 sto2i 32844 psrmonmul 34228 tan2h 38628 poimirlem31 38662 fdc 38772 fppr2odd 48922 |
| Copyright terms: Public domain | W3C validator |