| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dipass | Structured version Visualization version GIF version | ||
| Description: Associative law for inner product. Equation I2 of [Ponnusamy] p. 363. (Contributed by NM, 25-Aug-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ipass.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| ipass.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| ipass.7 | ⊢ 𝑃 = (·𝑖OLD‘𝑈) |
| Ref | Expression |
|---|---|
| dipass | ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ipass.1 | . . . . . . 7 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 2 | fveq2 6829 | . . . . . . 7 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (BaseSet‘𝑈) = (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))) | |
| 3 | 1, 2 | eqtrid 2782 | . . . . . 6 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → 𝑋 = (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))) |
| 4 | 3 | eleq2d 2821 | . . . . 5 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (𝐵 ∈ 𝑋 ↔ 𝐵 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)))) |
| 5 | 3 | eleq2d 2821 | . . . . 5 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (𝐶 ∈ 𝑋 ↔ 𝐶 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)))) |
| 6 | 4, 5 | 3anbi23d 1442 | . . . 4 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → ((𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) ↔ (𝐴 ∈ ℂ ∧ 𝐵 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) ∧ 𝐶 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))))) |
| 7 | ipass.4 | . . . . . . . . 9 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 8 | fveq2 6829 | . . . . . . . . 9 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))) | |
| 9 | 7, 8 | eqtrid 2782 | . . . . . . . 8 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → 𝑆 = ( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))) |
| 10 | 9 | oveqd 7373 | . . . . . . 7 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (𝐴𝑆𝐵) = (𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)) |
| 11 | 10 | oveq1d 7371 | . . . . . 6 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → ((𝐴𝑆𝐵)𝑃𝐶) = ((𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)𝑃𝐶)) |
| 12 | ipass.7 | . . . . . . . 8 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
| 13 | fveq2 6829 | . . . . . . . 8 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (·𝑖OLD‘𝑈) = (·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))) | |
| 14 | 12, 13 | eqtrid 2782 | . . . . . . 7 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → 𝑃 = (·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))) |
| 15 | 14 | oveqd 7373 | . . . . . 6 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → ((𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)𝑃𝐶) = ((𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶)) |
| 16 | 11, 15 | eqtrd 2770 | . . . . 5 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → ((𝐴𝑆𝐵)𝑃𝐶) = ((𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶)) |
| 17 | 14 | oveqd 7373 | . . . . . 6 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (𝐵𝑃𝐶) = (𝐵(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶)) |
| 18 | 17 | oveq2d 7372 | . . . . 5 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (𝐴 · (𝐵𝑃𝐶)) = (𝐴 · (𝐵(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶))) |
| 19 | 16, 18 | eqeq12d 2751 | . . . 4 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶)) ↔ ((𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶) = (𝐴 · (𝐵(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶)))) |
| 20 | 6, 19 | imbi12d 344 | . . 3 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (((𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶))) ↔ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) ∧ 𝐶 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))) → ((𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶) = (𝐴 · (𝐵(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶))))) |
| 21 | eqid 2735 | . . . 4 ⊢ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) = (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) | |
| 22 | eqid 2735 | . . . 4 ⊢ ( +𝑣 ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) = ( +𝑣 ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) | |
| 23 | eqid 2735 | . . . 4 ⊢ ( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) = ( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) | |
| 24 | eqid 2735 | . . . 4 ⊢ (·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) = (·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) | |
| 25 | elimphu 30880 | . . . 4 ⊢ if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) ∈ CPreHilOLD | |
| 26 | 21, 22, 23, 24, 25 | ipassi 30900 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) ∧ 𝐶 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))) → ((𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶) = (𝐴 · (𝐵(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶))) |
| 27 | 20, 26 | dedth 4515 | . 2 ⊢ (𝑈 ∈ CPreHilOLD → ((𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶)))) |
| 28 | 27 | imp 406 | 1 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ifcif 4456 〈cop 4563 ‘cfv 6487 (class class class)co 7356 ℂcc 11025 + caddc 11030 · cmul 11032 abscabs 15185 +𝑣 cpv 30644 BaseSetcba 30645 ·𝑠OLD cns 30646 ·𝑖OLDcdip 30759 CPreHilOLDccphlo 30871 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 ax-inf2 9551 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-pre-sup 11105 ax-addf 11106 ax-mulf 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-rmo 3340 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-iin 4926 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-se 5574 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-isom 6496 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8100 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-2o 8395 df-er 8632 df-map 8764 df-ixp 8835 df-en 8883 df-dom 8884 df-sdom 8885 df-fin 8886 df-fsupp 9264 df-fi 9313 df-sup 9344 df-inf 9345 df-oi 9414 df-card 9852 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12164 df-2 12233 df-3 12234 df-4 12235 df-5 12236 df-6 12237 df-7 12238 df-8 12239 df-9 12240 df-n0 12427 df-z 12514 df-dec 12634 df-uz 12778 df-q 12888 df-rp 12932 df-xneg 13052 df-xadd 13053 df-xmul 13054 df-ioo 13291 df-icc 13294 df-fz 13451 df-fzo 13598 df-seq 13953 df-exp 14013 df-hash 14282 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-clim 15439 df-sum 15638 df-struct 17106 df-sets 17123 df-slot 17141 df-ndx 17153 df-base 17169 df-ress 17190 df-plusg 17222 df-mulr 17223 df-starv 17224 df-sca 17225 df-vsca 17226 df-ip 17227 df-tset 17228 df-ple 17229 df-ds 17231 df-unif 17232 df-hom 17233 df-cco 17234 df-rest 17374 df-topn 17375 df-0g 17393 df-gsum 17394 df-topgen 17395 df-pt 17396 df-prds 17399 df-xrs 17455 df-qtop 17460 df-imas 17461 df-xps 17463 df-mre 17537 df-mrc 17538 df-acs 17540 df-mgm 18597 df-sgrp 18676 df-mnd 18692 df-submnd 18741 df-mulg 19033 df-cntz 19281 df-cmn 19746 df-psmet 21333 df-xmet 21334 df-met 21335 df-bl 21336 df-mopn 21337 df-cnfld 21342 df-top 22847 df-topon 22864 df-topsp 22886 df-bases 22899 df-cld 22972 df-ntr 22973 df-cls 22974 df-cn 23180 df-cnp 23181 df-t1 23267 df-haus 23268 df-tx 23515 df-hmeo 23708 df-xms 24273 df-ms 24274 df-tms 24275 df-grpo 30552 df-gid 30553 df-ginv 30554 df-gdiv 30555 df-ablo 30604 df-vc 30618 df-nv 30651 df-va 30654 df-ba 30655 df-sm 30656 df-0v 30657 df-vs 30658 df-nmcv 30659 df-ims 30660 df-dip 30760 df-ph 30872 |
| This theorem is referenced by: dipassr 30905 dipsubdir 30907 siilem1 30910 hlipass 30972 |
| Copyright terms: Public domain | W3C validator |