Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mul32 | GIF version |
Description: Commutative/associative law. (Contributed by NM, 8-Oct-1999.) |
Ref | Expression |
---|---|
mul32 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = ((𝐴 · 𝐶) · 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mulcom 7882 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) | |
2 | 1 | oveq2d 5858 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 · 𝐶)) = (𝐴 · (𝐶 · 𝐵))) |
3 | 2 | 3adant1 1005 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 · 𝐶)) = (𝐴 · (𝐶 · 𝐵))) |
4 | mulass 7884 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = (𝐴 · (𝐵 · 𝐶))) | |
5 | mulass 7884 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · 𝐶) · 𝐵) = (𝐴 · (𝐶 · 𝐵))) | |
6 | 5 | 3com23 1199 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐶) · 𝐵) = (𝐴 · (𝐶 · 𝐵))) |
7 | 3, 4, 6 | 3eqtr4d 2208 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = ((𝐴 · 𝐶) · 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 968 = wceq 1343 ∈ wcel 2136 (class class class)co 5842 ℂcc 7751 · cmul 7758 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 ax-mulcom 7854 ax-mulass 7856 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-rex 2450 df-v 2728 df-un 3120 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-iota 5153 df-fv 5196 df-ov 5845 |
This theorem is referenced by: mul4 8030 mul32i 8045 mul32d 8051 muldvds1 11756 2sqlem6 13606 |
Copyright terms: Public domain | W3C validator |