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

Theorem nmoplb 32536
Description: A lower bound for an operator norm. (Contributed by NM, 7-Feb-2006.) (New usage is discouraged.)
Assertion
Ref Expression
nmoplb ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normℎ‘(𝑇‘𝐴)) ≤ (normop‘𝑇))

Proof of Theorem nmoplb
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nmopsetretHIL 32493 . . . . 5 (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ)
2 ressxr 11377 . . . . 5 ℝ ⊆ ℝ*
31, 2sstrdi 3925 . . . 4 (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ*)
433ad2ant1 1151 . . 3 ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ*)
5 fveq2 6905 . . . . . . . . 9 (𝑦 = 𝐴 → (normℎ‘𝑦) = (normℎ‘𝐴))
65breq1d 5116 . . . . . . . 8 (𝑦 = 𝐴 → ((normℎ‘𝑦) ≤ 1 ↔ (normℎ‘𝐴) ≤ 1))
7 2fveq3 6910 . . . . . . . . 9 (𝑦 = 𝐴 → (normℎ‘(𝑇‘𝑦)) = (normℎ‘(𝑇‘𝐴)))
87eqeq2d 2774 . . . . . . . 8 (𝑦 = 𝐴 → ((normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦)) ↔ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝐴))))
96, 8anbi12d 644 . . . . . . 7 (𝑦 = 𝐴 → (((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))) ↔ ((normℎ‘𝐴) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝐴)))))
10 eqid 2763 . . . . . . . 8 (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝐴))
1110biantru 539 . . . . . . 7 ((normℎ‘𝐴) ≤ 1 ↔ ((normℎ‘𝐴) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝐴))))
129, 11bitr4di 292 . . . . . 6 (𝑦 = 𝐴 → (((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))) ↔ (normℎ‘𝐴) ≤ 1))
1312rspcev 3580 . . . . 5 ((𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))))
14 fvex 6918 . . . . . 6 (normℎ‘(𝑇‘𝐴)) ∈ V
15 eqeq1 2767 . . . . . . . 8 (𝑥 = (normℎ‘(𝑇‘𝐴)) → (𝑥 = (normℎ‘(𝑇‘𝑦)) ↔ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))))
1615anbi2d 642 . . . . . . 7 (𝑥 = (normℎ‘(𝑇‘𝐴)) → (((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦))) ↔ ((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦)))))
1716rexbidv 3190 . . . . . 6 (𝑥 = (normℎ‘(𝑇‘𝐴)) → (∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦))) ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦)))))
1814, 17elab 3636 . . . . 5 ((normℎ‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))))
1913, 18sylibr 237 . . . 4 ((𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normℎ‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))})
20193adant1 1148 . . 3 ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normℎ‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))})
21 supxrub 13478 . . 3 (({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ* ∧ (normℎ‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}) → (normℎ‘(𝑇‘𝐴)) ≤ sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
224, 20, 21syl2anc 596 . 2 ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normℎ‘(𝑇‘𝐴)) ≤ sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
23 nmopval 32485 . . 3 (𝑇: ℋ⟶ ℋ → (normop‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
24233ad2ant1 1151 . 2 ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normop‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
2522, 24breqtrrd 5136 1 ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normℎ‘(𝑇‘𝐴)) ≤ (normop‘𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  {cab 2741  ∃wrex 3090   ⊆ wss 3900   class class class wbr 5106  ⟶wf 6551  ‘cfv 6555  supcsup 9456  ℝcr 11223  1c1 11225  ℝ*cxr 11366   < clt 11367   ≤ cle 11368   ℋchba 31548  normℎcno 31552  normopcnop 31574
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-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301  ax-pre-sup 11302  ax-hilex 31628  ax-hfvadd 31629  ax-hvcom 31630  ax-hvass 31631  ax-hv0cl 31632  ax-hvaddid 31633  ax-hfvmul 31634  ax-hvmulid 31635  ax-hvmulass 31636  ax-hvdistr1 31637  ax-hvdistr2 31638  ax-hvmul0 31639  ax-hfi 31708  ax-his1 31711  ax-his2 31712  ax-his3 31713  ax-his4 31714
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 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 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-er 8742  df-map 8874  df-en 8999  df-dom 9000  df-sdom 9001  df-sup 9458  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-div 11998  df-nn 12360  df-2 12429  df-3 12430  df-4 12431  df-n0 12631  df-z 12718  df-uz 12990  df-rp 13145  df-seq 14169  df-exp 14229  df-cj 15292  df-re 15293  df-im 15294  df-sqrt 15428  df-abs 15429  df-grpo 31122  df-gid 31123  df-ablo 31174  df-vc 31188  df-nv 31221  df-va 31224  df-ba 31225  df-sm 31226  df-0v 31227  df-nmcv 31229  df-hnorm 31597  df-hba 31598  df-hvsub 31600  df-nmop 32468
This theorem is used by:  nmopge0  32540  nmbdoplbi  32653  nmcoplbi  32657  nmophmi  32660  nmoptrii  32723  nmopcoi  32724
  Copyright terms: Public domain W3C validator