| 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 11087 | . . . 4 ⊢ 1 ∈ ℂ | |
| 2 | addcl 11111 | . . . 4 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (1 + 𝐴) ∈ ℂ) | |
| 3 | 1, 2 | mpan 696 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 + 𝐴) ∈ ℂ) |
| 4 | adddi 11118 | . . . 4 ⊢ (((1 + 𝐴) ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵))) | |
| 5 | 1, 4 | mp3an2 1457 | . . 3 ⊢ (((1 + 𝐴) ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵))) |
| 6 | 3, 5 | sylan 586 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵))) |
| 7 | 3 | mulridd 11153 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((1 + 𝐴) · 1) = (1 + 𝐴)) |
| 8 | 7 | adantr 481 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 1) = (1 + 𝐴)) |
| 9 | adddir 11126 | . . . . 5 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 𝐵) = ((1 · 𝐵) + (𝐴 · 𝐵))) | |
| 10 | 1, 9 | mp3an1 1456 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 𝐵) = ((1 · 𝐵) + (𝐴 · 𝐵))) |
| 11 | mullid 11134 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (1 · 𝐵) = 𝐵) | |
| 12 | 11 | adantl 482 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (1 · 𝐵) = 𝐵) |
| 13 | 12 | oveq1d 7371 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 · 𝐵) + (𝐴 · 𝐵)) = (𝐵 + (𝐴 · 𝐵))) |
| 14 | 10, 13 | eqtrd 2774 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 𝐵) = (𝐵 + (𝐴 · 𝐵))) |
| 15 | 8, 14 | oveq12d 7374 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵)) = ((1 + 𝐴) + (𝐵 + (𝐴 · 𝐵)))) |
| 16 | 6, 15 | eqtrd 2774 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = ((1 + 𝐴) + (𝐵 + (𝐴 · 𝐵)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 (class class class)co 7356 ℂcc 11027 1c1 11030 + caddc 11032 · cmul 11034 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-mulcl 11091 ax-mulcom 11093 ax-mulass 11095 ax-distr 11096 ax-1rid 11099 ax-cnre 11102 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-iota 6441 df-fv 6493 df-ov 7359 |
| This theorem is referenced by: muladd11r 11350 bernneq 14182 |
| Copyright terms: Public domain | W3C validator |