Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mul4i | Structured version Visualization version GIF version |
Description: Rearrangement of 4 factors. (Contributed by NM, 16-Feb-1995.) |
Ref | Expression |
---|---|
mul.1 | ⊢ 𝐴 ∈ ℂ |
mul.2 | ⊢ 𝐵 ∈ ℂ |
mul.3 | ⊢ 𝐶 ∈ ℂ |
mul4.4 | ⊢ 𝐷 ∈ ℂ |
Ref | Expression |
---|---|
mul4i | ⊢ ((𝐴 · 𝐵) · (𝐶 · 𝐷)) = ((𝐴 · 𝐶) · (𝐵 · 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mul.1 | . 2 ⊢ 𝐴 ∈ ℂ | |
2 | mul.2 | . 2 ⊢ 𝐵 ∈ ℂ | |
3 | mul.3 | . 2 ⊢ 𝐶 ∈ ℂ | |
4 | mul4.4 | . 2 ⊢ 𝐷 ∈ ℂ | |
5 | mul4 11223 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 · 𝐵) · (𝐶 · 𝐷)) = ((𝐴 · 𝐶) · (𝐵 · 𝐷))) | |
6 | 1, 2, 3, 4, 5 | mp4an 690 | 1 ⊢ ((𝐴 · 𝐵) · (𝐶 · 𝐷)) = ((𝐴 · 𝐶) · (𝐵 · 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1540 ∈ wcel 2105 (class class class)co 7317 ℂcc 10949 · cmul 10956 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2708 ax-mulcl 11013 ax-mulcom 11015 ax-mulass 11017 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-sb 2067 df-clab 2715 df-cleq 2729 df-clel 2815 df-rab 3405 df-v 3443 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4268 df-if 4472 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4851 df-br 5088 df-iota 6418 df-fv 6474 df-ov 7320 |
This theorem is referenced by: faclbnd4lem1 14087 bposlem8 26522 normlem1 29608 dpmul 31322 dpmul4 31323 |
Copyright terms: Public domain | W3C validator |