Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cphassr | Structured version Visualization version GIF version |
Description: "Associative" law for second argument of inner product (compare cphass 23818). See ipassr 20793, his52 . (Contributed by Mario Carneiro, 16-Oct-2015.) |
Ref | Expression |
---|---|
cphipcj.h | ⊢ , = (·𝑖‘𝑊) |
cphipcj.v | ⊢ 𝑉 = (Base‘𝑊) |
cphass.f | ⊢ 𝐹 = (Scalar‘𝑊) |
cphass.k | ⊢ 𝐾 = (Base‘𝐹) |
cphass.s | ⊢ · = ( ·𝑠 ‘𝑊) |
Ref | Expression |
---|---|
cphassr | ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐵 , (𝐴 · 𝐶)) = ((∗‘𝐴) · (𝐵 , 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cphclm 23796 | . . . . 5 ⊢ (𝑊 ∈ ℂPreHil → 𝑊 ∈ ℂMod) | |
2 | 1 | adantr 483 | . . . 4 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ ℂMod) |
3 | cphass.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
4 | 3 | clmmul 23682 | . . . 4 ⊢ (𝑊 ∈ ℂMod → · = (.r‘𝐹)) |
5 | 2, 4 | syl 17 | . . 3 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → · = (.r‘𝐹)) |
6 | eqidd 2825 | . . 3 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐵 , 𝐶) = (𝐵 , 𝐶)) | |
7 | 3 | clmcj 23683 | . . . . 5 ⊢ (𝑊 ∈ ℂMod → ∗ = (*𝑟‘𝐹)) |
8 | 2, 7 | syl 17 | . . . 4 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ∗ = (*𝑟‘𝐹)) |
9 | 8 | fveq1d 6675 | . . 3 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (∗‘𝐴) = ((*𝑟‘𝐹)‘𝐴)) |
10 | 5, 6, 9 | oveq123d 7180 | . 2 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐵 , 𝐶) · (∗‘𝐴)) = ((𝐵 , 𝐶)(.r‘𝐹)((*𝑟‘𝐹)‘𝐴))) |
11 | cphass.k | . . . . . . 7 ⊢ 𝐾 = (Base‘𝐹) | |
12 | 3, 11 | clmsscn 23686 | . . . . . 6 ⊢ (𝑊 ∈ ℂMod → 𝐾 ⊆ ℂ) |
13 | 2, 12 | syl 17 | . . . . 5 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐾 ⊆ ℂ) |
14 | simpr1 1190 | . . . . 5 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝐾) | |
15 | 13, 14 | sseldd 3971 | . . . 4 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ ℂ) |
16 | 15 | cjcld 14558 | . . 3 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (∗‘𝐴) ∈ ℂ) |
17 | cphipcj.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
18 | cphipcj.h | . . . . 5 ⊢ , = (·𝑖‘𝑊) | |
19 | 17, 18 | cphipcl 23798 | . . . 4 ⊢ ((𝑊 ∈ ℂPreHil ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐵 , 𝐶) ∈ ℂ) |
20 | 19 | 3adant3r1 1178 | . . 3 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐵 , 𝐶) ∈ ℂ) |
21 | 16, 20 | mulcomd 10665 | . 2 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((∗‘𝐴) · (𝐵 , 𝐶)) = ((𝐵 , 𝐶) · (∗‘𝐴))) |
22 | cphphl 23778 | . . 3 ⊢ (𝑊 ∈ ℂPreHil → 𝑊 ∈ PreHil) | |
23 | 3anrot 1096 | . . . 4 ⊢ ((𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ↔ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ∈ 𝐾)) | |
24 | 23 | biimpi 218 | . . 3 ⊢ ((𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ∈ 𝐾)) |
25 | cphass.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
26 | eqid 2824 | . . . 4 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
27 | eqid 2824 | . . . 4 ⊢ (*𝑟‘𝐹) = (*𝑟‘𝐹) | |
28 | 3, 18, 17, 11, 25, 26, 27 | ipassr 20793 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ∈ 𝐾)) → (𝐵 , (𝐴 · 𝐶)) = ((𝐵 , 𝐶)(.r‘𝐹)((*𝑟‘𝐹)‘𝐴))) |
29 | 22, 24, 28 | syl2an 597 | . 2 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐵 , (𝐴 · 𝐶)) = ((𝐵 , 𝐶)(.r‘𝐹)((*𝑟‘𝐹)‘𝐴))) |
30 | 10, 21, 29 | 3eqtr4rd 2870 | 1 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐵 , (𝐴 · 𝐶)) = ((∗‘𝐴) · (𝐵 , 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1536 ∈ wcel 2113 ⊆ wss 3939 ‘cfv 6358 (class class class)co 7159 ℂcc 10538 · cmul 10545 ∗ccj 14458 Basecbs 16486 .rcmulr 16569 *𝑟cstv 16570 Scalarcsca 16571 ·𝑠 cvsca 16572 ·𝑖cip 16573 PreHilcphl 20771 ℂModcclm 23669 ℂPreHilccph 23773 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 ax-addf 10619 ax-mulf 10620 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-int 4880 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-tpos 7895 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-oadd 8109 df-er 8292 df-map 8411 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-div 11301 df-nn 11642 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-seq 13373 df-exp 13433 df-cj 14461 df-struct 16488 df-ndx 16489 df-slot 16490 df-base 16492 df-sets 16493 df-ress 16494 df-plusg 16581 df-mulr 16582 df-starv 16583 df-sca 16584 df-vsca 16585 df-ip 16586 df-tset 16587 df-ple 16588 df-ds 16590 df-unif 16591 df-0g 16718 df-mgm 17855 df-sgrp 17904 df-mnd 17915 df-mhm 17959 df-grp 18109 df-subg 18279 df-ghm 18359 df-cmn 18911 df-mgp 19243 df-ur 19255 df-ring 19302 df-cring 19303 df-oppr 19376 df-dvdsr 19394 df-unit 19395 df-rnghom 19470 df-drng 19507 df-subrg 19536 df-staf 19619 df-srng 19620 df-lmod 19639 df-lmhm 19797 df-lvec 19878 df-sra 19947 df-rgmod 19948 df-cnfld 20549 df-phl 20773 df-nlm 23199 df-clm 23670 df-cph 23775 |
This theorem is referenced by: cph2ass 23820 cphassir 23822 pjthlem1 24043 |
Copyright terms: Public domain | W3C validator |