Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HSE Home > Th. List > norm3dif | 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, 20-Apr-2006.) (New usage is discouraged.) |
Ref | Expression |
---|---|
norm3dif | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (normℎ‘(𝐴 −ℎ 𝐵)) ≤ ((normℎ‘(𝐴 −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvoveq1 7179 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (normℎ‘(𝐴 −ℎ 𝐵)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵))) | |
2 | fvoveq1 7179 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (normℎ‘(𝐴 −ℎ 𝐶)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶))) | |
3 | 2 | oveq1d 7171 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ((normℎ‘(𝐴 −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))) = ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵)))) |
4 | 1, 3 | breq12d 5079 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ((normℎ‘(𝐴 −ℎ 𝐵)) ≤ ((normℎ‘(𝐴 −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))) ↔ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) ≤ ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))))) |
5 | oveq2 7164 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
6 | 5 | fveq2d 6674 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
7 | oveq2 7164 | . . . . 5 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (𝐶 −ℎ 𝐵) = (𝐶 −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
8 | 7 | fveq2d 6674 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (normℎ‘(𝐶 −ℎ 𝐵)) = (normℎ‘(𝐶 −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
9 | 8 | oveq2d 7172 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))) = ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))))) |
10 | 6, 9 | breq12d 5079 | . 2 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) ≤ ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵))) ↔ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) ≤ ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))))) |
11 | oveq2 7164 | . . . . 5 ⊢ (𝐶 = if(𝐶 ∈ ℋ, 𝐶, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐶 ∈ ℋ, 𝐶, 0ℎ))) | |
12 | 11 | fveq2d 6674 | . . . 4 ⊢ (𝐶 = if(𝐶 ∈ ℋ, 𝐶, 0ℎ) → (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) = (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐶 ∈ ℋ, 𝐶, 0ℎ)))) |
13 | fvoveq1 7179 | . . . 4 ⊢ (𝐶 = if(𝐶 ∈ ℋ, 𝐶, 0ℎ) → (normℎ‘(𝐶 −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) = (normℎ‘(if(𝐶 ∈ ℋ, 𝐶, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) | |
14 | 12, 13 | oveq12d 7174 | . . 3 ⊢ (𝐶 = if(𝐶 ∈ ℋ, 𝐶, 0ℎ) → ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) = ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐶 ∈ ℋ, 𝐶, 0ℎ))) + (normℎ‘(if(𝐶 ∈ ℋ, 𝐶, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))))) |
15 | 14 | breq2d 5078 | . 2 ⊢ (𝐶 = if(𝐶 ∈ ℋ, 𝐶, 0ℎ) → ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) ≤ ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) ↔ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) ≤ ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐶 ∈ ℋ, 𝐶, 0ℎ))) + (normℎ‘(if(𝐶 ∈ ℋ, 𝐶, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))))) |
16 | ifhvhv0 28799 | . . 3 ⊢ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) ∈ ℋ | |
17 | ifhvhv0 28799 | . . 3 ⊢ if(𝐵 ∈ ℋ, 𝐵, 0ℎ) ∈ ℋ | |
18 | ifhvhv0 28799 | . . 3 ⊢ if(𝐶 ∈ ℋ, 𝐶, 0ℎ) ∈ ℋ | |
19 | 16, 17, 18 | norm3difi 28924 | . 2 ⊢ (normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) ≤ ((normℎ‘(if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐶 ∈ ℋ, 𝐶, 0ℎ))) + (normℎ‘(if(𝐶 ∈ ℋ, 𝐶, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
20 | 4, 10, 15, 19 | dedth3h 4525 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (normℎ‘(𝐴 −ℎ 𝐵)) ≤ ((normℎ‘(𝐴 −ℎ 𝐶)) + (normℎ‘(𝐶 −ℎ 𝐵)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ifcif 4467 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 + caddc 10540 ≤ cle 10676 ℋchba 28696 normℎcno 28700 0ℎc0v 28701 −ℎ cmv 28702 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 ax-hfvadd 28777 ax-hvcom 28778 ax-hvass 28779 ax-hv0cl 28780 ax-hvaddid 28781 ax-hfvmul 28782 ax-hvmulid 28783 ax-hvmulass 28784 ax-hvdistr2 28786 ax-hvmul0 28787 ax-hfi 28856 ax-his1 28859 ax-his2 28860 ax-his3 28861 ax-his4 28862 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-sup 8906 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-n0 11899 df-z 11983 df-uz 12245 df-rp 12391 df-seq 13371 df-exp 13431 df-cj 14458 df-re 14459 df-im 14460 df-sqrt 14594 df-abs 14595 df-hnorm 28745 df-hvsub 28748 |
This theorem is referenced by: norm3dif2 28928 |
Copyright terms: Public domain | W3C validator |