| 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 31679 | . . . 4 ⊢ (𝐴 −ℎ 𝐵) = (𝐴 +ℎ ( -1 ·ℎ 𝐵)) |
| 4 | norm3dif.3 | . . . . . . 7 ⊢ 𝐶 ∈ ℋ | |
| 5 | 1, 4 | hvsubvali 31679 | . . . . . 6 ⊢ (𝐴 −ℎ 𝐶) = (𝐴 +ℎ ( -1 ·ℎ 𝐶)) |
| 6 | 4, 2 | hvsubvali 31679 | . . . . . 6 ⊢ (𝐶 −ℎ 𝐵) = (𝐶 +ℎ ( -1 ·ℎ 𝐵)) |
| 7 | 5, 6 | oveq12i 7463 | . . . . 5 ⊢ ((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵)) = ((𝐴 +ℎ ( -1 ·ℎ 𝐶)) +ℎ (𝐶 +ℎ ( -1 ·ℎ 𝐵))) |
| 8 | neg1cn 12345 | . . . . . . 7 ⊢ -1 ∈ ℂ | |
| 9 | 8, 4 | hvmulcli 31673 | . . . . . 6 ⊢ ( -1 ·ℎ 𝐶) ∈ ℋ |
| 10 | 8, 2 | hvmulcli 31673 | . . . . . . 7 ⊢ ( -1 ·ℎ 𝐵) ∈ ℋ |
| 11 | 4, 10 | hvaddcli 31677 | . . . . . 6 ⊢ (𝐶 +ℎ ( -1 ·ℎ 𝐵)) ∈ ℋ |
| 12 | 1, 9, 11 | hvassi 31712 | . . . . 5 ⊢ ((𝐴 +ℎ ( -1 ·ℎ 𝐶)) +ℎ (𝐶 +ℎ ( -1 ·ℎ 𝐵))) = (𝐴 +ℎ (( -1 ·ℎ 𝐶) +ℎ (𝐶 +ℎ ( -1 ·ℎ 𝐵)))) |
| 13 | 9, 4, 10 | hvassi 31712 | . . . . . . 7 ⊢ ((( -1 ·ℎ 𝐶) +ℎ 𝐶) +ℎ ( -1 ·ℎ 𝐵)) = (( -1 ·ℎ 𝐶) +ℎ (𝐶 +ℎ ( -1 ·ℎ 𝐵))) |
| 14 | 9, 4 | hvcomi 31678 | . . . . . . . . . 10 ⊢ (( -1 ·ℎ 𝐶) +ℎ 𝐶) = (𝐶 +ℎ ( -1 ·ℎ 𝐶)) |
| 15 | 4, 4 | hvsubvali 31679 | . . . . . . . . . 10 ⊢ (𝐶 −ℎ 𝐶) = (𝐶 +ℎ ( -1 ·ℎ 𝐶)) |
| 16 | hvsubid 31685 | . . . . . . . . . . 11 ⊢ (𝐶 ∈ ℋ → (𝐶 −ℎ 𝐶) = 0ℎ) | |
| 17 | 4, 16 | ax-mp 5 | . . . . . . . . . 10 ⊢ (𝐶 −ℎ 𝐶) = 0ℎ |
| 18 | 14, 15, 17 | 3eqtr2i 2792 | . . . . . . . . 9 ⊢ (( -1 ·ℎ 𝐶) +ℎ 𝐶) = 0ℎ |
| 19 | 18 | oveq1i 7461 | . . . . . . . 8 ⊢ ((( -1 ·ℎ 𝐶) +ℎ 𝐶) +ℎ ( -1 ·ℎ 𝐵)) = (0ℎ +ℎ ( -1 ·ℎ 𝐵)) |
| 20 | ax-hv0cl 31662 | . . . . . . . . 9 ⊢ 0ℎ ∈ ℋ | |
| 21 | 20, 10 | hvcomi 31678 | . . . . . . . 8 ⊢ (0ℎ +ℎ ( -1 ·ℎ 𝐵)) = (( -1 ·ℎ 𝐵) +ℎ 0ℎ) |
| 22 | ax-hvaddid 31663 | . . . . . . . . 9 ⊢ (( -1 ·ℎ 𝐵) ∈ ℋ → (( -1 ·ℎ 𝐵) +ℎ 0ℎ) = ( -1 ·ℎ 𝐵)) | |
| 23 | 10, 22 | ax-mp 5 | . . . . . . . 8 ⊢ (( -1 ·ℎ 𝐵) +ℎ 0ℎ) = ( -1 ·ℎ 𝐵) |
| 24 | 19, 21, 23 | 3eqtri 2790 | . . . . . . 7 ⊢ ((( -1 ·ℎ 𝐶) +ℎ 𝐶) +ℎ ( -1 ·ℎ 𝐵)) = ( -1 ·ℎ 𝐵) |
| 25 | 13, 24 | eqtr3i 2788 | . . . . . 6 ⊢ (( -1 ·ℎ 𝐶) +ℎ (𝐶 +ℎ ( -1 ·ℎ 𝐵))) = ( -1 ·ℎ 𝐵) |
| 26 | 25 | oveq2i 7462 | . . . . 5 ⊢ (𝐴 +ℎ (( -1 ·ℎ 𝐶) +ℎ (𝐶 +ℎ ( -1 ·ℎ 𝐵)))) = (𝐴 +ℎ ( -1 ·ℎ 𝐵)) |
| 27 | 7, 12, 26 | 3eqtri 2790 | . . . 4 ⊢ ((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵)) = (𝐴 +ℎ ( -1 ·ℎ 𝐵)) |
| 28 | 3, 27 | eqtr4i 2789 | . . 3 ⊢ (𝐴 −ℎ 𝐵) = ((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵)) |
| 29 | 28 | fveq2i 6919 | . 2 ⊢ (normℎ‘(𝐴 −ℎ 𝐵)) = (normℎ‘((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵))) |
| 30 | 1, 4 | hvsubcli 31680 | . . 3 ⊢ (𝐴 −ℎ 𝐶) ∈ ℋ |
| 31 | 4, 2 | hvsubcli 31680 | . . 3 ⊢ (𝐶 −ℎ 𝐵) ∈ ℋ |
| 32 | 30, 31 | norm-ii-i 31796 | . 2 ⊢ (normℎ‘((𝐴 −ℎ 𝐶) +ℎ (𝐶 −ℎ 𝐵))) ≤ ((normℎ‘(𝐴 −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))) |
| 33 | 29, 32 | eqbrtri 5132 | 1 ⊢ (normℎ‘(𝐴 −ℎ 𝐵)) ≤ ((normℎ‘(𝐴 −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 1c1 11240 + caddc 11242 ≤ cle 11383 -cneg 11581 ℋchba 31578 +ℎ cva 31579 ·ℎ csm 31580 normℎcno 31582 0ℎc0v 31583 −ℎ cmv 31584 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 ax-hfvadd 31659 ax-hvcom 31660 ax-hvass 31661 ax-hv0cl 31662 ax-hvaddid 31663 ax-hfvmul 31664 ax-hvmulid 31665 ax-hvmulass 31666 ax-hvdistr2 31668 ax-hvmul0 31669 ax-hfi 31738 ax-his1 31741 ax-his2 31742 ax-his3 31743 ax-his4 31744 |
| 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 2102 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-hnorm 31627 df-hvsub 31630 |
| This theorem is used by: norm3adifii 31807 norm3lem 31808 norm3dif 31809 |
| Copyright terms: Public domain | W3C validator |