| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mul12 | GIF version | ||
| Description: Commutative/associative law for multiplication. (Contributed by NM, 30-Apr-2005.) |
| Ref | Expression |
|---|---|
| mul12 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 · 𝐶)) = (𝐵 · (𝐴 · 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mulcom 8204 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) = (𝐵 · 𝐴)) | |
| 2 | 1 | oveq1d 6043 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = ((𝐵 · 𝐴) · 𝐶)) |
| 3 | 2 | 3adant3 1044 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = ((𝐵 · 𝐴) · 𝐶)) |
| 4 | mulass 8206 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = (𝐴 · (𝐵 · 𝐶))) | |
| 5 | mulass 8206 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 · 𝐴) · 𝐶) = (𝐵 · (𝐴 · 𝐶))) | |
| 6 | 5 | 3com12 1234 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 · 𝐴) · 𝐶) = (𝐵 · (𝐴 · 𝐶))) |
| 7 | 3, 4, 6 | 3eqtr3d 2272 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 · 𝐶)) = (𝐵 · (𝐴 · 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 (class class class)co 6028 ℂcc 8073 · cmul 8080 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 ax-mulcom 8176 ax-mulass 8178 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-rex 2517 df-v 2805 df-un 3205 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-iota 5293 df-fv 5341 df-ov 6031 |
| This theorem is referenced by: mul12i 8368 mul12d 8374 mulreap 11485 demoivre 12395 demoivreALT 12396 dvdscmul 12440 dvdstr 12450 sinperlem 15599 coskpi 15639 |
| Copyright terms: Public domain | W3C validator |