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

Theorem nmbdfnlb 32667
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 6895 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇‘𝐴) = (if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴))
21fveq2d 6900 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (abs‘(𝑇‘𝐴)) = (abs‘(if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)))
3 fveq2 6896 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn‘𝑇) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
43oveq1d 7445 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn‘𝑇) · (normℎ‘𝐴)) = ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (normℎ‘𝐴)))
52, 4breq12d 5119 . . . 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 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 644 . . . . 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 6896 . . . . . . 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 644 . . . . 5 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((( ℋ × {0}) ∈ LinFn ∧ (normfn‘( ℋ × {0})) ∈ ℝ) ↔ (if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)))
14 0lnfn 32602 . . . . . 6 ( ℋ × {0}) ∈ LinFn
15 nmfn0 32604 . . . . . . 7 (normfn‘( ℋ × {0})) = 0
16 0re 11323 . . . . . . 7 0 ∈ ℝ
1715, 16eqeltri 2860 . . . . . 6 (normfn‘( ℋ × {0})) ∈ ℝ
1814, 17pm3.2i 476 . . . . 5 (( ℋ × {0}) ∈ LinFn ∧ (normfn‘( ℋ × {0})) ∈ ℝ)
199, 13, 18elimhyp 4551 . . . 4 (if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn ∧ (normfn‘if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) ∈ ℝ)
2019nmbdfnlbi 32666 . . 3 (𝐴 ∈ ℋ → (abs‘(if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)) ≤ ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (normℎ‘𝐴)))
216, 20dedth 4544 . 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 1569   ∈ wcel 2146  ifcif 4485  {csn 4588   class class class wbr 5106   × cxp 5653  ‘cfv 6547  (class class class)co 7430  ℝcr 11212  0cc0 11213   · cmul 11218   ≤ cle 11357  abscabs 15416   ℋchba 31536  normℎcno 31540  normfncnmf 31568  LinFnclf 31571
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761  ax-cnex 11269  ax-resscn 11270  ax-1cn 11271  ax-icn 11272  ax-addcl 11273  ax-addrcl 11274  ax-mulcl 11275  ax-mulrcl 11276  ax-mulcom 11277  ax-addass 11278  ax-mulass 11279  ax-distr 11280  ax-i2m1 11281  ax-1ne0 11282  ax-1rid 11283  ax-rnegex 11284  ax-rrecex 11285  ax-cnre 11286  ax-pre-lttri 11287  ax-pre-lttrn 11288  ax-pre-ltadd 11289  ax-pre-mulgt0 11290  ax-pre-sup 11291  ax-hilex 31616  ax-hfvadd 31617  ax-hv0cl 31620  ax-hvaddid 31621  ax-hfvmul 31622  ax-hvmulid 31623  ax-hvmul0 31627  ax-hfi 31696  ax-his1 31699  ax-his3 31701  ax-his4 31702
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  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 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-er 8731  df-map 8863  df-en 8988  df-dom 8989  df-sdom 8990  df-sup 9447  df-pnf 11358  df-mnf 11359  df-xr 11360  df-ltxr 11361  df-le 11362  df-sub 11556  df-neg 11557  df-div 11987  df-nn 12349  df-2 12418  df-3 12419  df-n0 12620  df-z 12707  df-uz 12979  df-rp 13134  df-seq 14158  df-exp 14218  df-cj 15281  df-re 15282  df-im 15283  df-sqrt 15417  df-abs 15418  df-hnorm 31585  df-nmfn 32462  df-lnfn 32465
This theorem is used by:  lnfncnbd  32674
  Copyright terms: Public domain W3C validator