| 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 6876 | . . . . . . 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 2820 | . . . . 5 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (𝐵 ∈ 𝑋 ↔ 𝐵 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)))) |
| 5 | 3 | eleq2d 2820 | . . . . 5 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (𝐶 ∈ 𝑋 ↔ 𝐶 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)))) |
| 6 | 4, 5 | 3anbi23d 1441 | . . . 4 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → ((𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) ↔ (𝐴 ∈ ℂ ∧ 𝐵 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉)) ∧ 𝐶 ∈ (BaseSet‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))))) |
| 7 | ipass.4 | . . . . . . . . 9 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 8 | fveq2 6876 | . . . . . . . . 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 7422 | . . . . . . 7 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (𝐴𝑆𝐵) = (𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)) |
| 11 | 10 | oveq1d 7420 | . . . . . 6 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → ((𝐴𝑆𝐵)𝑃𝐶) = ((𝐴( ·𝑠OLD ‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐵)𝑃𝐶)) |
| 12 | ipass.7 | . . . . . . . 8 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
| 13 | fveq2 6876 | . . . . . . . 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 7422 | . . . . . 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 7422 | . . . . . 6 ⊢ (𝑈 = if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) → (𝐵𝑃𝐶) = (𝐵(·𝑖OLD‘if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉))𝐶)) |
| 18 | 17 | oveq2d 7421 | . . . . 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 30802 | . . . 4 ⊢ if(𝑈 ∈ CPreHilOLD, 𝑈, 〈〈 + , · 〉, abs〉) ∈ CPreHilOLD | |
| 26 | 21, 22, 23, 24, 25 | ipassi 30822 | . . 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 4559 | . 2 ⊢ (𝑈 ∈ CPreHilOLD → ((𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶)))) |
| 28 | 27 | imp 406 | 1 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ifcif 4500 〈cop 4607 ‘cfv 6531 (class class class)co 7405 ℂcc 11127 + caddc 11132 · cmul 11134 abscabs 15253 +𝑣 cpv 30566 BaseSetcba 30567 ·𝑠OLD cns 30568 ·𝑖OLDcdip 30681 CPreHilOLDccphlo 30793 |
| 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 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-inf2 9655 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 ax-addf 11208 ax-mulf 11209 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-tp 4606 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-iin 4970 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-of 7671 df-om 7862 df-1st 7988 df-2nd 7989 df-supp 8160 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-2o 8481 df-er 8719 df-map 8842 df-ixp 8912 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-fsupp 9374 df-fi 9423 df-sup 9454 df-inf 9455 df-oi 9524 df-card 9953 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12502 df-z 12589 df-dec 12709 df-uz 12853 df-q 12965 df-rp 13009 df-xneg 13128 df-xadd 13129 df-xmul 13130 df-ioo 13366 df-icc 13369 df-fz 13525 df-fzo 13672 df-seq 14020 df-exp 14080 df-hash 14349 df-cj 15118 df-re 15119 df-im 15120 df-sqrt 15254 df-abs 15255 df-clim 15504 df-sum 15703 df-struct 17166 df-sets 17183 df-slot 17201 df-ndx 17213 df-base 17229 df-ress 17252 df-plusg 17284 df-mulr 17285 df-starv 17286 df-sca 17287 df-vsca 17288 df-ip 17289 df-tset 17290 df-ple 17291 df-ds 17293 df-unif 17294 df-hom 17295 df-cco 17296 df-rest 17436 df-topn 17437 df-0g 17455 df-gsum 17456 df-topgen 17457 df-pt 17458 df-prds 17461 df-xrs 17516 df-qtop 17521 df-imas 17522 df-xps 17524 df-mre 17598 df-mrc 17599 df-acs 17601 df-mgm 18618 df-sgrp 18697 df-mnd 18713 df-submnd 18762 df-mulg 19051 df-cntz 19300 df-cmn 19763 df-psmet 21307 df-xmet 21308 df-met 21309 df-bl 21310 df-mopn 21311 df-cnfld 21316 df-top 22832 df-topon 22849 df-topsp 22871 df-bases 22884 df-cld 22957 df-ntr 22958 df-cls 22959 df-cn 23165 df-cnp 23166 df-t1 23252 df-haus 23253 df-tx 23500 df-hmeo 23693 df-xms 24259 df-ms 24260 df-tms 24261 df-grpo 30474 df-gid 30475 df-ginv 30476 df-gdiv 30477 df-ablo 30526 df-vc 30540 df-nv 30573 df-va 30576 df-ba 30577 df-sm 30578 df-0v 30579 df-vs 30580 df-nmcv 30581 df-ims 30582 df-dip 30682 df-ph 30794 |
| This theorem is referenced by: dipassr 30827 dipsubdir 30829 siilem1 30832 hlipass 30894 |
| Copyright terms: Public domain | W3C validator |