| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pythi | Structured version Visualization version GIF version | ||
| Description: The Pythagorean theorem for an arbitrary complex inner product (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. (Contributed by NM, 17-Apr-2008.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| pyth.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| pyth.2 | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
| pyth.6 | ⊢ 𝑁 = (normCV‘𝑈) |
| pyth.7 | ⊢ 𝑃 = (·𝑖OLD‘𝑈) |
| pythi.u | ⊢ 𝑈 ∈ CPreHilOLD |
| pythi.a | ⊢ 𝐴 ∈ 𝑋 |
| pythi.b | ⊢ 𝐵 ∈ 𝑋 |
| Ref | Expression |
|---|---|
| pythi | ⊢ ((𝐴𝑃𝐵) = 0 → ((𝑁‘(𝐴𝐺𝐵))↑2) = (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pyth.1 | . . . 4 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 2 | pyth.2 | . . . 4 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 3 | pyth.7 | . . . 4 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
| 4 | pythi.u | . . . 4 ⊢ 𝑈 ∈ CPreHilOLD | |
| 5 | pythi.a | . . . 4 ⊢ 𝐴 ∈ 𝑋 | |
| 6 | pythi.b | . . . 4 ⊢ 𝐵 ∈ 𝑋 | |
| 7 | 1, 2, 3, 4, 5, 6, 5, 6 | ip2dii 31328 | . . 3 ⊢ ((𝐴𝐺𝐵)𝑃(𝐴𝐺𝐵)) = (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + ((𝐴𝑃𝐵) + (𝐵𝑃𝐴))) |
| 8 | id 23 | . . . . . . 7 ⊢ ((𝐴𝑃𝐵) = 0 → (𝐴𝑃𝐵) = 0) | |
| 9 | 4 | phnvi 31300 | . . . . . . . . 9 ⊢ 𝑈 ∈ NrmCVec |
| 10 | 1, 3 | diporthcom 31200 | . . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝑃𝐵) = 0 ↔ (𝐵𝑃𝐴) = 0)) |
| 11 | 9, 5, 6, 10 | mp3an 1490 | . . . . . . . 8 ⊢ ((𝐴𝑃𝐵) = 0 ↔ (𝐵𝑃𝐴) = 0) |
| 12 | 11 | biimpi 219 | . . . . . . 7 ⊢ ((𝐴𝑃𝐵) = 0 → (𝐵𝑃𝐴) = 0) |
| 13 | 8, 12 | oveq12d 7432 | . . . . . 6 ⊢ ((𝐴𝑃𝐵) = 0 → ((𝐴𝑃𝐵) + (𝐵𝑃𝐴)) = (0 + 0)) |
| 14 | 00id 11412 | . . . . . 6 ⊢ (0 + 0) = 0 | |
| 15 | 13, 14 | eqtrdi 2811 | . . . . 5 ⊢ ((𝐴𝑃𝐵) = 0 → ((𝐴𝑃𝐵) + (𝐵𝑃𝐴)) = 0) |
| 16 | 15 | oveq2d 7430 | . . . 4 ⊢ ((𝐴𝑃𝐵) = 0 → (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + ((𝐴𝑃𝐵) + (𝐵𝑃𝐴))) = (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + 0)) |
| 17 | 1, 3 | dipcl 31196 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐴) ∈ ℂ) |
| 18 | 9, 5, 5, 17 | mp3an 1490 | . . . . . 6 ⊢ (𝐴𝑃𝐴) ∈ ℂ |
| 19 | 1, 3 | dipcl 31196 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝑃𝐵) ∈ ℂ) |
| 20 | 9, 6, 6, 19 | mp3an 1490 | . . . . . 6 ⊢ (𝐵𝑃𝐵) ∈ ℂ |
| 21 | 18, 20 | addcli 11242 | . . . . 5 ⊢ ((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) ∈ ℂ |
| 22 | 21 | addridi 11424 | . . . 4 ⊢ (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + 0) = ((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) |
| 23 | 16, 22 | eqtrdi 2811 | . . 3 ⊢ ((𝐴𝑃𝐵) = 0 → (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + ((𝐴𝑃𝐵) + (𝐵𝑃𝐴))) = ((𝐴𝑃𝐴) + (𝐵𝑃𝐵))) |
| 24 | 7, 23 | eqtrid 2807 | . 2 ⊢ ((𝐴𝑃𝐵) = 0 → ((𝐴𝐺𝐵)𝑃(𝐴𝐺𝐵)) = ((𝐴𝑃𝐴) + (𝐵𝑃𝐵))) |
| 25 | 1, 2 | nvgcl 31104 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋) |
| 26 | 9, 5, 6, 25 | mp3an 1490 | . . 3 ⊢ (𝐴𝐺𝐵) ∈ 𝑋 |
| 27 | pyth.6 | . . . 4 ⊢ 𝑁 = (normCV‘𝑈) | |
| 28 | 1, 27, 3 | ipidsq 31194 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝐺𝐵) ∈ 𝑋) → ((𝐴𝐺𝐵)𝑃(𝐴𝐺𝐵)) = ((𝑁‘(𝐴𝐺𝐵))↑2)) |
| 29 | 9, 26, 28 | mp2an 705 | . 2 ⊢ ((𝐴𝐺𝐵)𝑃(𝐴𝐺𝐵)) = ((𝑁‘(𝐴𝐺𝐵))↑2) |
| 30 | 1, 27, 3 | ipidsq 31194 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐴) = ((𝑁‘𝐴)↑2)) |
| 31 | 9, 5, 30 | mp2an 705 | . . 3 ⊢ (𝐴𝑃𝐴) = ((𝑁‘𝐴)↑2) |
| 32 | 1, 27, 3 | ipidsq 31194 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (𝐵𝑃𝐵) = ((𝑁‘𝐵)↑2)) |
| 33 | 9, 6, 32 | mp2an 705 | . . 3 ⊢ (𝐵𝑃𝐵) = ((𝑁‘𝐵)↑2) |
| 34 | 31, 33 | oveq12i 7426 | . 2 ⊢ ((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) = (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)) |
| 35 | 24, 29, 34 | 3eqtr3g 2818 | 1 ⊢ ((𝐴𝑃𝐵) = 0 → ((𝑁‘(𝐴𝐺𝐵))↑2) = (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7414 ℂcc 11125 0cc0 11127 + caddc 11130 2c2 12322 ↑cexp 14128 NrmCVeccnv 31068 +𝑣 cpv 31069 BaseSetcba 31070 normCVcnmcv 31074 ·𝑖OLDcdip 31184 CPreHilOLDccphlo 31296 |
| 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 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-inf2 9623 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 ax-addf 11206 ax-mulf 11207 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 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-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8458 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-sup 9415 df-oi 9485 df-card 9947 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-n0 12532 df-z 12619 df-uz 12891 df-rp 13046 df-fz 13565 df-fzo 13713 df-seq 14069 df-exp 14129 df-hash 14398 df-cj 15189 df-re 15190 df-im 15191 df-sqrt 15325 df-abs 15326 df-clim 15578 df-sum 15777 df-grpo 30977 df-gid 30978 df-ginv 30979 df-ablo 31029 df-vc 31043 df-nv 31076 df-va 31079 df-ba 31080 df-sm 31081 df-0v 31082 df-nmcv 31084 df-dip 31185 df-ph 31297 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |