Theorem phpar2 31222

Description: The parallelogram law for an inner product space. (Contributed by NM, 2-Apr-2007.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
phpar2	⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2))))

Proof of Theorem phpar2

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isph.1	. . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈)
2		isph.2	. . . . 5 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
3		isph.3	. . . . 5 ⊢ 𝑀 = ( −𝑣 ‘𝑈)
4		isph.6	. . . . 5 ⊢ 𝑁 = (normCV‘𝑈)
5	1, 2, 3, 4	isph 31221	. . . 4 ⊢ (𝑈 ∈ CPreHilOLD ↔ (𝑈 ∈ NrmCVec ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)))))
6	5	simprbi 503	. . 3 ⊢ (𝑈 ∈ CPreHilOLD → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))))
7	6	3ad2ant1 1151	. 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))))
8		fvoveq1 7439	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑁‘(𝑥𝐺𝑦)) = (𝑁‘(𝐴𝐺𝑦)))
9	8	oveq1d 7431	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑁‘(𝑥𝐺𝑦))↑2) = ((𝑁‘(𝐴𝐺𝑦))↑2))
10		fvoveq1 7439	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑁‘(𝑥𝑀𝑦)) = (𝑁‘(𝐴𝑀𝑦)))
11	10	oveq1d 7431	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑁‘(𝑥𝑀𝑦))↑2) = ((𝑁‘(𝐴𝑀𝑦))↑2))
12	9, 11	oveq12d 7434	. . . . 5 ⊢ (𝑥 = 𝐴 → (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (((𝑁‘(𝐴𝐺𝑦))↑2) + ((𝑁‘(𝐴𝑀𝑦))↑2)))
13		fveq2 6885	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑁‘𝑥) = (𝑁‘𝐴))
14	13	oveq1d 7431	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑁‘𝑥)↑2) = ((𝑁‘𝐴)↑2))
15	14	oveq1d 7431	. . . . . 6 ⊢ (𝑥 = 𝐴 → (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2)) = (((𝑁‘𝐴)↑2) + ((𝑁‘𝑦)↑2)))
16	15	oveq2d 7432	. . . . 5 ⊢ (𝑥 = 𝐴 → (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))) = (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝑦)↑2))))
17	12, 16	eqeq12d 2781	. . . 4 ⊢ (𝑥 = 𝐴 → ((((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))) ↔ (((𝑁‘(𝐴𝐺𝑦))↑2) + ((𝑁‘(𝐴𝑀𝑦))↑2)) = (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝑦)↑2)))))
18		oveq2 7424	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝐴𝐺𝑦) = (𝐴𝐺𝐵))
19	18	fveq2d 6889	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑁‘(𝐴𝐺𝑦)) = (𝑁‘(𝐴𝐺𝐵)))
20	19	oveq1d 7431	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑁‘(𝐴𝐺𝑦))↑2) = ((𝑁‘(𝐴𝐺𝐵))↑2))
21		oveq2 7424	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝐴𝑀𝑦) = (𝐴𝑀𝐵))
22	21	fveq2d 6889	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑁‘(𝐴𝑀𝑦)) = (𝑁‘(𝐴𝑀𝐵)))
23	22	oveq1d 7431	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑁‘(𝐴𝑀𝑦))↑2) = ((𝑁‘(𝐴𝑀𝐵))↑2))
24	20, 23	oveq12d 7434	. . . . 5 ⊢ (𝑦 = 𝐵 → (((𝑁‘(𝐴𝐺𝑦))↑2) + ((𝑁‘(𝐴𝑀𝑦))↑2)) = (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)))
25		fveq2 6885	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝑁‘𝑦) = (𝑁‘𝐵))
26	25	oveq1d 7431	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝑁‘𝑦)↑2) = ((𝑁‘𝐵)↑2))
27	26	oveq2d 7432	. . . . . 6 ⊢ (𝑦 = 𝐵 → (((𝑁‘𝐴)↑2) + ((𝑁‘𝑦)↑2)) = (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)))
28	27	oveq2d 7432	. . . . 5 ⊢ (𝑦 = 𝐵 → (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝑦)↑2))) = (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2))))
29	24, 28	eqeq12d 2781	. . . 4 ⊢ (𝑦 = 𝐵 → ((((𝑁‘(𝐴𝐺𝑦))↑2) + ((𝑁‘(𝐴𝑀𝑦))↑2)) = (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝑦)↑2))) ↔ (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)))))
30	17, 29	rspc2v 3594	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))) → (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)))))
31	30	3adant1 1148	. 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑁‘(𝑥𝐺𝑦))↑2) + ((𝑁‘(𝑥𝑀𝑦))↑2)) = (2 · (((𝑁‘𝑥)↑2) + ((𝑁‘𝑦)↑2))) → (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)))))
32	7, 31	mpd 16	1 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝑁‘(𝐴𝐺𝐵))↑2) + ((𝑁‘(𝐴𝑀𝐵))↑2)) = (2 · (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2))))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ‘cfv 6540  (class class class)co 7416   + caddc 11114   · cmul 11116  2c2 12306  ↑cexp 14111  NrmCVeccnv 30983   +_𝑣 cpv 30984  BaseSetcba 30985   −_𝑣 cnsb 30988  norm_CVcnmcv 30989  CPreHil_OLDccphlo 31211

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-resscn 11168  ax-1cn 11169  ax-icn 11170  ax-addcl 11171  ax-addrcl 11172  ax-mulcl 11173  ax-mulrcl 11174  ax-mulcom 11175  ax-addass 11176  ax-mulass 11177  ax-distr 11178  ax-i2m1 11179  ax-1ne0 11180  ax-1rid 11181  ax-rnegex 11182  ax-rrecex 11183  ax-cnre 11184  ax-pre-lttri 11185  ax-pre-lttrn 11186  ax-pre-ltadd 11187

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-po 5571  df-so 5572  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7988  df-2nd 7989  df-er 8696  df-en 8946  df-dom 8947  df-sdom 8948  df-pnf 11256  df-mnf 11257  df-ltxr 11259  df-sub 11454  df-neg 11455  df-grpo 30892  df-gid 30893  df-ginv 30894  df-gdiv 30895  df-ablo 30944  df-vc 30958  df-nv 30991  df-va 30994  df-ba 30995  df-sm 30996  df-0v 30997  df-vs 30998  df-nmcv 30999  df-ph 31212

This theorem is used by:  minvecolem2  31274  hlpar2  31295