HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  nmbdfnlb Structured version   Visualization version   GIF version

Theorem nmbdfnlb 32411
Description: A lower bound for the norm of a bounded linear functional. (Contributed by NM, 25-Apr-2006.) (New usage is discouraged.)
Assertion
Ref Expression
nmbdfnlb ((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ ∧ 𝐴 ∈ ℋ) → (abs‘(𝑇𝐴)) ≤ ((normfn𝑇) · (norm𝐴)))

Proof of Theorem nmbdfnlb
StepHypRef Expression
1 fveq1 6880 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇𝐴) = (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴))
21fveq2d 6885 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (abs‘(𝑇𝐴)) = (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)))
3 fveq2 6881 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn𝑇) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
43oveq1d 7425 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn𝑇) · (norm𝐴)) = ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴)))
52, 4breq12d 5122 . . . 4 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((abs‘(𝑇𝐴)) ≤ ((normfn𝑇) · (norm𝐴)) ↔ (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)) ≤ ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴))))
65imbi2d 343 . . 3 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((𝐴 ∈ ℋ → (abs‘(𝑇𝐴)) ≤ ((normfn𝑇) · (norm𝐴))) ↔ (𝐴 ∈ ℋ → (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)) ≤ ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴)))))
7 eleq1 2851 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇 ∈ LinFn ↔ if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn))
83eleq1d 2848 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn𝑇) ∈ ℝ ↔ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ))
97, 8anbi12d 643 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ) ↔ (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)))
10 eleq1 2851 . . . . . 6 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (( ℋ × {0}) ∈ LinFn ↔ if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn))
11 fveq2 6881 . . . . . . 7 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn‘( ℋ × {0})) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
1211eleq1d 2848 . . . . . 6 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn‘( ℋ × {0})) ∈ ℝ ↔ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ))
1310, 12anbi12d 643 . . . . 5 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((( ℋ × {0}) ∈ LinFn ∧ (normfn‘( ℋ × {0})) ∈ ℝ) ↔ (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)))
14 0lnfn 32346 . . . . . 6 ( ℋ × {0}) ∈ LinFn
15 nmfn0 32348 . . . . . . 7 (normfn‘( ℋ × {0})) = 0
16 0re 11214 . . . . . . 7 0 ∈ ℝ
1715, 16eqeltri 2859 . . . . . 6 (normfn‘( ℋ × {0})) ∈ ℝ
1814, 17pm3.2i 475 . . . . 5 (( ℋ × {0}) ∈ LinFn ∧ (normfn‘( ℋ × {0})) ∈ ℝ)
199, 13, 18elimhyp 4553 . . . 4 (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)
2019nmbdfnlbi 32410 . . 3 (𝐴 ∈ ℋ → (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)) ≤ ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴)))
216, 20dedth 4546 . 2 ((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ) → (𝐴 ∈ ℋ → (abs‘(𝑇𝐴)) ≤ ((normfn𝑇) · (norm𝐴))))
22213impia 1135 1 ((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ ∧ 𝐴 ∈ ℋ) → (abs‘(𝑇𝐴)) ≤ ((normfn𝑇) · (norm𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  ifcif 4487  {csn 4589   class class class wbr 5109   × cxp 5659  cfv 6536  (class class class)co 7410  cr 11103  0cc0 11104   · cmul 11109  cle 11248  abscabs 15290  chba 31280  normcno 31284  normfncnmf 31312  LinFnclf 31315
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11160  ax-resscn 11161  ax-1cn 11162  ax-icn 11163  ax-addcl 11164  ax-addrcl 11165  ax-mulcl 11166  ax-mulrcl 11167  ax-mulcom 11168  ax-addass 11169  ax-mulass 11170  ax-distr 11171  ax-i2m1 11172  ax-1ne0 11173  ax-1rid 11174  ax-rnegex 11175  ax-rrecex 11176  ax-cnre 11177  ax-pre-lttri 11178  ax-pre-lttrn 11179  ax-pre-ltadd 11180  ax-pre-mulgt0 11181  ax-pre-sup 11182  ax-hilex 31360  ax-hfvadd 31361  ax-hv0cl 31364  ax-hvaddid 31365  ax-hfvmul 31366  ax-hvmulid 31367  ax-hvmul0 31371  ax-hfi 31440  ax-his1 31443  ax-his3 31445  ax-his4 31446
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-sup 9398  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-le 11253  df-sub 11447  df-neg 11448  df-div 11876  df-nn 12238  df-2 12307  df-3 12308  df-n0 12509  df-z 12596  df-uz 12867  df-rp 13021  df-seq 14043  df-exp 14103  df-cj 15155  df-re 15156  df-im 15157  df-sqrt 15291  df-abs 15292  df-hnorm 31329  df-nmfn 32206  df-lnfn 32209
This theorem is used by:  lnfncnbd  32418
  Copyright terms: Public domain W3C validator