Mathbox for Stanislas Polu |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > int-mulassocd | Structured version Visualization version GIF version |
Description: MultiplicationAssociativity generator rule. (Contributed by Stanislas Polu, 7-Apr-2020.) |
Ref | Expression |
---|---|
int-mulassocd.1 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
int-mulassocd.2 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
int-mulassocd.3 | ⊢ (𝜑 → 𝐷 ∈ ℝ) |
int-mulassocd.4 | ⊢ (𝜑 → 𝐴 = 𝐵) |
Ref | Expression |
---|---|
int-mulassocd | ⊢ (𝜑 → (𝐵 · (𝐶 · 𝐷)) = ((𝐴 · 𝐶) · 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | int-mulassocd.1 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
2 | 1 | recnd 10663 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
3 | int-mulassocd.2 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
4 | 3 | recnd 10663 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
5 | int-mulassocd.3 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ℝ) | |
6 | 5 | recnd 10663 | . . 3 ⊢ (𝜑 → 𝐷 ∈ ℂ) |
7 | 2, 4, 6 | mulassd 10658 | . 2 ⊢ (𝜑 → ((𝐵 · 𝐶) · 𝐷) = (𝐵 · (𝐶 · 𝐷))) |
8 | int-mulassocd.4 | . . . . 5 ⊢ (𝜑 → 𝐴 = 𝐵) | |
9 | 8 | eqcomd 2827 | . . . 4 ⊢ (𝜑 → 𝐵 = 𝐴) |
10 | 9 | oveq1d 7165 | . . 3 ⊢ (𝜑 → (𝐵 · 𝐶) = (𝐴 · 𝐶)) |
11 | 10 | oveq1d 7165 | . 2 ⊢ (𝜑 → ((𝐵 · 𝐶) · 𝐷) = ((𝐴 · 𝐶) · 𝐷)) |
12 | 7, 11 | eqtr3d 2858 | 1 ⊢ (𝜑 → (𝐵 · (𝐶 · 𝐷)) = ((𝐴 · 𝐶) · 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 (class class class)co 7150 ℝcr 10530 · cmul 10536 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-resscn 10588 ax-mulass 10597 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-iota 6308 df-fv 6357 df-ov 7153 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |