Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > clmvscom | Structured version Visualization version GIF version |
Description: Commutative law for the scalar product. (Contributed by NM, 14-Feb-2008.) (Revised by AV, 7-Oct-2021.) |
Ref | Expression |
---|---|
clmvscl.v | ⊢ 𝑉 = (Base‘𝑊) |
clmvscl.f | ⊢ 𝐹 = (Scalar‘𝑊) |
clmvscl.s | ⊢ · = ( ·𝑠 ‘𝑊) |
clmvscl.k | ⊢ 𝐾 = (Base‘𝐹) |
Ref | Expression |
---|---|
clmvscom | ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → (𝑄 · (𝑅 · 𝑋)) = (𝑅 · (𝑄 · 𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssel 3961 | . . . . . . . 8 ⊢ (𝐾 ⊆ ℂ → (𝑄 ∈ 𝐾 → 𝑄 ∈ ℂ)) | |
2 | ssel 3961 | . . . . . . . 8 ⊢ (𝐾 ⊆ ℂ → (𝑅 ∈ 𝐾 → 𝑅 ∈ ℂ)) | |
3 | 1, 2 | anim12d 610 | . . . . . . 7 ⊢ (𝐾 ⊆ ℂ → ((𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) → (𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ))) |
4 | clmvscl.f | . . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊) | |
5 | clmvscl.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹) | |
6 | 4, 5 | clmsscn 23683 | . . . . . . 7 ⊢ (𝑊 ∈ ℂMod → 𝐾 ⊆ ℂ) |
7 | 3, 6 | syl11 33 | . . . . . 6 ⊢ ((𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) → (𝑊 ∈ ℂMod → (𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ))) |
8 | 7 | 3adant3 1128 | . . . . 5 ⊢ ((𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝑊 ∈ ℂMod → (𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ))) |
9 | 8 | impcom 410 | . . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → (𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ)) |
10 | mulcom 10623 | . . . 4 ⊢ ((𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ) → (𝑄 · 𝑅) = (𝑅 · 𝑄)) | |
11 | 9, 10 | syl 17 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → (𝑄 · 𝑅) = (𝑅 · 𝑄)) |
12 | 11 | oveq1d 7171 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 · 𝑅) · 𝑋) = ((𝑅 · 𝑄) · 𝑋)) |
13 | clmvscl.v | . . 3 ⊢ 𝑉 = (Base‘𝑊) | |
14 | clmvscl.s | . . 3 ⊢ · = ( ·𝑠 ‘𝑊) | |
15 | 13, 4, 14, 5 | clmvsass 23693 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 · 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
16 | 3ancoma 1094 | . . 3 ⊢ ((𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) ↔ (𝑅 ∈ 𝐾 ∧ 𝑄 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) | |
17 | 13, 4, 14, 5 | clmvsass 23693 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑄 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑄) · 𝑋) = (𝑅 · (𝑄 · 𝑋))) |
18 | 16, 17 | sylan2b 595 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑄) · 𝑋) = (𝑅 · (𝑄 · 𝑋))) |
19 | 12, 15, 18 | 3eqtr3d 2864 | 1 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → (𝑄 · (𝑅 · 𝑋)) = (𝑅 · (𝑄 · 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ⊆ wss 3936 ‘cfv 6355 (class class class)co 7156 ℂcc 10535 · cmul 10542 Basecbs 16483 Scalarcsca 16568 ·𝑠 cvsca 16569 ℂModcclm 23666 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-mulf 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 df-9 11708 df-n0 11899 df-z 11983 df-dec 12100 df-uz 12245 df-fz 12894 df-struct 16485 df-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-ress 16491 df-plusg 16578 df-mulr 16579 df-starv 16580 df-tset 16584 df-ple 16585 df-ds 16587 df-unif 16588 df-subrg 19533 df-lmod 19636 df-cnfld 20546 df-clm 23667 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |