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

Theorem phlpropd 21696
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 21192 . . 3 (𝜑 → (𝐾 ∈ LVec ↔ 𝐿 ∈ LVec))
94, 5eqtr3d 2782 . . . 4 (𝜑 → (Scalar‘𝐾) = (Scalar‘𝐿))
109eleq1d 2829 . . 3 (𝜑 → ((Scalar‘𝐾) ∈ *-Ring ↔ (Scalar‘𝐿) ∈ *-Ring))
11 phlpropd.8 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(·𝑖𝐾)𝑦) = (𝑥(·𝑖𝐿)𝑦))
1211oveqrspc2v 7475 . . . . . . . . . 10 ((𝜑 ∧ (𝑏𝐵𝑎𝐵)) → (𝑏(·𝑖𝐾)𝑎) = (𝑏(·𝑖𝐿)𝑎))
1312anass1rs 654 . . . . . . . . 9 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → (𝑏(·𝑖𝐾)𝑎) = (𝑏(·𝑖𝐿)𝑎))
1413mpteq2dva 5266 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏𝐵 ↦ (𝑏(·𝑖𝐿)𝑎)))
151adantr 480 . . . . . . . . 9 ((𝜑𝑎𝐵) → 𝐵 = (Base‘𝐾))
1615mpteq1d 5261 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)))
172adantr 480 . . . . . . . . 9 ((𝜑𝑎𝐵) → 𝐵 = (Base‘𝐿))
1817mpteq1d 5261 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑏𝐵 ↦ (𝑏(·𝑖𝐿)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)))
1914, 16, 183eqtr3d 2788 . . . . . . 7 ((𝜑𝑎𝐵) → (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)))
20 rlmbas 21223 . . . . . . . . . . . 12 (Base‘𝐹) = (Base‘(ringLMod‘𝐹))
216, 20eqtri 2768 . . . . . . . . . . 11 𝑃 = (Base‘(ringLMod‘𝐹))
2221a1i 11 . . . . . . . . . 10 (𝜑𝑃 = (Base‘(ringLMod‘𝐹)))
23 fvex 6933 . . . . . . . . . . . 12 (Scalar‘𝐾) ∈ V
244, 23eqeltrdi 2852 . . . . . . . . . . 11 (𝜑𝐹 ∈ V)
25 rlmsca 21228 . . . . . . . . . . 11 (𝐹 ∈ V → 𝐹 = (Scalar‘(ringLMod‘𝐹)))
2624, 25syl 17 . . . . . . . . . 10 (𝜑𝐹 = (Scalar‘(ringLMod‘𝐹)))
27 eqidd 2741 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥(+g‘(ringLMod‘𝐹))𝑦) = (𝑥(+g‘(ringLMod‘𝐹))𝑦))
28 eqidd 2741 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥( ·𝑠 ‘(ringLMod‘𝐹))𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐹))𝑦))
291, 22, 2, 22, 4, 26, 5, 26, 6, 6, 3, 27, 7, 28lmhmpropd 21095 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘𝐹)))
304fveq2d 6924 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐾)))
3130oveq2d 7464 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))))
325fveq2d 6924 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐿)))
3332oveq2d 7464 . . . . . . . . 9 (𝜑 → (𝐿 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3429, 31, 333eqtr3d 2788 . . . . . . . 8 (𝜑 → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3534adantr 480 . . . . . . 7 ((𝜑𝑎𝐵) → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3619, 35eleq12d 2838 . . . . . 6 ((𝜑𝑎𝐵) → ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ↔ (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿)))))
3711oveqrspc2v 7475 . . . . . . . . 9 ((𝜑 ∧ (𝑎𝐵𝑎𝐵)) → (𝑎(·𝑖𝐾)𝑎) = (𝑎(·𝑖𝐿)𝑎))
3837anabsan2 673 . . . . . . . 8 ((𝜑𝑎𝐵) → (𝑎(·𝑖𝐾)𝑎) = (𝑎(·𝑖𝐿)𝑎))
399fveq2d 6924 . . . . . . . . 9 (𝜑 → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4039adantr 480 . . . . . . . 8 ((𝜑𝑎𝐵) → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4138, 40eqeq12d 2756 . . . . . . 7 ((𝜑𝑎𝐵) → ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) ↔ (𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿))))
421, 2, 3grpidpropd 18700 . . . . . . . . 9 (𝜑 → (0g𝐾) = (0g𝐿))
4342adantr 480 . . . . . . . 8 ((𝜑𝑎𝐵) → (0g𝐾) = (0g𝐿))
4443eqeq2d 2751 . . . . . . 7 ((𝜑𝑎𝐵) → (𝑎 = (0g𝐾) ↔ 𝑎 = (0g𝐿)))
4541, 44imbi12d 344 . . . . . 6 ((𝜑𝑎𝐵) → (((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ↔ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿))))
469fveq2d 6924 . . . . . . . . . . . 12 (𝜑 → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4746adantr 480 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4811oveqrspc2v 7475 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → (𝑎(·𝑖𝐾)𝑏) = (𝑎(·𝑖𝐿)𝑏))
4947, 48fveq12d 6927 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐵𝑏𝐵)) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)))
5049anassrs 467 . . . . . . . . 9 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)))
5150, 13eqeq12d 2756 . . . . . . . 8 (((𝜑𝑎𝐵) ∧ 𝑏𝐵) → (((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5251ralbidva 3182 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5315raleqdv 3334 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)))
5417raleqdv 3334 . . . . . . 7 ((𝜑𝑎𝐵) → (∀𝑏𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5552, 53, 543bitr3d 309 . . . . . 6 ((𝜑𝑎𝐵) → (∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)))
5636, 45, 553anbi123d 1436 . . . . 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 3334 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎))))
592raleqdv 3334 . . . 4 (𝜑 → (∀𝑎𝐵 ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
6057, 58, 593bitr3d 309 . . 3 (𝜑 → (∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
618, 10, 603anbi123d 1436 . 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 2740 . . 3 (Base‘𝐾) = (Base‘𝐾)
63 eqid 2740 . . 3 (Scalar‘𝐾) = (Scalar‘𝐾)
64 eqid 2740 . . 3 (·𝑖𝐾) = (·𝑖𝐾)
65 eqid 2740 . . 3 (0g𝐾) = (0g𝐾)
66 eqid 2740 . . 3 (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐾))
67 eqid 2740 . . 3 (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐾))
6862, 63, 64, 65, 66, 67isphl 21669 . 2 (𝐾 ∈ PreHil ↔ (𝐾 ∈ LVec ∧ (Scalar‘𝐾) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖𝐾)𝑏)) = (𝑏(·𝑖𝐾)𝑎))))
69 eqid 2740 . . 3 (Base‘𝐿) = (Base‘𝐿)
70 eqid 2740 . . 3 (Scalar‘𝐿) = (Scalar‘𝐿)
71 eqid 2740 . . 3 (·𝑖𝐿) = (·𝑖𝐿)
72 eqid 2740 . . 3 (0g𝐿) = (0g𝐿)
73 eqid 2740 . . 3 (*𝑟‘(Scalar‘𝐿)) = (*𝑟‘(Scalar‘𝐿))
74 eqid 2740 . . 3 (0g‘(Scalar‘𝐿)) = (0g‘(Scalar‘𝐿))
7569, 70, 71, 72, 73, 74isphl 21669 . 2 (𝐿 ∈ PreHil ↔ (𝐿 ∈ LVec ∧ (Scalar‘𝐿) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖𝐿)𝑏)) = (𝑏(·𝑖𝐿)𝑎))))
7661, 68, 753bitr4g 314 1 (𝜑 → (𝐾 ∈ PreHil ↔ 𝐿 ∈ PreHil))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1537  wcel 2108  wral 3067  Vcvv 3488  cmpt 5249  cfv 6573  (class class class)co 7448  Basecbs 17258  +gcplusg 17311  *𝑟cstv 17313  Scalarcsca 17314   ·𝑠 cvsca 17315  ·𝑖cip 17316  0gc0g 17499  *-Ringcsr 20861   LMHom clmhm 21041  LVecclvec 21124  ringLModcrglmod 21194  PreHilcphl 21665
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-er 8763  df-map 8886  df-en 9004  df-dom 9005  df-sdom 9006  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-nn 12294  df-2 12356  df-3 12357  df-4 12358  df-5 12359  df-6 12360  df-7 12361  df-8 12362  df-sets 17211  df-slot 17229  df-ndx 17241  df-base 17259  df-ress 17288  df-plusg 17324  df-sca 17327  df-vsca 17328  df-ip 17329  df-0g 17501  df-mgm 18678  df-sgrp 18757  df-mnd 18773  df-mhm 18818  df-grp 18976  df-ghm 19253  df-mgp 20162  df-ur 20209  df-ring 20262  df-lmod 20882  df-lmhm 21044  df-lvec 21125  df-sra 21195  df-rgmod 21196  df-phl 21667
This theorem is referenced by:  tcphphl  25280
  Copyright terms: Public domain W3C validator