| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > subsub2 | Structured version Visualization version GIF version | ||
| Description: Law for double subtraction. (Contributed by NM, 30-Jun-2005.) (Revised by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| subsub2 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵 − 𝐶)) = (𝐴 + (𝐶 − 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subcl 11457 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ) | |
| 2 | 1 | 3adant1 1148 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ) |
| 3 | simp1 1154 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 4 | simp3 1156 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
| 5 | simp2 1155 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 6 | subcl 11457 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐶 − 𝐵) ∈ ℂ) | |
| 7 | 4, 5, 6 | syl2anc 595 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐶 − 𝐵) ∈ ℂ) |
| 8 | 2, 3, 7 | add12d 11438 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + (𝐴 + (𝐶 − 𝐵))) = (𝐴 + ((𝐵 − 𝐶) + (𝐶 − 𝐵)))) |
| 9 | npncan2 11486 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + (𝐶 − 𝐵)) = 0) | |
| 10 | 9 | 3adant1 1148 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + (𝐶 − 𝐵)) = 0) |
| 11 | 10 | oveq2d 7428 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + ((𝐵 − 𝐶) + (𝐶 − 𝐵))) = (𝐴 + 0)) |
| 12 | 3 | addridd 11411 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + 0) = 𝐴) |
| 13 | 8, 11, 12 | 3eqtrd 2802 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + (𝐴 + (𝐶 − 𝐵))) = 𝐴) |
| 14 | 3, 7 | addcld 11229 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + (𝐶 − 𝐵)) ∈ ℂ) |
| 15 | subadd 11461 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 − 𝐶) ∈ ℂ ∧ (𝐴 + (𝐶 − 𝐵)) ∈ ℂ) → ((𝐴 − (𝐵 − 𝐶)) = (𝐴 + (𝐶 − 𝐵)) ↔ ((𝐵 − 𝐶) + (𝐴 + (𝐶 − 𝐵))) = 𝐴)) | |
| 16 | 3, 2, 14, 15 | syl3anc 1398 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − (𝐵 − 𝐶)) = (𝐴 + (𝐶 − 𝐵)) ↔ ((𝐵 − 𝐶) + (𝐴 + (𝐶 − 𝐵))) = 𝐴)) |
| 17 | 13, 16 | mpbird 260 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵 − 𝐶)) = (𝐴 + (𝐶 − 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 (class class class)co 7412 ℂcc 11099 0cc0 11101 + caddc 11104 − cmin 11442 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 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 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-ltxr 11249 df-sub 11444 |
| This theorem is referenced by: nncan 11488 subsub 11489 subsub3 11491 ppncan 11501 subadd4 11503 subsub2d 11599 divalglem9 16460 ax5seglem7 29263 areaquad 43923 sub31 45989 |
| Copyright terms: Public domain | W3C validator |