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 3963 | . . . . . . . 8 ⊢ (𝐾 ⊆ ℂ → (𝑄 ∈ 𝐾 → 𝑄 ∈ ℂ)) | |
2 | ssel 3963 | . . . . . . . 8 ⊢ (𝐾 ⊆ ℂ → (𝑅 ∈ 𝐾 → 𝑅 ∈ ℂ)) | |
3 | 1, 2 | anim12d 610 | . . . . . . 7 ⊢ (𝐾 ⊆ ℂ → ((𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) → (𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ))) |
4 | clmvscl.f | . . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊) | |
5 | clmvscl.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹) | |
6 | 4, 5 | clmsscn 23685 | . . . . . . 7 ⊢ (𝑊 ∈ ℂMod → 𝐾 ⊆ ℂ) |
7 | 3, 6 | syl11 33 | . . . . . 6 ⊢ ((𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) → (𝑊 ∈ ℂMod → (𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ))) |
8 | 7 | 3adant3 1128 | . . . . 5 ⊢ ((𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝑊 ∈ ℂMod → (𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ))) |
9 | 8 | impcom 410 | . . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → (𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ)) |
10 | mulcom 10625 | . . . 4 ⊢ ((𝑄 ∈ ℂ ∧ 𝑅 ∈ ℂ) → (𝑄 · 𝑅) = (𝑅 · 𝑄)) | |
11 | 9, 10 | syl 17 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → (𝑄 · 𝑅) = (𝑅 · 𝑄)) |
12 | 11 | oveq1d 7173 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 · 𝑅) · 𝑋) = ((𝑅 · 𝑄) · 𝑋)) |
13 | clmvscl.v | . . 3 ⊢ 𝑉 = (Base‘𝑊) | |
14 | clmvscl.s | . . 3 ⊢ · = ( ·𝑠 ‘𝑊) | |
15 | 13, 4, 14, 5 | clmvsass 23695 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 · 𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋))) |
16 | 3ancoma 1094 | . . 3 ⊢ ((𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) ↔ (𝑅 ∈ 𝐾 ∧ 𝑄 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) | |
17 | 13, 4, 14, 5 | clmvsass 23695 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑄 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑄) · 𝑋) = (𝑅 · (𝑄 · 𝑋))) |
18 | 16, 17 | sylan2b 595 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑄) · 𝑋) = (𝑅 · (𝑄 · 𝑋))) |
19 | 12, 15, 18 | 3eqtr3d 2866 | 1 ⊢ ((𝑊 ∈ ℂMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → (𝑄 · (𝑅 · 𝑋)) = (𝑅 · (𝑄 · 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ⊆ wss 3938 ‘cfv 6357 (class class class)co 7158 ℂcc 10537 · cmul 10544 Basecbs 16485 Scalarcsca 16570 ·𝑠 cvsca 16571 ℂModcclm 23668 |
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 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-mulf 10619 |
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 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-fz 12896 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-ress 16493 df-plusg 16580 df-mulr 16581 df-starv 16582 df-tset 16586 df-ple 16587 df-ds 16589 df-unif 16590 df-subrg 19535 df-lmod 19638 df-cnfld 20548 df-clm 23669 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |