![]() |
Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > HSE Home > Th. List > norm3adifi | 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, 3-Oct-1999.) (New usage is discouraged.) |
Ref | Expression |
---|---|
norm3adift.1 | ⊢ 𝐶 ∈ ℋ |
Ref | Expression |
---|---|
norm3adifi | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (abs‘((normℎ‘(𝐴 −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) ≤ (normℎ‘(𝐴 −ℎ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvoveq1 7158 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (normℎ‘(𝐴 −ℎ 𝐶)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶))) | |
2 | 1 | fvoveq1d 7157 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (abs‘((normℎ‘(𝐴 −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) = (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶))))) |
3 | fvoveq1 7158 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (normℎ‘(𝐴 −ℎ 𝐵)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵))) | |
4 | 2, 3 | breq12d 5043 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ((abs‘((normℎ‘(𝐴 −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) ≤ (normℎ‘(𝐴 −ℎ 𝐵)) ↔ (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) ≤ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)))) |
5 | fvoveq1 7158 | . . . . 5 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (normℎ‘(𝐵 −ℎ 𝐶)) = (normℎ‘(if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ 𝐶))) | |
6 | 5 | oveq2d 7151 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶))) = ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ 𝐶)))) |
7 | 6 | fveq2d 6649 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) = (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ 𝐶))))) |
8 | oveq2 7143 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
9 | 8 | fveq2d 6649 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
10 | 7, 9 | breq12d 5043 | . 2 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) ≤ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) ↔ (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ 𝐶)))) ≤ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))))) |
11 | ifhvhv0 28805 | . . 3 ⊢ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) ∈ ℋ | |
12 | ifhvhv0 28805 | . . 3 ⊢ if(𝐵 ∈ ℋ, 𝐵, 0ℎ) ∈ ℋ | |
13 | norm3adift.1 | . . 3 ⊢ 𝐶 ∈ ℋ | |
14 | 11, 12, 13 | norm3adifii 28931 | . 2 ⊢ (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ 𝐶)))) ≤ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) |
15 | 4, 10, 14 | dedth2h 4482 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (abs‘((normℎ‘(𝐴 −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) ≤ (normℎ‘(𝐴 −ℎ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ifcif 4425 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 ≤ cle 10665 − cmin 10859 abscabs 14585 ℋchba 28702 normℎcno 28706 0ℎc0v 28707 −ℎ cmv 28708 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 ax-hfvadd 28783 ax-hvcom 28784 ax-hvass 28785 ax-hv0cl 28786 ax-hvaddid 28787 ax-hfvmul 28788 ax-hvmulid 28789 ax-hvmulass 28790 ax-hvdistr1 28791 ax-hvdistr2 28792 ax-hvmul0 28793 ax-hfi 28862 ax-his1 28865 ax-his2 28866 ax-his3 28867 ax-his4 28868 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-sup 8890 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-seq 13365 df-exp 13426 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-hnorm 28751 df-hvsub 28754 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |