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

Theorem phlpropd 21954
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 21438 . . 3 (𝜑 → (𝐾 ∈ LVec ↔ 𝐿 ∈ LVec))
94, 5eqtr3d 2798 . . . 4 (𝜑 → (Scalar‘𝐾) = (Scalar‘𝐿))
109eleq1d 2846 . . 3 (𝜑 → ((Scalar‘𝐾) ∈ *-Ring ↔ (Scalar‘𝐿) ∈ *-Ring))
11 phlpropd.8 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(·𝑖‘𝐾)𝑦) = (𝑥(·𝑖‘𝐿)𝑦))
1211oveqrspc2v 7445 . . . . . . . . . 10 ((𝜑 ∧ (𝑏 ∈ 𝐵 ∧ 𝑎 ∈ 𝐵)) → (𝑏(·𝑖‘𝐾)𝑎) = (𝑏(·𝑖‘𝐿)𝑎))
1312anass1rs 668 . . . . . . . . 9 (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑏 ∈ 𝐵) → (𝑏(·𝑖‘𝐾)𝑎) = (𝑏(·𝑖‘𝐿)𝑎))
1413mpteq2dva 5198 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑏 ∈ 𝐵 ↦ (𝑏(·𝑖‘𝐾)𝑎)) = (𝑏 ∈ 𝐵 ↦ (𝑏(·𝑖‘𝐿)𝑎)))
151adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝐵 = (Base‘𝐾))
1615mpteq1d 5195 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑏 ∈ 𝐵 ↦ (𝑏(·𝑖‘𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖‘𝐾)𝑎)))
172adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝐵 = (Base‘𝐿))
1817mpteq1d 5195 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑏 ∈ 𝐵 ↦ (𝑏(·𝑖‘𝐿)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖‘𝐿)𝑎)))
1914, 16, 183eqtr3d 2804 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖‘𝐾)𝑎)) = (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖‘𝐿)𝑎)))
20 rlmbas 21461 . . . . . . . . . . . 12 (Base‘𝐹) = (Base‘(ringLMod‘𝐹))
216, 20eqtri 2784 . . . . . . . . . . 11 𝑃 = (Base‘(ringLMod‘𝐹))
2221a1i 11 . . . . . . . . . 10 (𝜑 → 𝑃 = (Base‘(ringLMod‘𝐹)))
23 fvex 6896 . . . . . . . . . . . 12 (Scalar‘𝐾) ∈ V
244, 23eqeltrdi 2869 . . . . . . . . . . 11 (𝜑 → 𝐹 ∈ V)
25 rlmsca 21466 . . . . . . . . . . 11 (𝐹 ∈ V → 𝐹 = (Scalar‘(ringLMod‘𝐹)))
2624, 25syl 18 . . . . . . . . . 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 21341 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘𝐹)))
304fveq2d 6887 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐾)))
3130oveq2d 7434 . . . . . . . . 9 (𝜑 → (𝐾 LMHom (ringLMod‘𝐹)) = (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))))
325fveq2d 6887 . . . . . . . . . 10 (𝜑 → (ringLMod‘𝐹) = (ringLMod‘(Scalar‘𝐿)))
3332oveq2d 7434 . . . . . . . . 9 (𝜑 → (𝐿 LMHom (ringLMod‘𝐹)) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3429, 31, 333eqtr3d 2804 . . . . . . . 8 (𝜑 → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3534adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) = (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))))
3619, 35eleq12d 2855 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖‘𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ↔ (𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖‘𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿)))))
3711oveqrspc2v 7445 . . . . . . . . 9 ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑎 ∈ 𝐵)) → (𝑎(·𝑖‘𝐾)𝑎) = (𝑎(·𝑖‘𝐿)𝑎))
3837anabsan2 687 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑎(·𝑖‘𝐾)𝑎) = (𝑎(·𝑖‘𝐿)𝑎))
399fveq2d 6887 . . . . . . . . 9 (𝜑 → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4039adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
4138, 40eqeq12d 2777 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((𝑎(·𝑖‘𝐾)𝑎) = (0g‘(Scalar‘𝐾)) ↔ (𝑎(·𝑖‘𝐿)𝑎) = (0g‘(Scalar‘𝐿))))
421, 2, 3grpidpropd 18835 . . . . . . . . 9 (𝜑 → (0g‘𝐾) = (0g‘𝐿))
4342adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (0g‘𝐾) = (0g‘𝐿))
4443eqeq2d 2772 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑎 = (0g‘𝐾) ↔ 𝑎 = (0g‘𝐿)))
4541, 44imbi12d 347 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (((𝑎(·𝑖‘𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g‘𝐾)) ↔ ((𝑎(·𝑖‘𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g‘𝐿))))
469fveq2d 6887 . . . . . . . . . . . 12 (𝜑 → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4746adantr 486 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (*𝑟‘(Scalar‘𝐾)) = (*𝑟‘(Scalar‘𝐿)))
4811oveqrspc2v 7445 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(·𝑖‘𝐾)𝑏) = (𝑎(·𝑖‘𝐿)𝑏))
4947, 48fveq12d 6890 . . . . . . . . . 10 ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)))
5049anassrs 473 . . . . . . . . 9 (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑏 ∈ 𝐵) → ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)))
5150, 13eqeq12d 2777 . . . . . . . 8 (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑏 ∈ 𝐵) → (((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎) ↔ ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎)))
5251ralbidva 3184 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (∀𝑏 ∈ 𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎) ↔ ∀𝑏 ∈ 𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎)))
5315raleqdv 3320 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (∀𝑏 ∈ 𝐵 ((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎)))
5417raleqdv 3320 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (∀𝑏 ∈ 𝐵 ((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎)))
5552, 53, 543bitr3d 312 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎) ↔ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎)))
5636, 45, 553anbi123d 1464 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝐵) → (((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖‘𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖‘𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g‘𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎)) ↔ ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖‘𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖‘𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g‘𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎))))
5756ralbidva 3184 . . . 4 (𝜑 → (∀𝑎 ∈ 𝐵 ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖‘𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖‘𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g‘𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎)) ↔ ∀𝑎 ∈ 𝐵 ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖‘𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖‘𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g‘𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎))))
581raleqdv 3320 . . . 4 (𝜑 → (∀𝑎 ∈ 𝐵 ((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖‘𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖‘𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g‘𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖‘𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖‘𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g‘𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎))))
592raleqdv 3320 . . . 4 (𝜑 → (∀𝑎 ∈ 𝐵 ((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖‘𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖‘𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g‘𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖‘𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖‘𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g‘𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎))))
6057, 58, 593bitr3d 312 . . 3 (𝜑 → (∀𝑎 ∈ (Base‘𝐾)((𝑏 ∈ (Base‘𝐾) ↦ (𝑏(·𝑖‘𝐾)𝑎)) ∈ (𝐾 LMHom (ringLMod‘(Scalar‘𝐾))) ∧ ((𝑎(·𝑖‘𝐾)𝑎) = (0g‘(Scalar‘𝐾)) → 𝑎 = (0g‘𝐾)) ∧ ∀𝑏 ∈ (Base‘𝐾)((*𝑟‘(Scalar‘𝐾))‘(𝑎(·𝑖‘𝐾)𝑏)) = (𝑏(·𝑖‘𝐾)𝑎)) ↔ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖‘𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖‘𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g‘𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎))))
618, 10, 603anbi123d 1464 . 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 21927 . 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 21927 . 2 (𝐿 ∈ PreHil ↔ (𝐿 ∈ LVec ∧ (Scalar‘𝐿) ∈ *-Ring ∧ ∀𝑎 ∈ (Base‘𝐿)((𝑏 ∈ (Base‘𝐿) ↦ (𝑏(·𝑖‘𝐿)𝑎)) ∈ (𝐿 LMHom (ringLMod‘(Scalar‘𝐿))) ∧ ((𝑎(·𝑖‘𝐿)𝑎) = (0g‘(Scalar‘𝐿)) → 𝑎 = (0g‘𝐿)) ∧ ∀𝑏 ∈ (Base‘𝐿)((*𝑟‘(Scalar‘𝐿))‘(𝑎(·𝑖‘𝐿)𝑏)) = (𝑏(·𝑖‘𝐿)𝑎))))
7661, 68, 753bitr4g 317 1 (𝜑 → (𝐾 ∈ PreHil ↔ 𝐿 ∈ PreHil))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ↦ cmpt 5186  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  +gcplusg 17421  *𝑟cstv 17423  Scalarcsca 17424   ·𝑠 cvsca 17425  ·𝑖cip 17426  0gc0g 17603  *-Ringcsr 21088   LMHom clmhm 21287  LVecclvec 21370  ringLModcrglmod 21440  PreHilcphl 21923
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-er 8710  df-map 8842  df-en 8967  df-dom 8968  df-sdom 8969  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-2 12398  df-3 12399  df-4 12400  df-5 12401  df-6 12402  df-7 12403  df-8 12404  df-sets 17335  df-slot 17353  df-ndx 17365  df-base 17381  df-ress 17402  df-plusg 17434  df-sca 17437  df-vsca 17438  df-ip 17439  df-0g 17605  df-mgm 18809  df-sgrp 18901  df-mnd 18917  df-mhm 18971  df-grp 19140  df-ghm 19421  df-mgp 20354  df-ur 20401  df-ring 20454  df-lmod 21130  df-lmhm 21290  df-lvec 21371  df-sra 21441  df-rgmod 21442  df-phl 21925
This theorem is used by:  tcphphl  25541
  Copyright terms: Public domain W3C validator