cphpyth - Metamath Proof Explorer

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

Theorem cphpyth 25174

Description: The pythagorean theorem for a subcomplex pre-Hilbert space. The square of the norm of the sum of two orthogonal vectors (i.e., whose inner product is 0) is the sum of the squares of their norms. Problem 2 in [Kreyszig] p. 135. This is Metamath 100 proof #4. (Contributed by NM, 17-Apr-2008.) (Revised by SN, 22-Sep-2024.)

**Hypotheses**
Ref	Expression
cphpyth.v	⊢ 𝑉 = (Base‘𝑊)
cphpyth.h	⊢ , = (·_𝑖‘𝑊)
cphpyth.p	⊢ + = (+_g‘𝑊)
cphpyth.n	⊢ 𝑁 = (norm‘𝑊)
cphpyth.w	⊢ (𝜑 → 𝑊 ∈ ℂPreHil)
cphpyth.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
cphpyth.b	⊢ (𝜑 → 𝐵 ∈ 𝑉)

**Assertion**
Ref	Expression
cphpyth	⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → ((𝑁‘(𝐴 + 𝐵))↑2) = (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)))

**Proof of Theorem cphpyth**
Step	Hyp	Ref	Expression
1		cphpyth.h	. . . . 5 ⊢ , = (·_𝑖‘𝑊)
2		cphpyth.v	. . . . 5 ⊢ 𝑉 = (Base‘𝑊)
3		cphpyth.p	. . . . 5 ⊢ + = (+_g‘𝑊)
4		cphpyth.w	. . . . 5 ⊢ (𝜑 → 𝑊 ∈ ℂPreHil)
5		cphpyth.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		cphpyth.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
7	1, 2, 3, 4, 5, 6, 5, 6	cph2di 25165	. . . 4 ⊢ (𝜑 → ((𝐴 + 𝐵) , (𝐴 + 𝐵)) = (((𝐴 , 𝐴) + (𝐵 , 𝐵)) + ((𝐴 , 𝐵) + (𝐵 , 𝐴))))
8	7	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → ((𝐴 + 𝐵) , (𝐴 + 𝐵)) = (((𝐴 , 𝐴) + (𝐵 , 𝐵)) + ((𝐴 , 𝐵) + (𝐵 , 𝐴))))
9		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → (𝐴 , 𝐵) = 0)
10	1, 2	cphorthcom 25159	. . . . . . . 8 ⊢ ((𝑊 ∈ ℂPreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((𝐴 , 𝐵) = 0 ↔ (𝐵 , 𝐴) = 0))
11	4, 5, 6, 10	syl3anc 1373	. . . . . . 7 ⊢ (𝜑 → ((𝐴 , 𝐵) = 0 ↔ (𝐵 , 𝐴) = 0))
12	11	biimpa 476	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → (𝐵 , 𝐴) = 0)
13	9, 12	oveq12d 7376	. . . . 5 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → ((𝐴 , 𝐵) + (𝐵 , 𝐴)) = (0 + 0))
14		00id 11310	. . . . 5 ⊢ (0 + 0) = 0
15	13, 14	eqtrdi 2787	. . . 4 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → ((𝐴 , 𝐵) + (𝐵 , 𝐴)) = 0)
16	15	oveq2d 7374	. . 3 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → (((𝐴 , 𝐴) + (𝐵 , 𝐵)) + ((𝐴 , 𝐵) + (𝐵 , 𝐴))) = (((𝐴 , 𝐴) + (𝐵 , 𝐵)) + 0))
17	2, 1	cphipcl 25149	. . . . . . 7 ⊢ ((𝑊 ∈ ℂPreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → (𝐴 , 𝐴) ∈ ℂ)
18	4, 5, 5, 17	syl3anc 1373	. . . . . 6 ⊢ (𝜑 → (𝐴 , 𝐴) ∈ ℂ)
19	2, 1	cphipcl 25149	. . . . . . 7 ⊢ ((𝑊 ∈ ℂPreHil ∧ 𝐵 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐵 , 𝐵) ∈ ℂ)
20	4, 6, 6, 19	syl3anc 1373	. . . . . 6 ⊢ (𝜑 → (𝐵 , 𝐵) ∈ ℂ)
21	18, 20	addcld 11153	. . . . 5 ⊢ (𝜑 → ((𝐴 , 𝐴) + (𝐵 , 𝐵)) ∈ ℂ)
22	21	addridd 11335	. . . 4 ⊢ (𝜑 → (((𝐴 , 𝐴) + (𝐵 , 𝐵)) + 0) = ((𝐴 , 𝐴) + (𝐵 , 𝐵)))
23	22	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → (((𝐴 , 𝐴) + (𝐵 , 𝐵)) + 0) = ((𝐴 , 𝐴) + (𝐵 , 𝐵)))
24	8, 16, 23	3eqtrd 2775	. 2 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → ((𝐴 + 𝐵) , (𝐴 + 𝐵)) = ((𝐴 , 𝐴) + (𝐵 , 𝐵)))
25		cphngp 25131	. . . . . 6 ⊢ (𝑊 ∈ ℂPreHil → 𝑊 ∈ NrmGrp)
26		ngpgrp 24545	. . . . . 6 ⊢ (𝑊 ∈ NrmGrp → 𝑊 ∈ Grp)
27	4, 25, 26	3syl 18	. . . . 5 ⊢ (𝜑 → 𝑊 ∈ Grp)
28	2, 3, 27, 5, 6	grpcld 18879	. . . 4 ⊢ (𝜑 → (𝐴 + 𝐵) ∈ 𝑉)
29		cphpyth.n	. . . . 5 ⊢ 𝑁 = (norm‘𝑊)
30	2, 1, 29	nmsq 25152	. . . 4 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 + 𝐵) ∈ 𝑉) → ((𝑁‘(𝐴 + 𝐵))↑2) = ((𝐴 + 𝐵) , (𝐴 + 𝐵)))
31	4, 28, 30	syl2anc 584	. . 3 ⊢ (𝜑 → ((𝑁‘(𝐴 + 𝐵))↑2) = ((𝐴 + 𝐵) , (𝐴 + 𝐵)))
32	31	adantr 480	. 2 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → ((𝑁‘(𝐴 + 𝐵))↑2) = ((𝐴 + 𝐵) , (𝐴 + 𝐵)))
33	2, 1, 29	nmsq 25152	. . . . 5 ⊢ ((𝑊 ∈ ℂPreHil ∧ 𝐴 ∈ 𝑉) → ((𝑁‘𝐴)↑2) = (𝐴 , 𝐴))
34	4, 5, 33	syl2anc 584	. . . 4 ⊢ (𝜑 → ((𝑁‘𝐴)↑2) = (𝐴 , 𝐴))
35	2, 1, 29	nmsq 25152	. . . . 5 ⊢ ((𝑊 ∈ ℂPreHil ∧ 𝐵 ∈ 𝑉) → ((𝑁‘𝐵)↑2) = (𝐵 , 𝐵))
36	4, 6, 35	syl2anc 584	. . . 4 ⊢ (𝜑 → ((𝑁‘𝐵)↑2) = (𝐵 , 𝐵))
37	34, 36	oveq12d 7376	. . 3 ⊢ (𝜑 → (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)) = ((𝐴 , 𝐴) + (𝐵 , 𝐵)))
38	37	adantr 480	. 2 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)) = ((𝐴 , 𝐴) + (𝐵 , 𝐵)))
39	24, 32, 38	3eqtr4d 2781	1 ⊢ ((𝜑 ∧ (𝐴 , 𝐵) = 0) → ((𝑁‘(𝐴 + 𝐵))↑2) = (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ‘cfv 6492 (class class class)co 7358 ℂcc 11026 0cc0 11028 + caddc 11031 2c2 12202 ↑cexp 13986 Basecbs 17138 +_gcplusg 17179 ·_𝑖cip 17184 Grpcgrp 18865 normcnm 24522 NrmGrpcngp 24523 ℂPreHilccph 25124

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 ax-addf 11107 ax-mulf 11108

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-tpos 8168 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8767 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-sup 9347 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12148 df-2 12210 df-3 12211 df-4 12212 df-5 12213 df-6 12214 df-7 12215 df-8 12216 df-9 12217 df-n0 12404 df-z 12491 df-dec 12610 df-uz 12754 df-rp 12908 df-fz 13426 df-seq 13927 df-exp 13987 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17139 df-ress 17160 df-plusg 17192 df-mulr 17193 df-starv 17194 df-sca 17195 df-vsca 17196 df-ip 17197 df-tset 17198 df-ple 17199 df-ds 17201 df-unif 17202 df-0g 17363 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-mhm 18710 df-grp 18868 df-minusg 18869 df-subg 19055 df-ghm 19144 df-cmn 19713 df-abl 19714 df-mgp 20078 df-rng 20090 df-ur 20119 df-ring 20172 df-cring 20173 df-oppr 20275 df-dvdsr 20295 df-unit 20296 df-rhm 20410 df-subrg 20505 df-drng 20666 df-staf 20774 df-srng 20775 df-lmod 20815 df-lmhm 20976 df-lvec 21057 df-sra 21127 df-rgmod 21128 df-cnfld 21312 df-phl 21583 df-ngp 24529 df-nlm 24532 df-clm 25021 df-cph 25126

This theorem is referenced by: (None)

W3C validator