![]() |
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 10625 | . . 3 ⊢ (𝜑 → 1 ∈ ℂ) | |
3 | adddirp1d.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
4 | 1, 2, 3 | adddird 10655 | . 2 ⊢ (𝜑 → ((𝐴 + 1) · 𝐵) = ((𝐴 · 𝐵) + (1 · 𝐵))) |
5 | 3 | mulid2d 10648 | . . 3 ⊢ (𝜑 → (1 · 𝐵) = 𝐵) |
6 | 5 | oveq2d 7151 | . 2 ⊢ (𝜑 → ((𝐴 · 𝐵) + (1 · 𝐵)) = ((𝐴 · 𝐵) + 𝐵)) |
7 | 4, 6 | eqtrd 2833 | 1 ⊢ (𝜑 → ((𝐴 + 1) · 𝐵) = ((𝐴 · 𝐵) + 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 (class class class)co 7135 ℂcc 10524 1c1 10527 + caddc 10529 · cmul 10531 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-mulcl 10588 ax-mulcom 10590 ax-mulass 10592 ax-distr 10593 ax-1rid 10596 ax-cnre 10599 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ral 3111 df-rex 3112 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 |
This theorem is referenced by: modvalp1 13253 pcexp 16186 mulgnnass 18254 cnfldmulg 20123 dgrcolem1 24870 abelthlem2 25027 2lgsoddprmlem3d 25997 chpdifbndlem1 26137 breprexplemc 32013 fltnltalem 39618 lt3addmuld 41933 lt4addmuld 41938 itgsinexp 42597 fourierdlem19 42768 fourierdlem35 42784 fourierdlem51 42799 |
Copyright terms: Public domain | W3C validator |