ipdir - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ipdir		Structured version Visualization version GIF version

Theorem ipdir 20783

Description: Distributive law for inner product (right-distributivity). Equation I3 of [Ponnusamy] p. 362. (Contributed by NM, 25-Aug-2007.) (Revised by Mario Carneiro, 7-Oct-2015.)

**Hypotheses**
Ref	Expression
phlsrng.f	⊢ 𝐹 = (Scalar‘𝑊)
phllmhm.h	⊢ , = (·_𝑖‘𝑊)
phllmhm.v	⊢ 𝑉 = (Base‘𝑊)
ipdir.g	⊢ + = (+_g‘𝑊)
ipdir.p	⊢ ⨣ = (+_g‘𝐹)

**Assertion**
Ref	Expression
ipdir	⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 + 𝐵) , 𝐶) = ((𝐴 , 𝐶) ⨣ (𝐵 , 𝐶)))

Proof of Theorem ipdir Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		phlsrng.f	. . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊)
2		phllmhm.h	. . . . . 6 ⊢ , = (·_𝑖‘𝑊)
3		phllmhm.v	. . . . . 6 ⊢ 𝑉 = (Base‘𝑊)
4		eqid 2821	. . . . . 6 ⊢ (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) = (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))
5	1, 2, 3, 4	phllmhm 20776	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐶 ∈ 𝑉) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹)))
6	5	3ad2antr3 1186	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹)))
7		lmghm 19803	. . . 4 ⊢ ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 GrpHom (ringLMod‘𝐹)))
8	6, 7	syl 17	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 GrpHom (ringLMod‘𝐹)))
9		simpr1 1190	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝑉)
10		simpr2 1191	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉)
11		ipdir.g	. . . 4 ⊢ + = (+_g‘𝑊)
12		ipdir.p	. . . . 5 ⊢ ⨣ = (+_g‘𝐹)
13		rlmplusg 19968	. . . . 5 ⊢ (+_g‘𝐹) = (+_g‘(ringLMod‘𝐹))
14	12, 13	eqtri 2844	. . . 4 ⊢ ⨣ = (+_g‘(ringLMod‘𝐹))
15	3, 11, 14	ghmlin 18363	. . 3 ⊢ (((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶)) ∈ (𝑊 GrpHom (ringLMod‘𝐹)) ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 + 𝐵)) = (((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐴) ⨣ ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵)))
16	8, 9, 10, 15	syl3anc 1367	. 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 + 𝐵)) = (((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐴) ⨣ ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵)))
17		phllmod 20774	. . . . 5 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod)
18	3, 11	lmodvacl 19648	. . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 + 𝐵) ∈ 𝑉)
19	17, 18	syl3an1 1159	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 + 𝐵) ∈ 𝑉)
20	19	3adant3r3 1180	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 + 𝐵) ∈ 𝑉)
21		oveq1 7163	. . . 4 ⊢ (𝑥 = (𝐴 + 𝐵) → (𝑥 , 𝐶) = ((𝐴 + 𝐵) , 𝐶))
22		ovex 7189	. . . 4 ⊢ (𝑥 , 𝐶) ∈ V
23	21, 4, 22	fvmpt3i 6773	. . 3 ⊢ ((𝐴 + 𝐵) ∈ 𝑉 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 + 𝐵)) = ((𝐴 + 𝐵) , 𝐶))
24	20, 23	syl 17	. 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘(𝐴 + 𝐵)) = ((𝐴 + 𝐵) , 𝐶))
25		oveq1 7163	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 , 𝐶) = (𝐴 , 𝐶))
26	25, 4, 22	fvmpt3i 6773	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐴) = (𝐴 , 𝐶))
27	9, 26	syl 17	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐴) = (𝐴 , 𝐶))
28		oveq1 7163	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥 , 𝐶) = (𝐵 , 𝐶))
29	28, 4, 22	fvmpt3i 6773	. . . 4 ⊢ (𝐵 ∈ 𝑉 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵) = (𝐵 , 𝐶))
30	10, 29	syl 17	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵) = (𝐵 , 𝐶))
31	27, 30	oveq12d 7174	. 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐴) ⨣ ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐶))‘𝐵)) = ((𝐴 , 𝐶) ⨣ (𝐵 , 𝐶)))
32	16, 24, 31	3eqtr3d 2864	1 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 + 𝐵) , 𝐶) = ((𝐴 , 𝐶) ⨣ (𝐵 , 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ↦ cmpt 5146 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 +_gcplusg 16565 Scalarcsca 16568 ·_𝑖cip 16570 GrpHom cghm 18355 LModclmod 19634 LMHom clmhm 19791 ringLModcrglmod 19941 PreHilcphl 20768

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 df-ndx 16486 df-slot 16487 df-sets 16490 df-plusg 16578 df-sca 16581 df-vsca 16582 df-ip 16583 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-grp 18106 df-ghm 18356 df-lmod 19636 df-lmhm 19794 df-lvec 19875 df-sra 19944 df-rgmod 19945 df-phl 20770

This theorem is referenced by: ipdi 20784 ip2di 20785 ipsubdir 20786 phlssphl 20803 ocvlss 20816 lsmcss 20836 cphdir 23809

W3C validator