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

Theorem phlpropd 21630
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 21160 . . 3 (𝜑 → (𝐾 ∈ LVec ↔ 𝐿 ∈ LVec))
94, 5eqtr3d 2776 . . . 4 (𝜑 → (Scalar‘𝐾) = (Scalar‘𝐿))
109eleq1d 2824 . . 3 (𝜑 → ((Scalar‘𝐾) ∈ *-Ring ↔ (Scalar‘𝐿) ∈ *-Ring))
11 phlpropd.8 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(·𝑖𝐾)𝑦) = (𝑥(·𝑖𝐿)𝑦))
1211oveqrspc2v 7383 . . . . . . . . . 10 ((𝜑 ∧ (𝑏𝐵𝑎𝐵)) → (𝑏(·𝑖𝐾)𝑎) = (𝑏(·𝑖𝐿)𝑎))
1312anass1rs 661 . . . . . . . . 9 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → (𝑏(·𝑖𝐾)𝑎) = (𝑏(·𝑖𝐿)𝑎))
1413mpteq2dva 5165 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏𝐵 ↦ (𝑏(·𝑖𝐿)𝑎)))
151adantr 481 . . . . . . . . 9 ((𝜑𝑎𝐵) → 𝐵 = (Base‘𝐾))
1615mpteq1d 5162 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)))
172adantr 481 . . . . . . . . 9 ((𝜑𝑎𝐵) → 𝐵 = (Base‘𝐿))
1817mpteq1d 5162 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐿)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)))
1914, 16, 183eqtr3d 2782 . . . . . . 7 ((𝜑𝑎𝐵) → (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)))
20 rlmbas 21183 . . . . . . . . . . . 12 (Base‘𝐹) = (Base‘(ringLMod‘𝐹))
216, 20eqtri 2762 . . . . . . . . . . 11 𝑃 = (Base‘(ringLMod‘𝐹))
2221a1i 11 . . . . . . . . . 10 (𝜑𝑃 = (Base‘(ringLMod‘𝐹)))
23 fvex 6840 . . . . . . . . . . . 12 (Scalar‘𝐾) ∈ V
244, 23eqeltrdi 2847 . . . . . . . . . . 11 (𝜑𝐹 ∈ V)
25 rlmsca 21188 . . . . . . . . . . 11 (𝐹 ∈ V → 𝐹 = (Scalar‘(ringLMod‘𝐹)))
2624, 25syl 17 . . . . . . . . . 10 (𝜑𝐹 = (Scalar‘(ringLMod‘𝐹)))
27 eqidd 2740 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥(+g‘(ringLMod‘𝐹))𝑦) = (𝑥(+g‘(ringLMod‘𝐹))𝑦))
28 eqidd 2740 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥( ·𝑠 ‘(ringLMod‘𝐹))𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐹))𝑦))
291, 22, 2, 22, 4, 26, 5, 26, 6, 6, 3, 27, 7, 28lmhmpropd 21063 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘𝐹)))
304fveq2d 6831 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐾)))
3130oveq2d 7372 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))))
325fveq2d 6831 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐿)))
3332oveq2d 7372 . . . . . . . . 9 (𝜑 → (𝐿 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3429, 31, 333eqtr3d 2782 . . . . . . . 8 (𝜑 → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3534adantr 481 . . . . . . 7 ((𝜑𝑎𝐵) → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3619, 35eleq12d 2833 . . . . . 6 ((𝜑𝑎𝐵) → ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ↔ (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿)))))
3711oveqrspc2v 7383 . . . . . . . . 9 ((𝜑 ∧ (𝑎𝐵𝑎𝐵)) → (𝑎(·𝑖𝐾)𝑎) = (𝑎(·𝑖𝐿)𝑎))
3837anabsan2 680 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑎(·𝑖𝐾)𝑎) = (𝑎(·𝑖𝐿)𝑎))
399fveq2d 6831 . . . . . . . . 9 (𝜑 → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4039adantr 481 . . . . . . . 8 ((𝜑𝑎𝐵) → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4138, 40eqeq12d 2755 . . . . . . 7 ((𝜑𝑎𝐵) → ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) ↔ (𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿))))
421, 2, 3grpidpropd 18621 . . . . . . . . 9 (𝜑 → (0g𝐾) = (0g𝐿))
4342adantr 481 . . . . . . . 8 ((𝜑𝑎𝐵) → (0g𝐾) = (0g𝐿))
4443eqeq2d 2750 . . . . . . 7 ((𝜑𝑎𝐵) → (𝑎 = (0g𝐾) ↔ 𝑎 = (0g𝐿)))
4541, 44imbi12d 345 . . . . . 6 ((𝜑𝑎𝐵) → (((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ↔ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿))))
469fveq2d 6831 . . . . . . . . . . . 12 (𝜑 → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4746adantr 481 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4811oveqrspc2v 7383 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎(·𝑖𝐾)𝑏) = (𝑎(·𝑖𝐿)𝑏))
4947, 48fveq12d 6834 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)))
5049anassrs 468 . . . . . . . . 9 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)))
5150, 13eqeq12d 2755 . . . . . . . 8 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → (((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5251ralbidva 3160 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5315raleqdv 3297 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)))
5417raleqdv 3297 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5552, 53, 543bitr3d 310 . . . . . 6 ((𝜑𝑎𝐵) → (∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5636, 45, 553anbi123d 1444 . . . . 5 ((𝜑𝑎𝐵) → (((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
5756ralbidva 3160 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
581raleqdv 3297 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎))))
592raleqdv 3297 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
6057, 58, 593bitr3d 310 . . 3 (𝜑 → (∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
618, 10, 603anbi123d 1444 . 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 2739 . . 3 (Base‘𝐾) = (Base‘𝐾)
63 eqid 2739 . . 3 (Scalar‘𝐾) = (Scalar‘𝐾)
64 eqid 2739 . . 3 (·𝑖𝐾) = (·𝑖𝐾)
65 eqid 2739 . . 3 (0g𝐾) = (0g𝐾)
66 eqid 2739 . . 3 (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐾))
67 eqid 2739 . . 3 (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐾))
6862, 63, 64, 65, 66, 67isphl 21603 . 2 (𝐾 ∈ PreHil ↔ (𝐾 ∈ LVec ∧ (Scalar‘𝐾) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎))))
69 eqid 2739 . . 3 (Base‘𝐿) = (Base‘𝐿)
70 eqid 2739 . . 3 (Scalar‘𝐿) = (Scalar‘𝐿)
71 eqid 2739 . . 3 (·𝑖𝐿) = (·𝑖𝐿)
72 eqid 2739 . . 3 (0g𝐿) = (0g𝐿)
73 eqid 2739 . . 3 (*𝑟‘(Scalar‘𝐿)) = (*𝑟‘(Scalar‘𝐿))
74 eqid 2739 . . 3 (0g‘(Scalar‘𝐿)) = (0g‘(Scalar‘𝐿))
7569, 70, 71, 72, 73, 74isphl 21603 . 2 (𝐿 ∈ PreHil ↔ (𝐿 ∈ LVec ∧ (Scalar‘𝐿) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
7661, 68, 753bitr4g 315 1 (𝜑 → (𝐾 ∈ PreHil ↔ 𝐿 ∈ PreHil))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wcel 2119  wral 3053  Vcvv 3431  cmpt 5153  cfv 6485  (class class class)co 7356  Basecbs 17170  +gcplusg 17211  *𝑟cstv 17213  Scalarcsca 17214   ·𝑠 cvsca 17215  ·𝑖cip 17216  0gc0g 17393  *-Ringcsr 20810   LMHom clmhm 21009  LVecclvec 21092  ringLModcrglmod 21162  PreHilcphl 21599
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-er 8633  df-map 8765  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-3 12236  df-4 12237  df-5 12238  df-6 12239  df-7 12240  df-8 12241  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-plusg 17224  df-sca 17227  df-vsca 17228  df-ip 17229  df-0g 17395  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-mhm 18742  df-grp 18903  df-ghm 19179  df-mgp 20113  df-ur 20154  df-ring 20207  df-lmod 20852  df-lmhm 21012  df-lvec 21093  df-sra 21163  df-rgmod 21164  df-phl 21601
This theorem is referenced by:  tcphphl  25212
  Copyright terms: Public domain W3C validator