Theorem phllmhm 21943

Description: The inner product of a pre-Hilbert space is linear in its left argument. (Contributed by Mario Carneiro, 7-Oct-2015.)

Hypotheses

Ref	Expression
phlsrng.f	⊢ 𝐹 = (Scalar‘𝑊)
phllmhm.h	⊢ , = (·𝑖‘𝑊)
phllmhm.v	⊢ 𝑉 = (Base‘𝑊)
phllmhm.g	⊢ 𝐺 = (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐴))

Assertion

Ref	Expression
phllmhm	⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉) → 𝐺 ∈ (𝑊 LMHom (ringLMod‘𝐹)))

Distinct variable groups:   𝑥,𝐴   𝑥, ,   𝑥,𝑉   𝑥,𝑊

Allowed substitution hints:   𝐹(𝑥)   𝐺(𝑥)

Proof of Theorem phllmhm

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		phllmhm.v	. . . . 5 ⊢ 𝑉 = (Base‘𝑊)
2		phlsrng.f	. . . . 5 ⊢ 𝐹 = (Scalar‘𝑊)
3		phllmhm.h	. . . . 5 ⊢ , = (·𝑖‘𝑊)
4		eqid 2760	. . . . 5 ⊢ (0g‘𝑊) = (0g‘𝑊)
5		eqid 2760	. . . . 5 ⊢ (*𝑟‘𝐹) = (*𝑟‘𝐹)
6		eqid 2760	. . . . 5 ⊢ (0g‘𝐹) = (0g‘𝐹)
7	1, 2, 3, 4, 5, 6	isphl 21939	. . . 4 ⊢ (𝑊 ∈ PreHil ↔ (𝑊 ∈ LVec ∧ 𝐹 ∈ *-Ring ∧ ∀𝑦 ∈ 𝑉 ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ ((𝑦 , 𝑦) = (0g‘𝐹) → 𝑦 = (0g‘𝑊)) ∧ ∀𝑥 ∈ 𝑉 ((*𝑟‘𝐹)‘(𝑦 , 𝑥)) = (𝑥 , 𝑦))))
8	7	simp3bi 1165	. . 3 ⊢ (𝑊 ∈ PreHil → ∀𝑦 ∈ 𝑉 ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ ((𝑦 , 𝑦) = (0g‘𝐹) → 𝑦 = (0g‘𝑊)) ∧ ∀𝑥 ∈ 𝑉 ((*𝑟‘𝐹)‘(𝑦 , 𝑥)) = (𝑥 , 𝑦)))
9		simp1 1154	. . . 4 ⊢ (((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ ((𝑦 , 𝑦) = (0g‘𝐹) → 𝑦 = (0g‘𝑊)) ∧ ∀𝑥 ∈ 𝑉 ((*𝑟‘𝐹)‘(𝑦 , 𝑥)) = (𝑥 , 𝑦)) → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)))
10	9	ralimi 3099	. . 3 ⊢ (∀𝑦 ∈ 𝑉 ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ ((𝑦 , 𝑦) = (0g‘𝐹) → 𝑦 = (0g‘𝑊)) ∧ ∀𝑥 ∈ 𝑉 ((*𝑟‘𝐹)‘(𝑦 , 𝑥)) = (𝑥 , 𝑦)) → ∀𝑦 ∈ 𝑉 (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)))
11	8, 10	syl 18	. 2 ⊢ (𝑊 ∈ PreHil → ∀𝑦 ∈ 𝑉 (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)))
12		oveq2 7428	. . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑥 , 𝑦) = (𝑥 , 𝐴))
13	12	mpteq2dv 5198	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) = (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐴)))
14		phllmhm.g	. . . . 5 ⊢ 𝐺 = (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐴))
15	13, 14	eqtr4di 2813	. . . 4 ⊢ (𝑦 = 𝐴 → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) = 𝐺)
16	15	eleq1d 2845	. . 3 ⊢ (𝑦 = 𝐴 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ↔ 𝐺 ∈ (𝑊 LMHom (ringLMod‘𝐹))))
17	16	rspccva 3575	. 2 ⊢ ((∀𝑦 ∈ 𝑉 (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ 𝐴 ∈ 𝑉) → 𝐺 ∈ (𝑊 LMHom (ringLMod‘𝐹)))
18	11, 17	sylan 592	1 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉) → 𝐺 ∈ (𝑊 LMHom (ringLMod‘𝐹)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ↦ cmpt 5185  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  *_𝑟cstv 17435  Scalarcsca 17436  ·_𝑖cip 17438  0_gc0g 17615  *-Ringcsr 21100   LMHom clmhm 21299  LVecclvec 21382  ringLModcrglmod 21452  PreHilcphl 21935

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-ext 2732  ax-nul 5259

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-iota 6494  df-fv 6546  df-ov 7423  df-phl 21937

This theorem is used by:  ipcl  21944  ip0l  21947  ipdir  21950  ipass  21956