| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > normpyc | Structured version Visualization version GIF version | ||
| Description: Corollary to Pythagorean theorem for orthogonal vectors. Remark 3.4(C) of [Beran] p. 98. (Contributed by NM, 26-Oct-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| normpyc | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih 𝐵) = 0 → (normℎ‘𝐴) ≤ (normℎ‘(𝐴 +ℎ 𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | normcl 31211 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℋ → (normℎ‘𝐴) ∈ ℝ) | |
| 2 | 1 | resqcld 14078 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℋ → ((normℎ‘𝐴)↑2) ∈ ℝ) |
| 3 | 2 | recnd 11164 | . . . . . . . 8 ⊢ (𝐴 ∈ ℋ → ((normℎ‘𝐴)↑2) ∈ ℂ) |
| 4 | 3 | addridd 11337 | . . . . . . 7 ⊢ (𝐴 ∈ ℋ → (((normℎ‘𝐴)↑2) + 0) = ((normℎ‘𝐴)↑2)) |
| 5 | 4 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((normℎ‘𝐴)↑2) + 0) = ((normℎ‘𝐴)↑2)) |
| 6 | normcl 31211 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℋ → (normℎ‘𝐵) ∈ ℝ) | |
| 7 | 6 | sqge0d 14090 | . . . . . . . 8 ⊢ (𝐵 ∈ ℋ → 0 ≤ ((normℎ‘𝐵)↑2)) |
| 8 | 7 | adantl 481 | . . . . . . 7 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → 0 ≤ ((normℎ‘𝐵)↑2)) |
| 9 | 6 | resqcld 14078 | . . . . . . . 8 ⊢ (𝐵 ∈ ℋ → ((normℎ‘𝐵)↑2) ∈ ℝ) |
| 10 | 0re 11137 | . . . . . . . . 9 ⊢ 0 ∈ ℝ | |
| 11 | leadd2 11610 | . . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ ((normℎ‘𝐵)↑2) ∈ ℝ ∧ ((normℎ‘𝐴)↑2) ∈ ℝ) → (0 ≤ ((normℎ‘𝐵)↑2) ↔ (((normℎ‘𝐴)↑2) + 0) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2)))) | |
| 12 | 10, 11 | mp3an1 1451 | . . . . . . . 8 ⊢ ((((normℎ‘𝐵)↑2) ∈ ℝ ∧ ((normℎ‘𝐴)↑2) ∈ ℝ) → (0 ≤ ((normℎ‘𝐵)↑2) ↔ (((normℎ‘𝐴)↑2) + 0) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2)))) |
| 13 | 9, 2, 12 | syl2anr 598 | . . . . . . 7 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (0 ≤ ((normℎ‘𝐵)↑2) ↔ (((normℎ‘𝐴)↑2) + 0) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2)))) |
| 14 | 8, 13 | mpbid 232 | . . . . . 6 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((normℎ‘𝐴)↑2) + 0) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2))) |
| 15 | 5, 14 | eqbrtrrd 5110 | . . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((normℎ‘𝐴)↑2) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2))) |
| 16 | 15 | adantr 480 | . . . 4 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐴 ·ih 𝐵) = 0) → ((normℎ‘𝐴)↑2) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2))) |
| 17 | normpyth 31231 | . . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih 𝐵) = 0 → ((normℎ‘(𝐴 +ℎ 𝐵))↑2) = (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2)))) | |
| 18 | 17 | imp 406 | . . . 4 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐴 ·ih 𝐵) = 0) → ((normℎ‘(𝐴 +ℎ 𝐵))↑2) = (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2))) |
| 19 | 16, 18 | breqtrrd 5114 | . . 3 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐴 ·ih 𝐵) = 0) → ((normℎ‘𝐴)↑2) ≤ ((normℎ‘(𝐴 +ℎ 𝐵))↑2)) |
| 20 | 19 | ex 412 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih 𝐵) = 0 → ((normℎ‘𝐴)↑2) ≤ ((normℎ‘(𝐴 +ℎ 𝐵))↑2))) |
| 21 | 1 | adantr 480 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (normℎ‘𝐴) ∈ ℝ) |
| 22 | hvaddcl 31098 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 +ℎ 𝐵) ∈ ℋ) | |
| 23 | normcl 31211 | . . . 4 ⊢ ((𝐴 +ℎ 𝐵) ∈ ℋ → (normℎ‘(𝐴 +ℎ 𝐵)) ∈ ℝ) | |
| 24 | 22, 23 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (normℎ‘(𝐴 +ℎ 𝐵)) ∈ ℝ) |
| 25 | normge0 31212 | . . . 4 ⊢ (𝐴 ∈ ℋ → 0 ≤ (normℎ‘𝐴)) | |
| 26 | 25 | adantr 480 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → 0 ≤ (normℎ‘𝐴)) |
| 27 | normge0 31212 | . . . 4 ⊢ ((𝐴 +ℎ 𝐵) ∈ ℋ → 0 ≤ (normℎ‘(𝐴 +ℎ 𝐵))) | |
| 28 | 22, 27 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → 0 ≤ (normℎ‘(𝐴 +ℎ 𝐵))) |
| 29 | 21, 24, 26, 28 | le2sqd 14210 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((normℎ‘𝐴) ≤ (normℎ‘(𝐴 +ℎ 𝐵)) ↔ ((normℎ‘𝐴)↑2) ≤ ((normℎ‘(𝐴 +ℎ 𝐵))↑2))) |
| 30 | 20, 29 | sylibrd 259 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih 𝐵) = 0 → (normℎ‘𝐴) ≤ (normℎ‘(𝐴 +ℎ 𝐵)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6492 (class class class)co 7360 ℝcr 11028 0cc0 11029 + caddc 11032 ≤ cle 11171 2c2 12227 ↑cexp 14014 ℋchba 31005 +ℎ cva 31006 ·ih csp 31008 normℎcno 31009 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 ax-hfvadd 31086 ax-hv0cl 31089 ax-hvmul0 31096 ax-hfi 31165 ax-his1 31168 ax-his2 31169 ax-his3 31170 ax-his4 31171 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 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 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-sup 9348 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-seq 13955 df-exp 14015 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-hnorm 31054 |
| This theorem is referenced by: pjnormi 31807 |
| Copyright terms: Public domain | W3C validator |