| 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 7379 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (normℎ‘(𝐴 −ℎ 𝐶)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶))) | |
| 2 | 1 | fvoveq1d 7378 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (abs‘((normℎ‘(𝐴 −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) = (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶))))) |
| 3 | fvoveq1 7379 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (normℎ‘(𝐴 −ℎ 𝐵)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵))) | |
| 4 | 2, 3 | breq12d 5109 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ((abs‘((normℎ‘(𝐴 −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) ≤ (normℎ‘(𝐴 −ℎ 𝐵)) ↔ (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) ≤ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)))) |
| 5 | fvoveq1 7379 | . . . . 5 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (normℎ‘(𝐵 −ℎ 𝐶)) = (normℎ‘(if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ 𝐶))) | |
| 6 | 5 | oveq2d 7372 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶))) = ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ 𝐶)))) |
| 7 | 6 | fveq2d 6836 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) = (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ 𝐶))))) |
| 8 | oveq2 7364 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
| 9 | 8 | fveq2d 6836 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
| 10 | 7, 9 | breq12d 5109 | . 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 31046 | . . 3 ⊢ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) ∈ ℋ | |
| 12 | ifhvhv0 31046 | . . 3 ⊢ if(𝐵 ∈ ℋ, 𝐵, 0ℎ) ∈ ℋ | |
| 13 | norm3adift.1 | . . 3 ⊢ 𝐶 ∈ ℋ | |
| 14 | 11, 12, 13 | norm3adifii 31172 | . 2 ⊢ (abs‘((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) − (normℎ‘(if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ 𝐶)))) ≤ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) |
| 15 | 4, 10, 14 | dedth2h 4537 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (abs‘((normℎ‘(𝐴 −ℎ 𝐶)) − (normℎ‘(𝐵 −ℎ 𝐶)))) ≤ (normℎ‘(𝐴 −ℎ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ifcif 4477 class class class wbr 5096 ‘cfv 6490 (class class class)co 7356 ≤ cle 11165 − cmin 11362 abscabs 15155 ℋchba 30943 normℎcno 30947 0ℎc0v 30948 −ℎ cmv 30949 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 ax-pre-sup 11102 ax-hfvadd 31024 ax-hvcom 31025 ax-hvass 31026 ax-hv0cl 31027 ax-hvaddid 31028 ax-hfvmul 31029 ax-hvmulid 31030 ax-hvmulass 31031 ax-hvdistr1 31032 ax-hvdistr2 31033 ax-hvmul0 31034 ax-hfi 31103 ax-his1 31106 ax-his2 31107 ax-his3 31108 ax-his4 31109 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-sup 9343 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-div 11793 df-nn 12144 df-2 12206 df-3 12207 df-4 12208 df-n0 12400 df-z 12487 df-uz 12750 df-rp 12904 df-seq 13923 df-exp 13983 df-cj 15020 df-re 15021 df-im 15022 df-sqrt 15156 df-abs 15157 df-hnorm 30992 df-hvsub 30995 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |