Theorem phllmhm 21918

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 2761	. . . . 5 ⊢ (0g‘𝑊) = (0g‘𝑊)
5		eqid 2761	. . . . 5 ⊢ (*𝑟‘𝐹) = (*𝑟‘𝐹)
6		eqid 2761	. . . . 5 ⊢ (0g‘𝐹) = (0g‘𝐹)
7	1, 2, 3, 4, 5, 6	isphl 21914	. . . 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 3100	. . 3 ⊢ (∀𝑦 ∈ 𝑉 ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ ((𝑦 , 𝑦) = (0g‘𝐹) → 𝑦 = (0g‘𝑊)) ∧ ∀𝑥 ∈ 𝑉 ((*𝑟‘𝐹)‘(𝑦 , 𝑥)) = (𝑥 , 𝑦)) → ∀𝑦 ∈ 𝑉 (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)))
11	8, 10	syl 18	. 2 ⊢ (𝑊 ∈ PreHil → ∀𝑦 ∈ 𝑉 (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)))
12		oveq2 7420	. . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑥 , 𝑦) = (𝑥 , 𝐴))
13	12	mpteq2dv 5199	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) = (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐴)))
14		phllmhm.g	. . . . 5 ⊢ 𝐺 = (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝐴))
15	13, 14	eqtr4di 2814	. . . 4 ⊢ (𝑦 = 𝐴 → (𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) = 𝐺)
16	15	eleq1d 2846	. . 3 ⊢ (𝑦 = 𝐴 → ((𝑥 ∈ 𝑉 ↦ (𝑥 , 𝑦)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ↔ 𝐺 ∈ (𝑊 LMHom (ringLMod‘𝐹))))
17	16	rspccva 3576	. 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 1570   ∈ wcel 2145  ∀wral 3077   ↦ cmpt 5186  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  *_𝑟cstv 17410  Scalarcsca 17411  ·_𝑖cip 17413  0_gc0g 17590  *-Ringcsr 21075   LMHom clmhm 21274  LVecclvec 21357  ringLModcrglmod 21427  PreHilcphl 21910

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-nul 5260

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-iota 6487  df-fv 6539  df-ov 7415  df-phl 21912

This theorem is used by:  ipcl  21919  ip0l  21922  ipdir  21925  ipass  21931