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

Theorem phlpropd 21695
Description: If two structures have the same components (properties), one is a pre-Hilbert space iff the other one is. (Contributed by Mario Carneiro, 8-Oct-2015.)
Hypotheses
Ref Expression
phlpropd.1 (𝜑𝐵 = (Base‘𝐾))
phlpropd.2 (𝜑𝐵 = (Base‘𝐿))
phlpropd.3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
phlpropd.4 (𝜑𝐹 = (Scalar‘𝐾))
phlpropd.5 (𝜑𝐹 = (Scalar‘𝐿))
phlpropd.6 𝑃 = (Base‘𝐹)
phlpropd.7 ((𝜑 ∧ (𝑥𝑃𝑦𝐵)) → (𝑥( ·𝑠𝐾)𝑦) = (𝑥( ·𝑠𝐿)𝑦))
phlpropd.8 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(·𝑖𝐾)𝑦) = (𝑥(·𝑖𝐿)𝑦))
Assertion
Ref Expression
phlpropd (𝜑 → (𝐾 ∈ PreHil ↔ 𝐿 ∈ PreHil))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐹,𝑦   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝑥,𝑃,𝑦   𝜑,𝑥,𝑦

Proof of Theorem phlpropd
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 phlpropd.1 . . . 4 (𝜑𝐵 = (Base‘𝐾))
2 phlpropd.2 . . . 4 (𝜑𝐵 = (Base‘𝐿))
3 phlpropd.3 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
4 phlpropd.4 . . . 4 (𝜑𝐹 = (Scalar‘𝐾))
5 phlpropd.5 . . . 4 (𝜑𝐹 = (Scalar‘𝐿))
6 phlpropd.6 . . . 4 𝑃 = (Base‘𝐹)
7 phlpropd.7 . . . 4 ((𝜑 ∧ (𝑥𝑃𝑦𝐵)) → (𝑥( ·𝑠𝐾)𝑦) = (𝑥( ·𝑠𝐿)𝑦))
81, 2, 3, 4, 5, 6, 7lvecpropd 21225 . . 3 (𝜑 → (𝐾 ∈ LVec ↔ 𝐿 ∈ LVec))
94, 5eqtr3d 2798 . . . 4 (𝜑 → (Scalar‘𝐾) = (Scalar‘𝐿))
109eleq1d 2846 . . 3 (𝜑 → ((Scalar‘𝐾) ∈ *-Ring ↔ (Scalar‘𝐿) ∈ *-Ring))
11 phlpropd.8 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(·𝑖𝐾)𝑦) = (𝑥(·𝑖𝐿)𝑦))
1211oveqrspc2v 7418 . . . . . . . . . 10 ((𝜑 ∧ (𝑏𝐵𝑎𝐵)) → (𝑏(·𝑖𝐾)𝑎) = (𝑏(·𝑖𝐿)𝑎))
1312anass1rs 665 . . . . . . . . 9 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → (𝑏(·𝑖𝐾)𝑎) = (𝑏(·𝑖𝐿)𝑎))
1413mpteq2dva 5190 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏𝐵 ↦ (𝑏(·𝑖𝐿)𝑎)))
151adantr 484 . . . . . . . . 9 ((𝜑𝑎𝐵) → 𝐵 = (Base‘𝐾))
1615mpteq1d 5187 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)))
172adantr 484 . . . . . . . . 9 ((𝜑𝑎𝐵) → 𝐵 = (Base‘𝐿))
1817mpteq1d 5187 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐿)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)))
1914, 16, 183eqtr3d 2804 . . . . . . 7 ((𝜑𝑎𝐵) → (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)))
20 rlmbas 21248 . . . . . . . . . . . 12 (Base‘𝐹) = (Base‘(ringLMod‘𝐹))
216, 20eqtri 2784 . . . . . . . . . . 11 𝑃 = (Base‘(ringLMod‘𝐹))
2221a1i 11 . . . . . . . . . 10 (𝜑𝑃 = (Base‘(ringLMod‘𝐹)))
23 fvex 6875 . . . . . . . . . . . 12 (Scalar‘𝐾) ∈ V
244, 23eqeltrdi 2869 . . . . . . . . . . 11 (𝜑𝐹 ∈ V)
25 rlmsca 21253 . . . . . . . . . . 11 (𝐹 ∈ V → 𝐹 = (Scalar‘(ringLMod‘𝐹)))
2624, 25syl 17 . . . . . . . . . 10 (𝜑𝐹 = (Scalar‘(ringLMod‘𝐹)))
27 eqidd 2762 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥(+g‘(ringLMod‘𝐹))𝑦) = (𝑥(+g‘(ringLMod‘𝐹))𝑦))
28 eqidd 2762 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥( ·𝑠 ‘(ringLMod‘𝐹))𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐹))𝑦))
291, 22, 2, 22, 4, 26, 5, 26, 6, 6, 3, 27, 7, 28lmhmpropd 21128 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘𝐹)))
304fveq2d 6866 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐾)))
3130oveq2d 7407 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))))
325fveq2d 6866 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐿)))
3332oveq2d 7407 . . . . . . . . 9 (𝜑 → (𝐿 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3429, 31, 333eqtr3d 2804 . . . . . . . 8 (𝜑 → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3534adantr 484 . . . . . . 7 ((𝜑𝑎𝐵) → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3619, 35eleq12d 2855 . . . . . 6 ((𝜑𝑎𝐵) → ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ↔ (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿)))))
3711oveqrspc2v 7418 . . . . . . . . 9 ((𝜑 ∧ (𝑎𝐵𝑎𝐵)) → (𝑎(·𝑖𝐾)𝑎) = (𝑎(·𝑖𝐿)𝑎))
3837anabsan2 684 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑎(·𝑖𝐾)𝑎) = (𝑎(·𝑖𝐿)𝑎))
399fveq2d 6866 . . . . . . . . 9 (𝜑 → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4039adantr 484 . . . . . . . 8 ((𝜑𝑎𝐵) → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4138, 40eqeq12d 2777 . . . . . . 7 ((𝜑𝑎𝐵) → ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) ↔ (𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿))))
421, 2, 3grpidpropd 18687 . . . . . . . . 9 (𝜑 → (0g𝐾) = (0g𝐿))
4342adantr 484 . . . . . . . 8 ((𝜑𝑎𝐵) → (0g𝐾) = (0g𝐿))
4443eqeq2d 2772 . . . . . . 7 ((𝜑𝑎𝐵) → (𝑎 = (0g𝐾) ↔ 𝑎 = (0g𝐿)))
4541, 44imbi12d 346 . . . . . 6 ((𝜑𝑎𝐵) → (((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ↔ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿))))
469fveq2d 6866 . . . . . . . . . . . 12 (𝜑 → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4746adantr 484 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4811oveqrspc2v 7418 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎(·𝑖𝐾)𝑏) = (𝑎(·𝑖𝐿)𝑏))
4947, 48fveq12d 6869 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)))
5049anassrs 471 . . . . . . . . 9 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)))
5150, 13eqeq12d 2777 . . . . . . . 8 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → (((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5251ralbidva 3182 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5315raleqdv 3319 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)))
5417raleqdv 3319 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5552, 53, 543bitr3d 311 . . . . . 6 ((𝜑𝑎𝐵) → (∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5636, 45, 553anbi123d 1456 . . . . 5 ((𝜑𝑎𝐵) → (((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
5756ralbidva 3182 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
581raleqdv 3319 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎))))
592raleqdv 3319 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
6057, 58, 593bitr3d 311 . . 3 (𝜑 → (∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
618, 10, 603anbi123d 1456 . 2 (𝜑 → ((𝐾 ∈ LVec ∧ (Scalar‘𝐾) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎))) ↔ (𝐿 ∈ LVec ∧ (Scalar‘𝐿) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))))
62 eqid 2761 . . 3 (Base‘𝐾) = (Base‘𝐾)
63 eqid 2761 . . 3 (Scalar‘𝐾) = (Scalar‘𝐾)
64 eqid 2761 . . 3 (·𝑖𝐾) = (·𝑖𝐾)
65 eqid 2761 . . 3 (0g𝐾) = (0g𝐾)
66 eqid 2761 . . 3 (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐾))
67 eqid 2761 . . 3 (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐾))
6862, 63, 64, 65, 66, 67isphl 21668 . 2 (𝐾 ∈ PreHil ↔ (𝐾 ∈ LVec ∧ (Scalar‘𝐾) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎))))
69 eqid 2761 . . 3 (Base‘𝐿) = (Base‘𝐿)
70 eqid 2761 . . 3 (Scalar‘𝐿) = (Scalar‘𝐿)
71 eqid 2761 . . 3 (·𝑖𝐿) = (·𝑖𝐿)
72 eqid 2761 . . 3 (0g𝐿) = (0g𝐿)
73 eqid 2761 . . 3 (*𝑟‘(Scalar‘𝐿)) = (*𝑟‘(Scalar‘𝐿))
74 eqid 2761 . . 3 (0g‘(Scalar‘𝐿)) = (0g‘(Scalar‘𝐿))
7569, 70, 71, 72, 73, 74isphl 21668 . 2 (𝐿 ∈ PreHil ↔ (𝐿 ∈ LVec ∧ (Scalar‘𝐿) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
7661, 68, 753bitr4g 316 1 (𝜑 → (𝐾 ∈ PreHil ↔ 𝐿 ∈ PreHil))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1097   = wceq 1559  wcel 2141  wral 3075  Vcvv 3453  cmpt 5178  cfv 6516  (class class class)co 7391  Basecbs 17236  +gcplusg 17277  *𝑟cstv 17279  Scalarcsca 17280   ·𝑠 cvsca 17281  ·𝑖cip 17282  0gc0g 17459  *-Ringcsr 20875   LMHom clmhm 21074  LVecclvec 21157  ringLModcrglmod 21227  PreHilcphl 21664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713  ax-cnex 11123  ax-resscn 11124  ax-1cn 11125  ax-icn 11126  ax-addcl 11127  ax-addrcl 11128  ax-mulcl 11129  ax-mulrcl 11130  ax-mulcom 11131  ax-addass 11132  ax-mulass 11133  ax-distr 11134  ax-i2m1 11135  ax-1ne0 11136  ax-1rid 11137  ax-rnegex 11138  ax-rrecex 11139  ax-cnre 11140  ax-pre-lttri 11141  ax-pre-lttrn 11142  ax-pre-ltadd 11143  ax-pre-mulgt0 11144
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6283  df-ord 6344  df-on 6345  df-lim 6346  df-suc 6347  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-riota 7348  df-ov 7394  df-oprab 7395  df-mpo 7396  df-om 7842  df-1st 7965  df-2nd 7966  df-frecs 8256  df-wrecs 8287  df-recs 8336  df-rdg 8375  df-er 8672  df-map 8804  df-en 8922  df-dom 8923  df-sdom 8924  df-pnf 11212  df-mnf 11213  df-xr 11214  df-ltxr 11215  df-le 11216  df-sub 11410  df-neg 11411  df-nn 12205  df-2 12274  df-3 12275  df-4 12276  df-5 12277  df-6 12278  df-7 12279  df-8 12280  df-sets 17191  df-slot 17209  df-ndx 17221  df-base 17237  df-ress 17258  df-plusg 17290  df-sca 17293  df-vsca 17294  df-ip 17295  df-0g 17461  df-mgm 18665  df-sgrp 18744  df-mnd 18760  df-mhm 18808  df-grp 18969  df-ghm 19245  df-mgp 20178  df-ur 20219  df-ring 20272  df-lmod 20917  df-lmhm 21077  df-lvec 21158  df-sra 21228  df-rgmod 21229  df-phl 21666
This theorem is referenced by:  tcphphl  25277
  Copyright terms: Public domain W3C validator