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

Theorem phlpropd 20801
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 19941 . . 3 (𝜑 → (𝐾 ∈ LVec ↔ 𝐿 ∈ LVec))
94, 5eqtr3d 2860 . . . 4 (𝜑 → (Scalar‘𝐾) = (Scalar‘𝐿))
109eleq1d 2899 . . 3 (𝜑 → ((Scalar‘𝐾) ∈ *-Ring ↔ (Scalar‘𝐿) ∈ *-Ring))
11 phlpropd.8 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(·𝑖𝐾)𝑦) = (𝑥(·𝑖𝐿)𝑦))
1211oveqrspc2v 7185 . . . . . . . . . 10 ((𝜑 ∧ (𝑏𝐵𝑎𝐵)) → (𝑏(·𝑖𝐾)𝑎) = (𝑏(·𝑖𝐿)𝑎))
1312anass1rs 653 . . . . . . . . 9 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → (𝑏(·𝑖𝐾)𝑎) = (𝑏(·𝑖𝐿)𝑎))
1413mpteq2dva 5163 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏𝐵 ↦ (𝑏(·𝑖𝐿)𝑎)))
151adantr 483 . . . . . . . . 9 ((𝜑𝑎𝐵) → 𝐵 = (Base‘𝐾))
1615mpteq1d 5157 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)))
172adantr 483 . . . . . . . . 9 ((𝜑𝑎𝐵) → 𝐵 = (Base‘𝐿))
1817mpteq1d 5157 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐿)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)))
1914, 16, 183eqtr3d 2866 . . . . . . 7 ((𝜑𝑎𝐵) → (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)))
20 rlmbas 19969 . . . . . . . . . . . 12 (Base‘𝐹) = (Base‘(ringLMod‘𝐹))
216, 20eqtri 2846 . . . . . . . . . . 11 𝑃 = (Base‘(ringLMod‘𝐹))
2221a1i 11 . . . . . . . . . 10 (𝜑𝑃 = (Base‘(ringLMod‘𝐹)))
23 fvex 6685 . . . . . . . . . . . 12 (Scalar‘𝐾) ∈ V
244, 23eqeltrdi 2923 . . . . . . . . . . 11 (𝜑𝐹 ∈ V)
25 rlmsca 19974 . . . . . . . . . . 11 (𝐹 ∈ V → 𝐹 = (Scalar‘(ringLMod‘𝐹)))
2624, 25syl 17 . . . . . . . . . 10 (𝜑𝐹 = (Scalar‘(ringLMod‘𝐹)))
27 eqidd 2824 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥(+g‘(ringLMod‘𝐹))𝑦) = (𝑥(+g‘(ringLMod‘𝐹))𝑦))
28 eqidd 2824 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥( ·𝑠 ‘(ringLMod‘𝐹))𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐹))𝑦))
291, 22, 2, 22, 4, 26, 5, 26, 6, 6, 3, 27, 7, 28lmhmpropd 19847 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘𝐹)))
304fveq2d 6676 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐾)))
3130oveq2d 7174 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))))
325fveq2d 6676 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐿)))
3332oveq2d 7174 . . . . . . . . 9 (𝜑 → (𝐿 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3429, 31, 333eqtr3d 2866 . . . . . . . 8 (𝜑 → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3534adantr 483 . . . . . . 7 ((𝜑𝑎𝐵) → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3619, 35eleq12d 2909 . . . . . 6 ((𝜑𝑎𝐵) → ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ↔ (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿)))))
3711oveqrspc2v 7185 . . . . . . . . 9 ((𝜑 ∧ (𝑎𝐵𝑎𝐵)) → (𝑎(·𝑖𝐾)𝑎) = (𝑎(·𝑖𝐿)𝑎))
3837anabsan2 672 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑎(·𝑖𝐾)𝑎) = (𝑎(·𝑖𝐿)𝑎))
399fveq2d 6676 . . . . . . . . 9 (𝜑 → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4039adantr 483 . . . . . . . 8 ((𝜑𝑎𝐵) → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4138, 40eqeq12d 2839 . . . . . . 7 ((𝜑𝑎𝐵) → ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) ↔ (𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿))))
421, 2, 3grpidpropd 17874 . . . . . . . . 9 (𝜑 → (0g𝐾) = (0g𝐿))
4342adantr 483 . . . . . . . 8 ((𝜑𝑎𝐵) → (0g𝐾) = (0g𝐿))
4443eqeq2d 2834 . . . . . . 7 ((𝜑𝑎𝐵) → (𝑎 = (0g𝐾) ↔ 𝑎 = (0g𝐿)))
4541, 44imbi12d 347 . . . . . 6 ((𝜑𝑎𝐵) → (((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ↔ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿))))
469fveq2d 6676 . . . . . . . . . . . 12 (𝜑 → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4746adantr 483 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4811oveqrspc2v 7185 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎(·𝑖𝐾)𝑏) = (𝑎(·𝑖𝐿)𝑏))
4947, 48fveq12d 6679 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)))
5049anassrs 470 . . . . . . . . 9 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)))
5150, 13eqeq12d 2839 . . . . . . . 8 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → (((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5251ralbidva 3198 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5315raleqdv 3417 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)))
5417raleqdv 3417 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5552, 53, 543bitr3d 311 . . . . . 6 ((𝜑𝑎𝐵) → (∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5636, 45, 553anbi123d 1432 . . . . 5 ((𝜑𝑎𝐵) → (((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
5756ralbidva 3198 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
581raleqdv 3417 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎))))
592raleqdv 3417 . . . 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 1432 . 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 2823 . . 3 (Base‘𝐾) = (Base‘𝐾)
63 eqid 2823 . . 3 (Scalar‘𝐾) = (Scalar‘𝐾)
64 eqid 2823 . . 3 (·𝑖𝐾) = (·𝑖𝐾)
65 eqid 2823 . . 3 (0g𝐾) = (0g𝐾)
66 eqid 2823 . . 3 (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐾))
67 eqid 2823 . . 3 (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐾))
6862, 63, 64, 65, 66, 67isphl 20774 . 2 (𝐾 ∈ PreHil ↔ (𝐾 ∈ LVec ∧ (Scalar‘𝐾) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎))))
69 eqid 2823 . . 3 (Base‘𝐿) = (Base‘𝐿)
70 eqid 2823 . . 3 (Scalar‘𝐿) = (Scalar‘𝐿)
71 eqid 2823 . . 3 (·𝑖𝐿) = (·𝑖𝐿)
72 eqid 2823 . . 3 (0g𝐿) = (0g𝐿)
73 eqid 2823 . . 3 (*𝑟‘(Scalar‘𝐿)) = (*𝑟‘(Scalar‘𝐿))
74 eqid 2823 . . 3 (0g‘(Scalar‘𝐿)) = (0g‘(Scalar‘𝐿))
7569, 70, 71, 72, 73, 74isphl 20774 . 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 398  w3a 1083   = wceq 1537  wcel 2114  wral 3140  Vcvv 3496  cmpt 5148  cfv 6357  (class class class)co 7158  Basecbs 16485  +gcplusg 16567  *𝑟cstv 16569  Scalarcsca 16570   ·𝑠 cvsca 16571  ·𝑖cip 16572  0gc0g 16715  *-Ringcsr 19617   LMHom clmhm 19793  LVecclvec 19876  ringLModcrglmod 19943  PreHilcphl 20770
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 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616
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 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-er 8291  df-map 8410  df-en 8512  df-dom 8513  df-sdom 8514  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-3 11704  df-4 11705  df-5 11706  df-6 11707  df-7 11708  df-8 11709  df-ndx 16488  df-slot 16489  df-base 16491  df-sets 16492  df-ress 16493  df-plusg 16580  df-sca 16583  df-vsca 16584  df-ip 16585  df-0g 16717  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-mhm 17958  df-grp 18108  df-ghm 18358  df-mgp 19242  df-ur 19254  df-ring 19301  df-lmod 19638  df-lmhm 19796  df-lvec 19877  df-sra 19946  df-rgmod 19947  df-phl 20772
This theorem is referenced by:  tcphphl  23832
  Copyright terms: Public domain W3C validator