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

Theorem nmbdfnlb 32560
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 6879 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇𝐴) = (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴))
21fveq2d 6884 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (abs‘(𝑇𝐴)) = (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)))
3 fveq2 6880 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn𝑇) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
43oveq1d 7430 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn𝑇) · (norm𝐴)) = ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴)))
52, 4breq12d 5116 . . . 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 2848 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇 ∈ LinFn ↔ if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn))
83eleq1d 2845 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn𝑇) ∈ ℝ ↔ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ))
97, 8anbi12d 644 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ) ↔ (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)))
10 eleq1 2848 . . . . . 6 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (( ℋ × {0}) ∈ LinFn ↔ if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn))
11 fveq2 6880 . . . . . . 7 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn‘( ℋ × {0})) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
1211eleq1d 2845 . . . . . 6 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn‘( ℋ × {0})) ∈ ℝ ↔ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ))
1310, 12anbi12d 644 . . . . 5 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((( ℋ × {0}) ∈ LinFn ∧ (normfn‘( ℋ × {0})) ∈ ℝ) ↔ (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)))
14 0lnfn 32495 . . . . . 6 ( ℋ × {0}) ∈ LinFn
15 nmfn0 32497 . . . . . . 7 (normfn‘( ℋ × {0})) = 0
16 0re 11256 . . . . . . 7 0 ∈ ℝ
1715, 16eqeltri 2856 . . . . . 6 (normfn‘( ℋ × {0})) ∈ ℝ
1814, 17pm3.2i 476 . . . . 5 (( ℋ × {0}) ∈ LinFn ∧ (normfn‘( ℋ × {0})) ∈ ℝ)
199, 13, 18elimhyp 4548 . . . 4 (if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)
2019nmbdfnlbi 32559 . . 3 (𝐴 ∈ ℋ → (abs‘(if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)) ≤ ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (norm𝐴)))
216, 20dedth 4541 . 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 401  w3a 1103   = wceq 1570  wcel 2145  ifcif 4482  {csn 4584   class class class wbr 5103   × cxp 5653  cfv 6534  (class class class)co 7415  cr 11145  0cc0 11146   · cmul 11151  cle 11290  abscabs 15343  chba 31429  normcno 31433  normfncnmf 31461  LinFnclf 31464
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7738  ax-cnex 11202  ax-resscn 11203  ax-1cn 11204  ax-icn 11205  ax-addcl 11206  ax-addrcl 11207  ax-mulcl 11208  ax-mulrcl 11209  ax-mulcom 11210  ax-addass 11211  ax-mulass 11212  ax-distr 11213  ax-i2m1 11214  ax-1ne0 11215  ax-1rid 11216  ax-rnegex 11217  ax-rrecex 11218  ax-cnre 11219  ax-pre-lttri 11220  ax-pre-lttrn 11221  ax-pre-ltadd 11222  ax-pre-mulgt0 11223  ax-pre-sup 11224  ax-hilex 31509  ax-hfvadd 31510  ax-hv0cl 31513  ax-hvaddid 31514  ax-hfvmul 31515  ax-hvmulid 31516  ax-hvmul0 31520  ax-hfi 31589  ax-his1 31592  ax-his3 31594  ax-his4 31595
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6300  df-ord 6361  df-on 6362  df-lim 6363  df-suc 6364  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-riota 7372  df-ov 7418  df-oprab 7419  df-mpo 7420  df-om 7865  df-2nd 7989  df-frecs 8282  df-wrecs 8313  df-recs 8362  df-rdg 8401  df-er 8700  df-map 8832  df-en 8957  df-dom 8958  df-sdom 8959  df-sup 9416  df-pnf 11291  df-mnf 11292  df-xr 11293  df-ltxr 11294  df-le 11295  df-sub 11489  df-neg 11490  df-div 11918  df-nn 12280  df-2 12349  df-3 12350  df-n0 12551  df-z 12638  df-uz 12910  df-rp 13065  df-seq 14088  df-exp 14148  df-cj 15208  df-re 15209  df-im 15210  df-sqrt 15344  df-abs 15345  df-hnorm 31478  df-nmfn 32355  df-lnfn 32358
This theorem is used by:  lnfncnbd  32567
  Copyright terms: Public domain W3C validator