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

Theorem nmbdfnlb 32709
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 6915 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (𝑇‘𝐴) = (if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴))
21fveq2d 6920 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (abs‘(𝑇‘𝐴)) = (abs‘(if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))‘𝐴)))
3 fveq2 6916 . . . . . 6 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → (normfn‘𝑇) = (normfn‘if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))))
43oveq1d 7466 . . . . 5 (𝑇 = if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0})) → ((normfn‘𝑇) · (normℎ‘𝐴)) = ((normfn‘if((𝑇 ∈ LinFn ∧ (normfn‘𝑇) ∈ ℝ), 𝑇, ( ℋ × {0}))) · (normℎ‘𝐴)))
52, 4breq12d 5121 . . . 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 6916 . . . . . . 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 32644 . . . . . 6 ( ℋ × {0}) ∈ LinFn
15 nmfn0 32646 . . . . . . 7 (normfn‘( ℋ × {0})) = 0
16 0re 11349 . . . . . . 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 32708 . . 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 1570   ∈ wcel 2147  ifcif 4485  {csn 4588   class class class wbr 5108   × cxp 5656  ‘cfv 6566  (class class class)co 7451  ℝcr 11238  0cc0 11239   · cmul 11244   ≤ cle 11383  abscabs 15444   ℋchba 31578  normℎcno 31582  normfncnmf 31610  LinFnclf 31613
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316  ax-pre-sup 11317  ax-hilex 31658  ax-hfvadd 31659  ax-hv0cl 31662  ax-hvaddid 31663  ax-hfvmul 31664  ax-hvmulid 31665  ax-hvmul0 31669  ax-hfi 31738  ax-his1 31741  ax-his3 31743  ax-his4 31744
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 2102  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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-sup 9471  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-2 12445  df-3 12446  df-n0 12647  df-z 12734  df-uz 13006  df-rp 13161  df-seq 14185  df-exp 14245  df-cj 15309  df-re 15310  df-im 15311  df-sqrt 15445  df-abs 15446  df-hnorm 31627  df-nmfn 32504  df-lnfn 32507
This theorem is used by:  lnfncnbd  32716
  Copyright terms: Public domain W3C validator