| 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 1023 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 2 | simp3 1025 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
| 3 | subcl 8378 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ) | |
| 4 | 3 | 3adant1 1041 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ) |
| 5 | 1, 2, 4 | adddid 8204 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐶 + (𝐵 − 𝐶))) = ((𝐴 · 𝐶) + (𝐴 · (𝐵 − 𝐶)))) |
| 6 | pncan3 8387 | . . . . . . 7 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐶 + (𝐵 − 𝐶)) = 𝐵) | |
| 7 | 6 | ancoms 268 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐶 + (𝐵 − 𝐶)) = 𝐵) |
| 8 | 7 | 3adant1 1041 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐶 + (𝐵 − 𝐶)) = 𝐵) |
| 9 | 8 | oveq2d 6034 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐶 + (𝐵 − 𝐶))) = (𝐴 · 𝐵)) |
| 10 | 5, 9 | eqtr3d 2266 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐶) + (𝐴 · (𝐵 − 𝐶))) = (𝐴 · 𝐵)) |
| 11 | mulcl 8159 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ) | |
| 12 | 11 | 3adant3 1043 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ) |
| 13 | mulcl 8159 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐶) ∈ ℂ) | |
| 14 | 13 | 3adant2 1042 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐶) ∈ ℂ) |
| 15 | mulcl 8159 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 − 𝐶) ∈ ℂ) → (𝐴 · (𝐵 − 𝐶)) ∈ ℂ) | |
| 16 | 3, 15 | sylan2 286 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → (𝐴 · (𝐵 − 𝐶)) ∈ ℂ) |
| 17 | 16 | 3impb 1225 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 − 𝐶)) ∈ ℂ) |
| 18 | 12, 14, 17 | subaddd 8508 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 · 𝐵) − (𝐴 · 𝐶)) = (𝐴 · (𝐵 − 𝐶)) ↔ ((𝐴 · 𝐶) + (𝐴 · (𝐵 − 𝐶))) = (𝐴 · 𝐵))) |
| 19 | 10, 18 | mpbird 167 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) − (𝐴 · 𝐶)) = (𝐴 · (𝐵 − 𝐶))) |
| 20 | 19 | eqcomd 2237 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 − 𝐶)) = ((𝐴 · 𝐵) − (𝐴 · 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 (class class class)co 6018 ℂcc 8030 + caddc 8035 · cmul 8037 − cmin 8350 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-setind 4635 ax-resscn 8124 ax-1cn 8125 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-sub 8352 |
| This theorem is referenced by: subdir 8565 subdii 8586 subdid 8593 expubnd 10859 subsq 10909 cos01bnd 12324 modmulconst 12389 odd2np1 12439 omoe 12462 omeo 12464 phiprmpw 12799 pythagtriplem14 12855 |
| Copyright terms: Public domain | W3C validator |