| 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 31461 | . . 3 ⊢ ((𝐴𝐺𝐵)𝑃(𝐴𝐺𝐵)) = (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + ((𝐴𝑃𝐵) + (𝐵𝑃𝐴))) |
| 8 | id 23 | . . . . . . 7 ⊢ ((𝐴𝑃𝐵) = 0 → (𝐴𝑃𝐵) = 0) | |
| 9 | 4 | phnvi 31433 | . . . . . . . . 9 ⊢ 𝑈 ∈ NrmCVec |
| 10 | 1, 3 | diporthcom 31333 | . . . . . . . . 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 7448 | . . . . . 6 ⊢ ((𝐴𝑃𝐵) = 0 → ((𝐴𝑃𝐵) + (𝐵𝑃𝐴)) = (0 + 0)) |
| 14 | 00id 11498 | . . . . . 6 ⊢ (0 + 0) = 0 | |
| 15 | 13, 14 | eqtrdi 2814 | . . . . 5 ⊢ ((𝐴𝑃𝐵) = 0 → ((𝐴𝑃𝐵) + (𝐵𝑃𝐴)) = 0) |
| 16 | 15 | oveq2d 7446 | . . . 4 ⊢ ((𝐴𝑃𝐵) = 0 → (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + ((𝐴𝑃𝐵) + (𝐵𝑃𝐴))) = (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + 0)) |
| 17 | 1, 3 | dipcl 31329 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐴) ∈ ℂ) |
| 18 | 9, 5, 5, 17 | mp3an 1490 | . . . . . 6 ⊢ (𝐴𝑃𝐴) ∈ ℂ |
| 19 | 1, 3 | dipcl 31329 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝑃𝐵) ∈ ℂ) |
| 20 | 9, 6, 6, 19 | mp3an 1490 | . . . . . 6 ⊢ (𝐵𝑃𝐵) ∈ ℂ |
| 21 | 18, 20 | addcli 11328 | . . . . 5 ⊢ ((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) ∈ ℂ |
| 22 | 21 | addridi 11510 | . . . 4 ⊢ (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + 0) = ((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) |
| 23 | 16, 22 | eqtrdi 2814 | . . 3 ⊢ ((𝐴𝑃𝐵) = 0 → (((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) + ((𝐴𝑃𝐵) + (𝐵𝑃𝐴))) = ((𝐴𝑃𝐴) + (𝐵𝑃𝐵))) |
| 24 | 7, 23 | eqtrid 2810 | . 2 ⊢ ((𝐴𝑃𝐵) = 0 → ((𝐴𝐺𝐵)𝑃(𝐴𝐺𝐵)) = ((𝐴𝑃𝐴) + (𝐵𝑃𝐵))) |
| 25 | 1, 2 | nvgcl 31237 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋) |
| 26 | 9, 5, 6, 25 | mp3an 1490 | . . 3 ⊢ (𝐴𝐺𝐵) ∈ 𝑋 |
| 27 | pyth.6 | . . . 4 ⊢ 𝑁 = (normCV‘𝑈) | |
| 28 | 1, 27, 3 | ipidsq 31327 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝐺𝐵) ∈ 𝑋) → ((𝐴𝐺𝐵)𝑃(𝐴𝐺𝐵)) = ((𝑁‘(𝐴𝐺𝐵))↑2)) |
| 29 | 9, 26, 28 | mp2an 705 | . 2 ⊢ ((𝐴𝐺𝐵)𝑃(𝐴𝐺𝐵)) = ((𝑁‘(𝐴𝐺𝐵))↑2) |
| 30 | 1, 27, 3 | ipidsq 31327 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐴) = ((𝑁‘𝐴)↑2)) |
| 31 | 9, 5, 30 | mp2an 705 | . . 3 ⊢ (𝐴𝑃𝐴) = ((𝑁‘𝐴)↑2) |
| 32 | 1, 27, 3 | ipidsq 31327 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (𝐵𝑃𝐵) = ((𝑁‘𝐵)↑2)) |
| 33 | 9, 6, 32 | mp2an 705 | . . 3 ⊢ (𝐵𝑃𝐵) = ((𝑁‘𝐵)↑2) |
| 34 | 31, 33 | oveq12i 7442 | . 2 ⊢ ((𝐴𝑃𝐴) + (𝐵𝑃𝐵)) = (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2)) |
| 35 | 24, 29, 34 | 3eqtr3g 2821 | 1 ⊢ ((𝐴𝑃𝐵) = 0 → ((𝑁‘(𝐴𝐺𝐵))↑2) = (((𝑁‘𝐴)↑2) + ((𝑁‘𝐵)↑2))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2146 ‘cfv 6547 (class class class)co 7430 ℂcc 11211 0cc0 11213 + caddc 11216 2c2 12410 ↑cexp 14217 NrmCVeccnv 31201 +𝑣 cpv 31202 BaseSetcba 31203 normCVcnmcv 31207 ·𝑖OLDcdip 31317 CPreHilOLDccphlo 31429 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-inf2 9655 ax-cnex 11269 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-mulcom 11277 ax-addass 11278 ax-mulass 11279 ax-distr 11280 ax-i2m1 11281 ax-1ne0 11282 ax-1rid 11283 ax-rnegex 11284 ax-rrecex 11285 ax-cnre 11286 ax-pre-lttri 11287 ax-pre-lttrn 11288 ax-pre-ltadd 11289 ax-pre-mulgt0 11290 ax-pre-sup 11291 ax-addf 11292 ax-mulf 11293 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 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 6311 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-isom 6556 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7888 df-1st 8011 df-2nd 8012 df-frecs 8313 df-wrecs 8344 df-recs 8393 df-rdg 8432 df-1o 8490 df-er 8731 df-en 8988 df-dom 8989 df-sdom 8990 df-fin 8991 df-sup 9447 df-oi 9517 df-card 10033 df-pnf 11358 df-mnf 11359 df-xr 11360 df-ltxr 11361 df-le 11362 df-sub 11556 df-neg 11557 df-div 11987 df-nn 12349 df-2 12418 df-3 12419 df-4 12420 df-n0 12620 df-z 12707 df-uz 12979 df-rp 13134 df-fz 13653 df-fzo 13802 df-seq 14158 df-exp 14218 df-hash 14488 df-cj 15281 df-re 15282 df-im 15283 df-sqrt 15417 df-abs 15418 df-clim 15670 df-sum 15869 df-grpo 31110 df-gid 31111 df-ginv 31112 df-ablo 31162 df-vc 31176 df-nv 31209 df-va 31212 df-ba 31213 df-sm 31214 df-0v 31215 df-nmcv 31217 df-dip 31318 df-ph 31430 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |