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 7102 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) = (𝐵 · 𝐴)) | |
2 | 1 | oveq1d 5547 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = ((𝐵 · 𝐴) · 𝐶)) |
3 | 2 | 3adant3 958 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = ((𝐵 · 𝐴) · 𝐶)) |
4 | mulass 7104 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = (𝐴 · (𝐵 · 𝐶))) | |
5 | mulass 7104 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 · 𝐴) · 𝐶) = (𝐵 · (𝐴 · 𝐶))) | |
6 | 5 | 3com12 1142 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 · 𝐴) · 𝐶) = (𝐵 · (𝐴 · 𝐶))) |
7 | 3, 4, 6 | 3eqtr3d 2121 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 · 𝐶)) = (𝐵 · (𝐴 · 𝐶))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ∧ w3a 919 = wceq 1284 ∈ wcel 1433 (class class class)co 5532 ℂcc 6979 · cmul 6986 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-mulcom 7077 ax-mulass 7079 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-rex 2354 df-v 2603 df-un 2977 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-br 3786 df-iota 4887 df-fv 4930 df-ov 5535 |
This theorem is referenced by: mul12i 7254 mul12d 7260 mulreap 9751 dvdscmul 10222 dvdstr 10232 |
Copyright terms: Public domain | W3C validator |