| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ipassr2 | Structured version Visualization version GIF version | ||
| Description: "Associative" law for inner product. Conjugate version of ipassr 21953. (Contributed by NM, 25-Aug-2007.) (Revised by Mario Carneiro, 7-Oct-2015.) |
| Ref | Expression |
|---|---|
| phlsrng.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| phllmhm.h | ⊢ , = (·𝑖‘𝑊) |
| phllmhm.v | ⊢ 𝑉 = (Base‘𝑊) |
| ipdir.f | ⊢ 𝐾 = (Base‘𝐹) |
| ipass.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| ipass.p | ⊢ × = (.r‘𝐹) |
| ipassr.i | ⊢ ∗ = (*𝑟‘𝐹) |
| Ref | Expression |
|---|---|
| ipassr2 | ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → ((𝐴 , 𝐵) × 𝐶) = (𝐴 , (( ∗ ‘𝐶) · 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → 𝑊 ∈ PreHil) | |
| 2 | simpr1 1213 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → 𝐴 ∈ 𝑉) | |
| 3 | simpr2 1214 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → 𝐵 ∈ 𝑉) | |
| 4 | phlsrng.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 5 | 4 | phlsrng 21938 | . . . 4 ⊢ (𝑊 ∈ PreHil → 𝐹 ∈ *-Ring) |
| 6 | simpr3 1215 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → 𝐶 ∈ 𝐾) | |
| 7 | ipassr.i | . . . . 5 ⊢ ∗ = (*𝑟‘𝐹) | |
| 8 | ipdir.f | . . . . 5 ⊢ 𝐾 = (Base‘𝐹) | |
| 9 | 7, 8 | srngcl 21107 | . . . 4 ⊢ ((𝐹 ∈ *-Ring ∧ 𝐶 ∈ 𝐾) → ( ∗ ‘𝐶) ∈ 𝐾) |
| 10 | 5, 6, 9 | syl2an2r 698 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → ( ∗ ‘𝐶) ∈ 𝐾) |
| 11 | phllmhm.h | . . . 4 ⊢ , = (·𝑖‘𝑊) | |
| 12 | phllmhm.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 13 | ipass.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 14 | ipass.p | . . . 4 ⊢ × = (.r‘𝐹) | |
| 15 | 4, 11, 12, 8, 13, 14, 7 | ipassr 21953 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ ( ∗ ‘𝐶) ∈ 𝐾)) → (𝐴 , (( ∗ ‘𝐶) · 𝐵)) = ((𝐴 , 𝐵) × ( ∗ ‘( ∗ ‘𝐶)))) |
| 16 | 1, 2, 3, 10, 15 | syl13anc 1399 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → (𝐴 , (( ∗ ‘𝐶) · 𝐵)) = ((𝐴 , 𝐵) × ( ∗ ‘( ∗ ‘𝐶)))) |
| 17 | 7, 8 | srngnvl 21108 | . . . 4 ⊢ ((𝐹 ∈ *-Ring ∧ 𝐶 ∈ 𝐾) → ( ∗ ‘( ∗ ‘𝐶)) = 𝐶) |
| 18 | 5, 6, 17 | syl2an2r 698 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → ( ∗ ‘( ∗ ‘𝐶)) = 𝐶) |
| 19 | 18 | oveq2d 7436 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → ((𝐴 , 𝐵) × ( ∗ ‘( ∗ ‘𝐶))) = ((𝐴 , 𝐵) × 𝐶)) |
| 20 | 16, 19 | eqtr2d 2796 | 1 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝐾)) → ((𝐴 , 𝐵) × 𝐶) = (𝐴 , (( ∗ ‘𝐶) · 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ‘cfv 6538 (class class class)co 7420 Basecbs 17388 .rcmulr 17430 *𝑟cstv 17431 Scalarcsca 17432 ·𝑠 cvsca 17433 ·𝑖cip 17434 *-Ringcsr 21096 PreHilcphl 21931 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11257 ax-resscn 11258 ax-1cn 11259 ax-icn 11260 ax-addcl 11261 ax-addrcl 11262 ax-mulcl 11263 ax-mulrcl 11264 ax-mulcom 11265 ax-addass 11266 ax-mulass 11267 ax-distr 11268 ax-i2m1 11269 ax-1ne0 11270 ax-1rid 11271 ax-rnegex 11272 ax-rrecex 11273 ax-cnre 11274 ax-pre-lttri 11275 ax-pre-lttrn 11276 ax-pre-ltadd 11277 ax-pre-mulgt0 11278 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-tpos 8244 df-frecs 8300 df-wrecs 8331 df-recs 8380 df-rdg 8419 df-er 8718 df-map 8850 df-en 8975 df-dom 8976 df-sdom 8977 df-pnf 11346 df-mnf 11347 df-xr 11348 df-ltxr 11349 df-le 11350 df-sub 11544 df-neg 11545 df-nn 12337 df-2 12406 df-3 12407 df-4 12408 df-5 12409 df-6 12410 df-7 12411 df-8 12412 df-sets 17343 df-slot 17361 df-ndx 17373 df-base 17389 df-plusg 17442 df-mulr 17443 df-sca 17445 df-vsca 17446 df-ip 17447 df-0g 17613 df-mgm 18817 df-sgrp 18909 df-mnd 18925 df-mhm 18979 df-ghm 19429 df-mgp 20362 df-ur 20409 df-ring 20462 df-oppr 20568 df-rhm 20703 df-staf 21097 df-srng 21098 df-lmod 21138 df-lmhm 21298 df-lvec 21379 df-sra 21449 df-rgmod 21450 df-phl 21933 |
| This theorem is used by: ipcau2 25556 |
| Copyright terms: Public domain | W3C validator |