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

Theorem nmbdfnlb 32255
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 6868 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇𝐴) = (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴))
21fveq2d 6873 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (abs‘(𝑇𝐴)) = (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)))
3 fveq2 6869 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn𝑇) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
43oveq1d 7413 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn𝑇) · (norm𝐴)) = ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴)))
52, 4breq12d 5115 . . . 4 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((abs‘(𝑇𝐴)) ≤ ((normfn𝑇) · (norm𝐴)) ↔ (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)) ≤ ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴))))
65imbi2d 342 . . 3 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((𝐴 ∈ ℋ → (abs‘(𝑇𝐴)) ≤ ((normfn𝑇) · (norm𝐴))) ↔ (𝐴 ∈ ℋ → (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)) ≤ ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴)))))
7 eleq1 2852 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇 ∈ LinFn ↔ if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn))
83eleq1d 2849 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn𝑇) ∈ ℝ ↔ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ))
97, 8anbi12d 641 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ) ↔ (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)))
10 eleq1 2852 . . . . . 6 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (( ℋ × {0}) ∈ LinFn ↔ if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn))
11 fveq2 6869 . . . . . . 7 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn‘( ℋ × {0})) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
1211eleq1d 2849 . . . . . 6 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn‘( ℋ × {0})) ∈ ℝ ↔ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ))
1310, 12anbi12d 641 . . . . 5 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((( ℋ × {0}) ∈ LinFn ∧ (normfn‘( ℋ × {0})) ∈ ℝ) ↔ (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)))
14 0lnfn 32190 . . . . . 6 ( ℋ × {0}) ∈ LinFn
15 nmfn0 32192 . . . . . . 7 (normfn‘( ℋ × {0})) = 0
16 0re 11185 . . . . . . 7 0 ∈ ℝ
1715, 16eqeltri 2860 . . . . . 6 (normfn‘( ℋ × {0})) ∈ ℝ
1814, 17pm3.2i 474 . . . . 5 (( ℋ × {0}) ∈ LinFn ∧ (normfn‘( ℋ × {0})) ∈ ℝ)
199, 13, 18elimhyp 4548 . . . 4 (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)
2019nmbdfnlbi 32254 . . 3 (𝐴 ∈ ℋ → (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)) ≤ ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴)))
216, 20dedth 4541 . 2 ((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ) → (𝐴 ∈ ℋ → (abs‘(𝑇𝐴)) ≤ ((normfn𝑇) · (norm𝐴))))
22213impia 1131 1 ((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ ∧ 𝐴 ∈ ℋ) → (abs‘(𝑇𝐴)) ≤ ((normfn𝑇) · (norm𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1099   = wceq 1562  wcel 2144  ifcif 4482  {csn 4584   class class class wbr 5102   × cxp 5647  cfv 6523  (class class class)co 7398  cr 11074  0cc0 11075   · cmul 11080  cle 11219  abscabs 15263  chba 31124  normcno 31128  normfncnmf 31156  LinFnclf 31159
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152  ax-pre-sup 11153  ax-hilex 31204  ax-hfvadd 31205  ax-hv0cl 31208  ax-hvaddid 31209  ax-hfvmul 31210  ax-hvmulid 31211  ax-hvmul0 31215  ax-hfi 31284  ax-his1 31287  ax-his3 31289  ax-his4 31290
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-pred 6290  df-ord 6351  df-on 6352  df-lim 6353  df-suc 6354  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7355  df-ov 7401  df-oprab 7402  df-mpo 7403  df-om 7849  df-2nd 7973  df-frecs 8264  df-wrecs 8295  df-recs 8344  df-rdg 8383  df-er 8680  df-map 8812  df-en 8930  df-dom 8931  df-sdom 8932  df-sup 9390  df-pnf 11220  df-mnf 11221  df-xr 11222  df-ltxr 11223  df-le 11224  df-sub 11418  df-neg 11419  df-div 11847  df-nn 12213  df-2 12282  df-3 12283  df-n0 12484  df-z 12571  df-uz 12842  df-rp 12996  df-seq 14017  df-exp 14077  df-cj 15128  df-re 15129  df-im 15130  df-sqrt 15264  df-abs 15265  df-hnorm 31173  df-nmfn 32050  df-lnfn 32053
This theorem is referenced by:  lnfncnbd  32262
  Copyright terms: Public domain W3C validator