| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > submul2 | GIF version | ||
| Description: Convert a subtraction to addition using multiplication by a negative. (Contributed by NM, 2-Feb-2007.) |
| Ref | Expression |
|---|---|
| submul2 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵 · 𝐶)) = (𝐴 + (𝐵 · -𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mulneg2 8475 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 · -𝐶) = -(𝐵 · 𝐶)) | |
| 2 | 1 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → (𝐵 · -𝐶) = -(𝐵 · 𝐶)) |
| 3 | 2 | oveq2d 5967 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → (𝐴 + (𝐵 · -𝐶)) = (𝐴 + -(𝐵 · 𝐶))) |
| 4 | mulcl 8059 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 · 𝐶) ∈ ℂ) | |
| 5 | negsub 8327 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 · 𝐶) ∈ ℂ) → (𝐴 + -(𝐵 · 𝐶)) = (𝐴 − (𝐵 · 𝐶))) | |
| 6 | 4, 5 | sylan2 286 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → (𝐴 + -(𝐵 · 𝐶)) = (𝐴 − (𝐵 · 𝐶))) |
| 7 | 3, 6 | eqtr2d 2240 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → (𝐴 − (𝐵 · 𝐶)) = (𝐴 + (𝐵 · -𝐶))) |
| 8 | 7 | 3impb 1202 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵 · 𝐶)) = (𝐴 + (𝐵 · -𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∈ wcel 2177 (class class class)co 5951 ℂcc 7930 + caddc 7935 · cmul 7937 − cmin 8250 -cneg 8251 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-14 2180 ax-ext 2188 ax-sep 4166 ax-pow 4222 ax-pr 4257 ax-setind 4589 ax-resscn 8024 ax-1cn 8025 ax-icn 8027 ax-addcl 8028 ax-addrcl 8029 ax-mulcl 8030 ax-addcom 8032 ax-mulcom 8033 ax-addass 8034 ax-distr 8036 ax-i2m1 8037 ax-0id 8040 ax-rnegex 8041 ax-cnre 8043 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3000 df-dif 3169 df-un 3171 df-in 3173 df-ss 3180 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-br 4048 df-opab 4110 df-id 4344 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-iota 5237 df-fun 5278 df-fv 5284 df-riota 5906 df-ov 5954 df-oprab 5955 df-mpo 5956 df-sub 8252 df-neg 8253 |
| This theorem is referenced by: cjap 11261 |
| Copyright terms: Public domain | W3C validator |