| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > muladd11 | Structured version Visualization version GIF version | ||
| Description: A simple product of sums expansion. (Contributed by NM, 21-Feb-2005.) |
| Ref | Expression |
|---|---|
| muladd11 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = ((1 + 𝐴) + (𝐵 + (𝐴 · 𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-1cn 11125 | . . . 4 ⊢ 1 ∈ ℂ | |
| 2 | addcl 11149 | . . . 4 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (1 + 𝐴) ∈ ℂ) | |
| 3 | 1, 2 | mpan 700 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 + 𝐴) ∈ ℂ) |
| 4 | adddi 11156 | . . . 4 ⊢ (((1 + 𝐴) ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵))) | |
| 5 | 1, 4 | mp3an2 1469 | . . 3 ⊢ (((1 + 𝐴) ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵))) |
| 6 | 3, 5 | sylan 589 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵))) |
| 7 | 3 | mulridd 11193 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((1 + 𝐴) · 1) = (1 + 𝐴)) |
| 8 | 7 | adantr 484 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 1) = (1 + 𝐴)) |
| 9 | adddir 11164 | . . . . 5 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 𝐵) = ((1 · 𝐵) + (𝐴 · 𝐵))) | |
| 10 | 1, 9 | mp3an1 1468 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 𝐵) = ((1 · 𝐵) + (𝐴 · 𝐵))) |
| 11 | mullid 11174 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (1 · 𝐵) = 𝐵) | |
| 12 | 11 | adantl 485 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (1 · 𝐵) = 𝐵) |
| 13 | 12 | oveq1d 7406 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 · 𝐵) + (𝐴 · 𝐵)) = (𝐵 + (𝐴 · 𝐵))) |
| 14 | 10, 13 | eqtrd 2796 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 𝐵) = (𝐵 + (𝐴 · 𝐵))) |
| 15 | 8, 14 | oveq12d 7409 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵)) = ((1 + 𝐴) + (𝐵 + (𝐴 · 𝐵)))) |
| 16 | 6, 15 | eqtrd 2796 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = ((1 + 𝐴) + (𝐵 + (𝐴 · 𝐵)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 (class class class)co 7391 ℂcc 11065 1c1 11068 + caddc 11070 · cmul 11072 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-mulcl 11129 ax-mulcom 11131 ax-mulass 11133 ax-distr 11134 ax-1rid 11137 ax-cnre 11140 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-iota 6472 df-fv 6524 df-ov 7394 |
| This theorem is referenced by: muladd11r 11390 bernneq 14236 |
| Copyright terms: Public domain | W3C validator |