isph - Metamath Proof Explorer

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

Theorem isph 30547

Description: The predicate "is an inner product space." (Contributed by NM, 1-Feb-2008.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
isph.1	⊢ 𝑋 = (BaseSet‘𝑈)
isph.2	⊢ 𝐺 = ( +_𝑣 ‘𝑈)
isph.3	⊢ 𝑀 = ( −_𝑣 ‘𝑈)
isph.6	⊢ 𝑁 = (norm_CV‘𝑈)

**Assertion**
Ref	Expression
isph	⊢ (𝑈 ∈ CPreHil_OLD ↔ (𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))))

Distinct variable groups: 𝑥,𝑦,𝐺 𝑥,𝑀,𝑦 𝑥,𝑁,𝑦 𝑥,𝑈,𝑦 𝑥,𝑋,𝑦

**Proof of Theorem isph**
Step	Hyp	Ref	Expression
1		phnv 30539	. 2 ⊢ (𝑈 ∈ CPreHil_OLD → 𝑈 ∈ NrmCVec)
2		isph.2	. . . . 5 ⊢ 𝐺 = ( +_𝑣 ‘𝑈)
3		eqid 2724	. . . . 5 ⊢ ( ·_𝑠OLD ‘𝑈) = ( ·_𝑠OLD ‘𝑈)
4		isph.6	. . . . 5 ⊢ 𝑁 = (norm_CV‘𝑈)
5	2, 3, 4	nvop 30401	. . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩)
6		eleq1 2813	. . . . 5 ⊢ (𝑈 = ⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ → (𝑈 ∈ CPreHil_OLD ↔ ⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ ∈ CPreHil_OLD))
7	2	fvexi 6896	. . . . . . 7 ⊢ 𝐺 ∈ V
8		fvex 6895	. . . . . . 7 ⊢ ( ·_𝑠OLD ‘𝑈) ∈ V
9	4	fvexi 6896	. . . . . . 7 ⊢ 𝑁 ∈ V
10		isph.1	. . . . . . . . 9 ⊢ 𝑋 = (BaseSet‘𝑈)
11	10, 2	bafval 30329	. . . . . . . 8 ⊢ 𝑋 = ran 𝐺
12	11	isphg 30542	. . . . . . 7 ⊢ ((𝐺 ∈ V ∧ ( ·_𝑠OLD ‘𝑈) ∈ V ∧ 𝑁 ∈ V) → (⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ ∈ CPreHil_OLD ↔ (⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))))))
13	7, 8, 9, 12	mp3an 1457	. . . . . 6 ⊢ (⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ ∈ CPreHil_OLD ↔ (⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))))
14		isph.3	. . . . . . . . . . . . . . . 16 ⊢ 𝑀 = ( −_𝑣 ‘𝑈)
15	10, 2, 3, 14	nvmval 30367	. . . . . . . . . . . . . . 15 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝑀𝑦) = (𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))
16	15	3expa 1115	. . . . . . . . . . . . . 14 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑋) → (𝑥𝑀𝑦) = (𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))
17	16	fveq2d 6886	. . . . . . . . . . . . 13 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑋) → (𝑁‘(𝑥𝑀𝑦)) = (𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦))))
18	17	oveq1d 7417	. . . . . . . . . . . 12 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑋) → ((𝑁‘(𝑥𝑀𝑦))↑2) = ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2))
19	18	oveq2d 7418	. . . . . . . . . . 11 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑋) → (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)))
20	19	eqeq1d 2726	. . . . . . . . . 10 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑋) → ((((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))) ↔ (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))))
21	20	ralbidva 3167	. . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → (∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))) ↔ ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))))
22	21	ralbidva 3167	. . . . . . . 8 ⊢ (𝑈 ∈ NrmCVec → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))))
23	22	pm5.32i 574	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))) ↔ (𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))))
24		eleq1 2813	. . . . . . . 8 ⊢ (𝑈 = ⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ → (𝑈 ∈ NrmCVec ↔ ⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ ∈ NrmCVec))
25	24	anbi1d 629	. . . . . . 7 ⊢ (𝑈 = ⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ → ((𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))) ↔ (⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))))))
26	23, 25	bitr2id 284	. . . . . 6 ⊢ (𝑈 = ⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ → ((⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝐺(-1( ·_𝑠OLD ‘𝑈)𝑦)))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))) ↔ (𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))))))
27	13, 26	bitrid 283	. . . . 5 ⊢ (𝑈 = ⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ → (⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ ∈ CPreHil_OLD ↔ (𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))))))
28	6, 27	bitrd 279	. . . 4 ⊢ (𝑈 = ⟨⟨𝐺, ( ·_𝑠OLD ‘𝑈)⟩, 𝑁⟩ → (𝑈 ∈ CPreHil_OLD ↔ (𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))))))
29	5, 28	syl 17	. . 3 ⊢ (𝑈 ∈ NrmCVec → (𝑈 ∈ CPreHil_OLD ↔ (𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))))))
30	29	bianabs 541	. 2 ⊢ (𝑈 ∈ NrmCVec → (𝑈 ∈ CPreHil_OLD ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))))
31	1, 30	biadanii 819	1 ⊢ (𝑈 ∈ CPreHil_OLD ↔ (𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))))

Colors of variables: wff setvar class

Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ∀wral 3053 Vcvv 3466 ⟨cop 4627 ‘cfv 6534 (class class class)co 7402 1c1 11108 + caddc 11110 · cmul 11112 -cneg 11443 2c2 12265 ↑cexp 14025 NrmCVeccnv 30309 +_𝑣 cpv 30310 BaseSetcba 30311 ·_𝑠OLD cns 30312 −_𝑣 cnsb 30314 norm_CVcnmcv 30315 CPreHil_OLDccphlo 30537

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5276 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-id 5565 df-po 5579 df-so 5580 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7358 df-ov 7405 df-oprab 7406 df-mpo 7407 df-1st 7969 df-2nd 7970 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-pnf 11248 df-mnf 11249 df-ltxr 11251 df-sub 11444 df-neg 11445 df-grpo 30218 df-gid 30219 df-ginv 30220 df-gdiv 30221 df-ablo 30270 df-vc 30284 df-nv 30317 df-va 30320 df-ba 30321 df-sm 30322 df-0v 30323 df-vs 30324 df-nmcv 30325 df-ph 30538

This theorem is referenced by: phpar2 30548

W3C validator