| Mathbox for Stanislas Polu |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > int-rightdistd | Structured version Visualization version GIF version | ||
| Description: AdditionMultiplicationRightDistribution generator rule. (Contributed by Stanislas Polu, 7-Apr-2020.) |
| Ref | Expression |
|---|---|
| int-rightdistd.1 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| int-rightdistd.2 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| int-rightdistd.3 | ⊢ (𝜑 → 𝐷 ∈ ℝ) |
| int-rightdistd.4 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| int-rightdistd | ⊢ (𝜑 → (𝐵 · (𝐶 + 𝐷)) = ((𝐴 · 𝐶) + (𝐴 · 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | int-rightdistd.1 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 2 | 1 | recnd 11308 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 3 | int-rightdistd.2 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 4 | 3 | recnd 11308 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 5 | int-rightdistd.3 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ ℝ) | |
| 6 | 5 | recnd 11308 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ℂ) |
| 7 | 4, 6 | addcld 11299 | . . 3 ⊢ (𝜑 → (𝐶 + 𝐷) ∈ ℂ) |
| 8 | 2, 7 | mulcomd 11301 | . 2 ⊢ (𝜑 → (𝐵 · (𝐶 + 𝐷)) = ((𝐶 + 𝐷) · 𝐵)) |
| 9 | 4, 2 | mulcomd 11301 | . . . . 5 ⊢ (𝜑 → (𝐶 · 𝐵) = (𝐵 · 𝐶)) |
| 10 | int-rightdistd.4 | . . . . . . 7 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 11 | 10 | eqcomd 2766 | . . . . . 6 ⊢ (𝜑 → 𝐵 = 𝐴) |
| 12 | 11 | oveq1d 7423 | . . . . 5 ⊢ (𝜑 → (𝐵 · 𝐶) = (𝐴 · 𝐶)) |
| 13 | 9, 12 | eqtrd 2795 | . . . 4 ⊢ (𝜑 → (𝐶 · 𝐵) = (𝐴 · 𝐶)) |
| 14 | 6, 2 | mulcomd 11301 | . . . . 5 ⊢ (𝜑 → (𝐷 · 𝐵) = (𝐵 · 𝐷)) |
| 15 | 11 | oveq1d 7423 | . . . . 5 ⊢ (𝜑 → (𝐵 · 𝐷) = (𝐴 · 𝐷)) |
| 16 | 14, 15 | eqtrd 2795 | . . . 4 ⊢ (𝜑 → (𝐷 · 𝐵) = (𝐴 · 𝐷)) |
| 17 | 13, 16 | oveq12d 7426 | . . 3 ⊢ (𝜑 → ((𝐶 · 𝐵) + (𝐷 · 𝐵)) = ((𝐴 · 𝐶) + (𝐴 · 𝐷))) |
| 18 | 4, 2, 6, 17 | joinlmuladdmuld 11307 | . 2 ⊢ (𝜑 → ((𝐶 + 𝐷) · 𝐵) = ((𝐴 · 𝐶) + (𝐴 · 𝐷))) |
| 19 | 8, 18 | eqtrd 2795 | 1 ⊢ (𝜑 → (𝐵 · (𝐶 + 𝐷)) = ((𝐴 · 𝐶) + (𝐴 · 𝐷))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 (class class class)co 7408 ℝcr 11170 + caddc 11174 · cmul 11176 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-resscn 11228 ax-addcl 11231 ax-mulcom 11235 ax-distr 11238 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-iota 6483 df-fv 6535 df-ov 7411 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |