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

Theorem nmbdfnlb 32652
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 6884 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇‘𝐴) = (if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴))
21fveq2d 6889 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (abs‘(𝑇‘𝐴)) = (abs‘(if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)))
3 fveq2 6885 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn‘𝑇) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
43oveq1d 7435 . . . . 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 2849 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇 ∈ LinFn ↔ if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn))
83eleq1d 2846 . . . . . 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 2849 . . . . . 6 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (( ℋ × {0}) ∈ LinFn ↔ if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) ∈ LinFn))
11 fveq2 6885 . . . . . . 7 (( ℋ × {0}) = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn‘( ℋ × {0})) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
1211eleq1d 2846 . . . . . 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 32587 . . . . . 6 ( ℋ × {0}) ∈ LinFn
15 nmfn0 32589 . . . . . . 7 (normfn‘( ℋ × {0})) = 0
16 0re 11310 . . . . . . 7 0 ∈ ℝ
1715, 16eqeltri 2857 . . . . . 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 32651 . . 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 5649  ‘cfv 6538  (class class class)co 7420  ℝcr 11199  0cc0 11200   · cmul 11205   ≤ cle 11344  abscabs 15401   ℋchba 31521  normℎcno 31525  normfncnmf 31553  LinFnclf 31556
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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277  ax-pre-sup 11278  ax-hilex 31601  ax-hfvadd 31602  ax-hv0cl 31605  ax-hvaddid 31606  ax-hfvmul 31607  ax-hvmulid 31608  ax-hvmul0 31612  ax-hfi 31681  ax-his1 31684  ax-his3 31686  ax-his4 31687
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-er 8717  df-map 8849  df-en 8974  df-dom 8975  df-sdom 8976  df-sup 9434  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-div 11974  df-nn 12336  df-2 12405  df-3 12406  df-n0 12607  df-z 12694  df-uz 12966  df-rp 13121  df-seq 14145  df-exp 14205  df-cj 15266  df-re 15267  df-im 15268  df-sqrt 15402  df-abs 15403  df-hnorm 31570  df-nmfn 32447  df-lnfn 32450
This theorem is used by:  lnfncnbd  32659
  Copyright terms: Public domain W3C validator