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 29716 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℋ → (normℎ‘𝐴) ∈ ℝ) | |
2 | 1 | resqcld 14058 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℋ → ((normℎ‘𝐴)↑2) ∈ ℝ) |
3 | 2 | recnd 11096 | . . . . . . . 8 ⊢ (𝐴 ∈ ℋ → ((normℎ‘𝐴)↑2) ∈ ℂ) |
4 | 3 | addid1d 11268 | . . . . . . 7 ⊢ (𝐴 ∈ ℋ → (((normℎ‘𝐴)↑2) + 0) = ((normℎ‘𝐴)↑2)) |
5 | 4 | adantr 481 | . . . . . 6 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((normℎ‘𝐴)↑2) + 0) = ((normℎ‘𝐴)↑2)) |
6 | normcl 29716 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℋ → (normℎ‘𝐵) ∈ ℝ) | |
7 | 6 | sqge0d 14059 | . . . . . . . 8 ⊢ (𝐵 ∈ ℋ → 0 ≤ ((normℎ‘𝐵)↑2)) |
8 | 7 | adantl 482 | . . . . . . 7 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → 0 ≤ ((normℎ‘𝐵)↑2)) |
9 | 6 | resqcld 14058 | . . . . . . . 8 ⊢ (𝐵 ∈ ℋ → ((normℎ‘𝐵)↑2) ∈ ℝ) |
10 | 0re 11070 | . . . . . . . . 9 ⊢ 0 ∈ ℝ | |
11 | leadd2 11537 | . . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ ((normℎ‘𝐵)↑2) ∈ ℝ ∧ ((normℎ‘𝐴)↑2) ∈ ℝ) → (0 ≤ ((normℎ‘𝐵)↑2) ↔ (((normℎ‘𝐴)↑2) + 0) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2)))) | |
12 | 10, 11 | mp3an1 1447 | . . . . . . . 8 ⊢ ((((normℎ‘𝐵)↑2) ∈ ℝ ∧ ((normℎ‘𝐴)↑2) ∈ ℝ) → (0 ≤ ((normℎ‘𝐵)↑2) ↔ (((normℎ‘𝐴)↑2) + 0) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2)))) |
13 | 9, 2, 12 | syl2anr 597 | . . . . . . 7 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (0 ≤ ((normℎ‘𝐵)↑2) ↔ (((normℎ‘𝐴)↑2) + 0) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2)))) |
14 | 8, 13 | mpbid 231 | . . . . . 6 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((normℎ‘𝐴)↑2) + 0) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2))) |
15 | 5, 14 | eqbrtrrd 5113 | . . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((normℎ‘𝐴)↑2) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2))) |
16 | 15 | adantr 481 | . . . 4 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐴 ·ih 𝐵) = 0) → ((normℎ‘𝐴)↑2) ≤ (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2))) |
17 | normpyth 29736 | . . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih 𝐵) = 0 → ((normℎ‘(𝐴 +ℎ 𝐵))↑2) = (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2)))) | |
18 | 17 | imp 407 | . . . 4 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐴 ·ih 𝐵) = 0) → ((normℎ‘(𝐴 +ℎ 𝐵))↑2) = (((normℎ‘𝐴)↑2) + ((normℎ‘𝐵)↑2))) |
19 | 16, 18 | breqtrrd 5117 | . . 3 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐴 ·ih 𝐵) = 0) → ((normℎ‘𝐴)↑2) ≤ ((normℎ‘(𝐴 +ℎ 𝐵))↑2)) |
20 | 19 | ex 413 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih 𝐵) = 0 → ((normℎ‘𝐴)↑2) ≤ ((normℎ‘(𝐴 +ℎ 𝐵))↑2))) |
21 | 1 | adantr 481 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (normℎ‘𝐴) ∈ ℝ) |
22 | hvaddcl 29603 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 +ℎ 𝐵) ∈ ℋ) | |
23 | normcl 29716 | . . . 4 ⊢ ((𝐴 +ℎ 𝐵) ∈ ℋ → (normℎ‘(𝐴 +ℎ 𝐵)) ∈ ℝ) | |
24 | 22, 23 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (normℎ‘(𝐴 +ℎ 𝐵)) ∈ ℝ) |
25 | normge0 29717 | . . . 4 ⊢ (𝐴 ∈ ℋ → 0 ≤ (normℎ‘𝐴)) | |
26 | 25 | adantr 481 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → 0 ≤ (normℎ‘𝐴)) |
27 | normge0 29717 | . . . 4 ⊢ ((𝐴 +ℎ 𝐵) ∈ ℋ → 0 ≤ (normℎ‘(𝐴 +ℎ 𝐵))) | |
28 | 22, 27 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → 0 ≤ (normℎ‘(𝐴 +ℎ 𝐵))) |
29 | 21, 24, 26, 28 | le2sqd 14067 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((normℎ‘𝐴) ≤ (normℎ‘(𝐴 +ℎ 𝐵)) ↔ ((normℎ‘𝐴)↑2) ≤ ((normℎ‘(𝐴 +ℎ 𝐵))↑2))) |
30 | 20, 29 | sylibrd 258 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih 𝐵) = 0 → (normℎ‘𝐴) ≤ (normℎ‘(𝐴 +ℎ 𝐵)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1540 ∈ wcel 2105 class class class wbr 5089 ‘cfv 6473 (class class class)co 7329 ℝcr 10963 0cc0 10964 + caddc 10967 ≤ cle 11103 2c2 12121 ↑cexp 13875 ℋchba 29510 +ℎ cva 29511 ·ih csp 29513 normℎcno 29514 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-sep 5240 ax-nul 5247 ax-pow 5305 ax-pr 5369 ax-un 7642 ax-cnex 11020 ax-resscn 11021 ax-1cn 11022 ax-icn 11023 ax-addcl 11024 ax-addrcl 11025 ax-mulcl 11026 ax-mulrcl 11027 ax-mulcom 11028 ax-addass 11029 ax-mulass 11030 ax-distr 11031 ax-i2m1 11032 ax-1ne0 11033 ax-1rid 11034 ax-rnegex 11035 ax-rrecex 11036 ax-cnre 11037 ax-pre-lttri 11038 ax-pre-lttrn 11039 ax-pre-ltadd 11040 ax-pre-mulgt0 11041 ax-pre-sup 11042 ax-hfvadd 29591 ax-hv0cl 29594 ax-hvmul0 29601 ax-hfi 29670 ax-his1 29673 ax-his2 29674 ax-his3 29675 ax-his4 29676 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3349 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3727 df-csb 3843 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3916 df-nul 4269 df-if 4473 df-pw 4548 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4852 df-iun 4940 df-br 5090 df-opab 5152 df-mpt 5173 df-tr 5207 df-id 5512 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5569 df-we 5571 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6232 df-ord 6299 df-on 6300 df-lim 6301 df-suc 6302 df-iota 6425 df-fun 6475 df-fn 6476 df-f 6477 df-f1 6478 df-fo 6479 df-f1o 6480 df-fv 6481 df-riota 7286 df-ov 7332 df-oprab 7333 df-mpo 7334 df-om 7773 df-2nd 7892 df-frecs 8159 df-wrecs 8190 df-recs 8264 df-rdg 8303 df-er 8561 df-en 8797 df-dom 8798 df-sdom 8799 df-sup 9291 df-pnf 11104 df-mnf 11105 df-xr 11106 df-ltxr 11107 df-le 11108 df-sub 11300 df-neg 11301 df-div 11726 df-nn 12067 df-2 12129 df-3 12130 df-n0 12327 df-z 12413 df-uz 12676 df-rp 12824 df-seq 13815 df-exp 13876 df-cj 14901 df-re 14902 df-im 14903 df-sqrt 15037 df-hnorm 29559 |
This theorem is referenced by: pjnormi 30312 |
Copyright terms: Public domain | W3C validator |