| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mul32d | GIF version | ||
| Description: Commutative/associative law that swaps the last two factors in a triple product. (Contributed by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| muld.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| addcomd.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| mul12d.3 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| Ref | Expression |
|---|---|
| mul32d | ⊢ (𝜑 → ((𝐴 · 𝐵) · 𝐶) = ((𝐴 · 𝐶) · 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | muld.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
| 2 | addcomd.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
| 3 | mul12d.3 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 4 | mul32 8467 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = ((𝐴 · 𝐶) · 𝐵)) | |
| 5 | 1, 2, 3, 4 | syl3anc 1278 | 1 ⊢ (𝜑 → ((𝐴 · 𝐵) · 𝐶) = ((𝐴 · 𝐶) · 𝐵)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 (class class class)co 6091 ℂcc 8187 · cmul 8194 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 ax-mulcom 8290 ax-mulass 8292 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-rex 2534 df-v 2823 df-un 3224 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4132 df-iota 5343 df-fv 5391 df-ov 6094 |
| This theorem is used by: conjmulap 9071 modqmul1 10838 binom3 11118 bernneq 11122 bcm1k 11223 bcp1n 11224 resqrexlemcalc1 11805 resqrexlemnm 11809 reccn2ap 12107 binomlem 12278 tanaddap 12534 eirraplem 12572 dvds2ln 12619 divgcdcoprm0 12907 modprm0 13065 binom4 16270 bcmono 16355 gausslemma2d 16444 lgsquadlem1 16452 2lgslem3b 16469 2lgslem3c 16470 2lgslem3d 16471 |
| Copyright terms: Public domain | W3C validator |