Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > adddirp1d | Structured version Visualization version GIF version |
Description: Distributive law, plus 1 version. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
Ref | Expression |
---|---|
adddirp1d.a | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
adddirp1d.b | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
Ref | Expression |
---|---|
adddirp1d | ⊢ (𝜑 → ((𝐴 + 1) · 𝐵) = ((𝐴 · 𝐵) + 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | adddirp1d.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
2 | 1cnd 9935 | . . 3 ⊢ (𝜑 → 1 ∈ ℂ) | |
3 | adddirp1d.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
4 | 1, 2, 3 | adddird 9944 | . 2 ⊢ (𝜑 → ((𝐴 + 1) · 𝐵) = ((𝐴 · 𝐵) + (1 · 𝐵))) |
5 | 3 | mulid2d 9937 | . . 3 ⊢ (𝜑 → (1 · 𝐵) = 𝐵) |
6 | 5 | oveq2d 6565 | . 2 ⊢ (𝜑 → ((𝐴 · 𝐵) + (1 · 𝐵)) = ((𝐴 · 𝐵) + 𝐵)) |
7 | 4, 6 | eqtrd 2644 | 1 ⊢ (𝜑 → ((𝐴 + 1) · 𝐵) = ((𝐴 · 𝐵) + 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 (class class class)co 6549 ℂcc 9813 1c1 9816 + caddc 9818 · cmul 9820 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-mulcl 9877 ax-mulcom 9879 ax-mulass 9881 ax-distr 9882 ax-1rid 9885 ax-cnre 9888 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-iota 5768 df-fv 5812 df-ov 6552 |
This theorem is referenced by: 2lgsoddprmlem3d 24938 lt3addmuld 38456 lt4addmuld 38461 itgsinexp 38846 fourierdlem19 39019 fourierdlem35 39035 fourierdlem51 39050 |
Copyright terms: Public domain | W3C validator |