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 10583 | . . . 4 ⊢ 1 ∈ ℂ | |
2 | addcl 10607 | . . . 4 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (1 + 𝐴) ∈ ℂ) | |
3 | 1, 2 | mpan 686 | . . 3 ⊢ (𝐴 ∈ ℂ → (1 + 𝐴) ∈ ℂ) |
4 | adddi 10614 | . . . 4 ⊢ (((1 + 𝐴) ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵))) | |
5 | 1, 4 | mp3an2 1440 | . . 3 ⊢ (((1 + 𝐴) ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵))) |
6 | 3, 5 | sylan 580 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵))) |
7 | 3 | mulid1d 10646 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((1 + 𝐴) · 1) = (1 + 𝐴)) |
8 | 7 | adantr 481 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 1) = (1 + 𝐴)) |
9 | adddir 10620 | . . . . 5 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 𝐵) = ((1 · 𝐵) + (𝐴 · 𝐵))) | |
10 | 1, 9 | mp3an1 1439 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 𝐵) = ((1 · 𝐵) + (𝐴 · 𝐵))) |
11 | mulid2 10628 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (1 · 𝐵) = 𝐵) | |
12 | 11 | adantl 482 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (1 · 𝐵) = 𝐵) |
13 | 12 | oveq1d 7160 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 · 𝐵) + (𝐴 · 𝐵)) = (𝐵 + (𝐴 · 𝐵))) |
14 | 10, 13 | eqtrd 2853 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · 𝐵) = (𝐵 + (𝐴 · 𝐵))) |
15 | 8, 14 | oveq12d 7163 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((1 + 𝐴) · 1) + ((1 + 𝐴) · 𝐵)) = ((1 + 𝐴) + (𝐵 + (𝐴 · 𝐵)))) |
16 | 6, 15 | eqtrd 2853 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((1 + 𝐴) · (1 + 𝐵)) = ((1 + 𝐴) + (𝐵 + (𝐴 · 𝐵)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 (class class class)co 7145 ℂcc 10523 1c1 10526 + caddc 10528 · cmul 10530 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-mulcl 10587 ax-mulcom 10589 ax-mulass 10591 ax-distr 10592 ax-1rid 10595 ax-cnre 10598 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-iota 6307 df-fv 6356 df-ov 7148 |
This theorem is referenced by: muladd11r 10841 bernneq 13578 |
Copyright terms: Public domain | W3C validator |