| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subdi | GIF version | ||
| Description: Distribution of multiplication over subtraction. Theorem I.5 of [Apostol] p. 18. (Contributed by NM, 18-Nov-2004.) |
| Ref | Expression |
|---|---|
| subdi | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 − 𝐶)) = ((𝐴 · 𝐵) − (𝐴 · 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1028 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 2 | simp3 1030 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
| 3 | subcl 8519 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ) | |
| 4 | 3 | 3adant1 1046 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ) |
| 5 | 1, 2, 4 | adddid 8344 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐶 + (𝐵 − 𝐶))) = ((𝐴 · 𝐶) + (𝐴 · (𝐵 − 𝐶)))) |
| 6 | pncan3 8528 | . . . . . . 7 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐶 + (𝐵 − 𝐶)) = 𝐵) | |
| 7 | 6 | ancoms 268 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐶 + (𝐵 − 𝐶)) = 𝐵) |
| 8 | 7 | 3adant1 1046 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐶 + (𝐵 − 𝐶)) = 𝐵) |
| 9 | 8 | oveq2d 6095 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐶 + (𝐵 − 𝐶))) = (𝐴 · 𝐵)) |
| 10 | 5, 9 | eqtr3d 2273 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐶) + (𝐴 · (𝐵 − 𝐶))) = (𝐴 · 𝐵)) |
| 11 | mulcl 8300 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ) | |
| 12 | 11 | 3adant3 1048 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ) |
| 13 | mulcl 8300 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐶) ∈ ℂ) | |
| 14 | 13 | 3adant2 1047 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐶) ∈ ℂ) |
| 15 | mulcl 8300 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 − 𝐶) ∈ ℂ) → (𝐴 · (𝐵 − 𝐶)) ∈ ℂ) | |
| 16 | 3, 15 | sylan2 286 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → (𝐴 · (𝐵 − 𝐶)) ∈ ℂ) |
| 17 | 16 | 3impb 1230 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 − 𝐶)) ∈ ℂ) |
| 18 | 12, 14, 17 | subaddd 8649 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 · 𝐵) − (𝐴 · 𝐶)) = (𝐴 · (𝐵 − 𝐶)) ↔ ((𝐴 · 𝐶) + (𝐴 · (𝐵 − 𝐶))) = (𝐴 · 𝐵))) |
| 19 | 10, 18 | mpbird 167 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) − (𝐴 · 𝐶)) = (𝐴 · (𝐵 − 𝐶))) |
| 20 | 19 | eqcomd 2244 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 − 𝐶)) = ((𝐴 · 𝐵) − (𝐴 · 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 (class class class)co 6079 ℂcc 8171 + caddc 8176 · cmul 8178 − cmin 8491 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-setind 4682 ax-resscn 8265 ax-1cn 8266 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-distr 8277 ax-i2m1 8278 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-br 4129 df-opab 4191 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-iota 5335 df-fun 5377 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-sub 8493 |
| This theorem is referenced by: subdir 8707 subdii 8728 subdid 8735 expubnd 11016 subsq 11066 cos01bnd 12508 modmulconst 12573 odd2np1 12623 omoe 12646 omeo 12648 phiprmpw 12983 pythagtriplem14 13039 |
| Copyright terms: Public domain | W3C validator |