| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > norm3difi | Structured version Visualization version GIF version | ||
| Description: Norm of differences around common element. Part of Lemma 3.6 of [Beran] p. 101. (Contributed by NM, 16-Aug-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| norm3dif.1 | ⊢ 𝐴 ∈ ℋ |
| norm3dif.2 | ⊢ 𝐵 ∈ ℋ |
| norm3dif.3 | ⊢ 𝐶 ∈ ℋ |
| Ref | Expression |
|---|---|
| norm3difi | ⊢ (normℎ‘(𝐴 −ℎ 𝐵)) ≤ ((normℎ‘(𝐴 −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | norm3dif.1 | . . . . 5 ⊢ 𝐴 ∈ ℋ | |
| 2 | norm3dif.2 | . . . . 5 ⊢ 𝐵 ∈ ℋ | |
| 3 | 1, 2 | hvsubvali 31615 | . . . 4 ⊢ (𝐴 −ℎ 𝐵) = (𝐴 +ℎ (-1 ·ℎ 𝐵)) |
| 4 | norm3dif.3 | . . . . . . 7 ⊢ 𝐶 ∈ ℋ | |
| 5 | 1, 4 | hvsubvali 31615 | . . . . . 6 ⊢ (𝐴 −ℎ 𝐶) = (𝐴 +ℎ (-1 ·ℎ 𝐶)) |
| 6 | 4, 2 | hvsubvali 31615 | . . . . . 6 ⊢ (𝐶 −ℎ 𝐵) = (𝐶 +ℎ (-1 ·ℎ 𝐵)) |
| 7 | 5, 6 | oveq12i 7430 | . . . . 5 ⊢ ((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵)) = ((𝐴 +ℎ (-1 ·ℎ 𝐶)) +ℎ (𝐶 +ℎ (-1 ·ℎ 𝐵))) |
| 8 | neg1cn 12298 | . . . . . . 7 ⊢ -1 ∈ ℂ | |
| 9 | 8, 4 | hvmulcli 31609 | . . . . . 6 ⊢ (-1 ·ℎ 𝐶) ∈ ℋ |
| 10 | 8, 2 | hvmulcli 31609 | . . . . . . 7 ⊢ (-1 ·ℎ 𝐵) ∈ ℋ |
| 11 | 4, 10 | hvaddcli 31613 | . . . . . 6 ⊢ (𝐶 +ℎ (-1 ·ℎ 𝐵)) ∈ ℋ |
| 12 | 1, 9, 11 | hvassi 31648 | . . . . 5 ⊢ ((𝐴 +ℎ (-1 ·ℎ 𝐶)) +ℎ (𝐶 +ℎ (-1 ·ℎ 𝐵))) = (𝐴 +ℎ ((-1 ·ℎ 𝐶) +ℎ (𝐶 +ℎ (-1 ·ℎ 𝐵)))) |
| 13 | 9, 4, 10 | hvassi 31648 | . . . . . . 7 ⊢ (((-1 ·ℎ 𝐶) +ℎ 𝐶) +ℎ (-1 ·ℎ 𝐵)) = ((-1 ·ℎ 𝐶) +ℎ (𝐶 +ℎ (-1 ·ℎ 𝐵))) |
| 14 | 9, 4 | hvcomi 31614 | . . . . . . . . . 10 ⊢ ((-1 ·ℎ 𝐶) +ℎ 𝐶) = (𝐶 +ℎ (-1 ·ℎ 𝐶)) |
| 15 | 4, 4 | hvsubvali 31615 | . . . . . . . . . 10 ⊢ (𝐶 −ℎ 𝐶) = (𝐶 +ℎ (-1 ·ℎ 𝐶)) |
| 16 | hvsubid 31621 | . . . . . . . . . . 11 ⊢ (𝐶 ∈ ℋ → (𝐶 −ℎ 𝐶) = 0ℎ) | |
| 17 | 4, 16 | ax-mp 5 | . . . . . . . . . 10 ⊢ (𝐶 −ℎ 𝐶) = 0ℎ |
| 18 | 14, 15, 17 | 3eqtr2i 2790 | . . . . . . . . 9 ⊢ ((-1 ·ℎ 𝐶) +ℎ 𝐶) = 0ℎ |
| 19 | 18 | oveq1i 7428 | . . . . . . . 8 ⊢ (((-1 ·ℎ 𝐶) +ℎ 𝐶) +ℎ (-1 ·ℎ 𝐵)) = (0ℎ +ℎ (-1 ·ℎ 𝐵)) |
| 20 | ax-hv0cl 31598 | . . . . . . . . 9 ⊢ 0ℎ ∈ ℋ | |
| 21 | 20, 10 | hvcomi 31614 | . . . . . . . 8 ⊢ (0ℎ +ℎ (-1 ·ℎ 𝐵)) = ((-1 ·ℎ 𝐵) +ℎ 0ℎ) |
| 22 | ax-hvaddid 31599 | . . . . . . . . 9 ⊢ ((-1 ·ℎ 𝐵) ∈ ℋ → ((-1 ·ℎ 𝐵) +ℎ 0ℎ) = (-1 ·ℎ 𝐵)) | |
| 23 | 10, 22 | ax-mp 5 | . . . . . . . 8 ⊢ ((-1 ·ℎ 𝐵) +ℎ 0ℎ) = (-1 ·ℎ 𝐵) |
| 24 | 19, 21, 23 | 3eqtri 2788 | . . . . . . 7 ⊢ (((-1 ·ℎ 𝐶) +ℎ 𝐶) +ℎ (-1 ·ℎ 𝐵)) = (-1 ·ℎ 𝐵) |
| 25 | 13, 24 | eqtr3i 2786 | . . . . . 6 ⊢ ((-1 ·ℎ 𝐶) +ℎ (𝐶 +ℎ (-1 ·ℎ 𝐵))) = (-1 ·ℎ 𝐵) |
| 26 | 25 | oveq2i 7429 | . . . . 5 ⊢ (𝐴 +ℎ ((-1 ·ℎ 𝐶) +ℎ (𝐶 +ℎ (-1 ·ℎ 𝐵)))) = (𝐴 +ℎ (-1 ·ℎ 𝐵)) |
| 27 | 7, 12, 26 | 3eqtri 2788 | . . . 4 ⊢ ((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵)) = (𝐴 +ℎ (-1 ·ℎ 𝐵)) |
| 28 | 3, 27 | eqtr4i 2787 | . . 3 ⊢ (𝐴 −ℎ 𝐵) = ((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵)) |
| 29 | 28 | fveq2i 6886 | . 2 ⊢ (normℎ‘(𝐴 −ℎ 𝐵)) = (normℎ‘((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵))) |
| 30 | 1, 4 | hvsubcli 31616 | . . 3 ⊢ (𝐴 −ℎ 𝐶) ∈ ℋ |
| 31 | 4, 2 | hvsubcli 31616 | . . 3 ⊢ (𝐶 −ℎ 𝐵) ∈ ℋ |
| 32 | 30, 31 | norm-ii-i 31732 | . 2 ⊢ (normℎ‘((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵))) ≤ ((normℎ‘(𝐴 −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))) |
| 33 | 29, 32 | eqbrtri 5126 | 1 ⊢ (normℎ‘(𝐴 −ℎ 𝐵)) ≤ ((normℎ‘(𝐴 −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6537 (class class class)co 7418 1c1 11194 + caddc 11196 ≤ cle 11337 -cneg 11535 ℋchba 31514 +ℎ cva 31515 ·ℎ csm 31516 normℎcno 31518 0ℎc0v 31519 −ℎ cmv 31520 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-pre-sup 11271 ax-hfvadd 31595 ax-hvcom 31596 ax-hvass 31597 ax-hv0cl 31598 ax-hvaddid 31599 ax-hfvmul 31600 ax-hvmulid 31601 ax-hvmulass 31602 ax-hvdistr2 31604 ax-hvmul0 31605 ax-hfi 31674 ax-his1 31677 ax-his2 31678 ax-his3 31679 ax-his4 31680 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 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-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-sup 9427 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-div 11967 df-nn 12329 df-2 12398 df-3 12399 df-4 12400 df-n0 12600 df-z 12687 df-uz 12959 df-rp 13114 df-seq 14138 df-exp 14198 df-cj 15259 df-re 15260 df-im 15261 df-sqrt 15395 df-abs 15396 df-hnorm 31563 df-hvsub 31566 |
| This theorem is used by: norm3adifii 31743 norm3lem 31744 norm3dif 31745 |
| Copyright terms: Public domain | W3C validator |