| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ipassi | 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 |
|---|---|
| ip1i.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| ip1i.2 | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
| ip1i.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| ip1i.7 | ⊢ 𝑃 = (·𝑖OLD‘𝑈) |
| ip1i.9 | ⊢ 𝑈 ∈ CPreHilOLD |
| Ref | Expression |
|---|---|
| ipassi | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 7448 | . . . . . . 7 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → (𝐴𝑆𝐵) = (𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))) | |
| 2 | 1 | oveq1d 7455 | . . . . . 6 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → ((𝐴𝑆𝐵)𝑃𝐶) = ((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶)) |
| 3 | oveq1 7447 | . . . . . . 7 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → (𝐵𝑃𝐶) = (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶)) | |
| 4 | 3 | oveq2d 7456 | . . . . . 6 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → (𝐴 · (𝐵𝑃𝐶)) = (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶))) |
| 5 | 2, 4 | eqeq12d 2779 | . . . . 5 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → (((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶)) ↔ ((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶) = (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶)))) |
| 6 | 5 | imbi2d 343 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → ((𝐴 ∈ ℂ → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶))) ↔ (𝐴 ∈ ℂ → ((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶) = (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶))))) |
| 7 | oveq2 7448 | . . . . . 6 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → ((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶) = ((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)))) | |
| 8 | oveq2 7448 | . . . . . . 7 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶) = (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)))) | |
| 9 | 8 | oveq2d 7456 | . . . . . 6 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶)) = (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))))) |
| 10 | 7, 9 | eqeq12d 2779 | . . . . 5 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → (((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶) = (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶)) ↔ ((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))) = (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)))))) |
| 11 | 10 | imbi2d 343 | . . . 4 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → ((𝐴 ∈ ℂ → ((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶) = (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶))) ↔ (𝐴 ∈ ℂ → ((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))) = (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))))))) |
| 12 | ip1i.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 13 | ip1i.2 | . . . . 5 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 14 | ip1i.4 | . . . . 5 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 15 | ip1i.7 | . . . . 5 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
| 16 | ip1i.9 | . . . . 5 ⊢ 𝑈 ∈ CPreHilOLD | |
| 17 | eqid 2763 | . . . . . 6 ⊢ (0vec‘𝑈) = (0vec‘𝑈) | |
| 18 | 12, 17, 16 | elimph 31449 | . . . . 5 ⊢ if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) ∈ 𝑋 |
| 19 | 12, 17, 16 | elimph 31449 | . . . . 5 ⊢ if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) ∈ 𝑋 |
| 20 | 12, 13, 14, 15, 16, 18, 19 | ipasslem11 31469 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((𝐴𝑆if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))) = (𝐴 · (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))))) |
| 21 | 6, 11, 20 | dedth2h 4545 | . . 3 ⊢ ((𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴 ∈ ℂ → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶)))) |
| 22 | 21 | com12 33 | . 2 ⊢ (𝐴 ∈ ℂ → ((𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶)))) |
| 23 | 22 | 3impib 1134 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑆𝐵)𝑃𝐶) = (𝐴 · (𝐵𝑃𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ifcif 4485 ‘cfv 6555 (class class class)co 7440 ℂcc 11222 · cmul 11229 +𝑣 cpv 31214 BaseSetcba 31215 ·𝑠OLD cns 31216 0veccn0v 31217 ·𝑖OLDcdip 31329 CPreHilOLDccphlo 31441 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-inf2 9666 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 ax-pre-sup 11302 ax-addf 11303 ax-mulf 11304 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-isom 6564 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-of 7714 df-om 7899 df-1st 8022 df-2nd 8023 df-supp 8202 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-2o 8502 df-er 8742 df-map 8874 df-ixp 8951 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-fsupp 9379 df-fi 9427 df-sup 9458 df-inf 9459 df-oi 9528 df-card 10044 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-div 11998 df-nn 12360 df-2 12429 df-3 12430 df-4 12431 df-5 12432 df-6 12433 df-7 12434 df-8 12435 df-9 12436 df-n0 12631 df-z 12718 df-dec 12839 df-uz 12990 df-q 13100 df-rp 13145 df-xneg 13265 df-xadd 13266 df-xmul 13267 df-ioo 13504 df-icc 13507 df-fz 13664 df-fzo 13813 df-seq 14169 df-exp 14229 df-hash 14499 df-cj 15292 df-re 15293 df-im 15294 df-sqrt 15428 df-abs 15429 df-clim 15681 df-sum 15880 df-struct 17351 df-sets 17368 df-slot 17386 df-ndx 17398 df-base 17414 df-ress 17435 df-plusg 17467 df-mulr 17468 df-starv 17469 df-sca 17470 df-vsca 17471 df-ip 17472 df-tset 17473 df-ple 17474 df-ds 17476 df-unif 17477 df-hom 17478 df-cco 17479 df-rest 17619 df-topn 17620 df-0g 17638 df-gsum 17639 df-topgen 17640 df-pt 17641 df-prds 17644 df-xrs 17700 df-qtop 17705 df-imas 17706 df-xps 17708 df-mre 17782 df-mrc 17783 df-acs 17785 df-mgm 18842 df-sgrp 18934 df-mnd 18950 df-submnd 19005 df-mulg 19304 df-cntz 19558 df-cmn 20023 df-psmet 21697 df-xmet 21698 df-met 21699 df-bl 21700 df-mopn 21701 df-cnfld 21706 df-top 23239 df-topon 23256 df-topsp 23278 df-bases 23291 df-cld 23364 df-ntr 23365 df-cls 23366 df-cn 23572 df-cnp 23573 df-t1 23659 df-haus 23660 df-tx 23908 df-hmeo 24101 df-xms 24666 df-ms 24667 df-tms 24668 df-grpo 31122 df-gid 31123 df-ginv 31124 df-gdiv 31125 df-ablo 31174 df-vc 31188 df-nv 31221 df-va 31224 df-ba 31225 df-sm 31226 df-0v 31227 df-vs 31228 df-nmcv 31229 df-ims 31230 df-dip 31330 df-ph 31442 |
| This theorem is used by: dipass 31474 ipblnfi 31484 |
| Copyright terms: Public domain | W3C validator |