Theorem nmoplb 31963

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.

Step	Hyp	Ref	Expression
1		nmopsetretHIL 31920	. . . . 5 ⊢ (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ)
2		ressxr 11178	. . . . 5 ⊢ ℝ ⊆ ℝ*
3	1, 2	sstrdi 3945	. . . 4 ⊢ (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ*)
4	3	3ad2ant1 1134	. . 3 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ*)
5		fveq2 6833	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (normℎ‘𝑦) = (normℎ‘𝐴))
6	5	breq1d 5107	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → ((normℎ‘𝑦) ≤ 1 ↔ (normℎ‘𝐴) ≤ 1))
7		2fveq3 6838	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (normℎ‘(𝑇‘𝑦)) = (normℎ‘(𝑇‘𝐴)))
8	7	eqeq2d 2746	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → ((normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦)) ↔ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝐴))))
9	6, 8	anbi12d 633	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))) ↔ ((normℎ‘𝐴) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝐴)))))
10		eqid 2735	. . . . . . . 8 ⊢ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝐴))
11	10	biantru 529	. . . . . . 7 ⊢ ((normℎ‘𝐴) ≤ 1 ↔ ((normℎ‘𝐴) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝐴))))
12	9, 11	bitr4di 289	. . . . . 6 ⊢ (𝑦 = 𝐴 → (((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))) ↔ (normℎ‘𝐴) ≤ 1))
13	12	rspcev 3575	. . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))))
14		fvex 6846	. . . . . 6 ⊢ (normℎ‘(𝑇‘𝐴)) ∈ V
15		eqeq1 2739	. . . . . . . 8 ⊢ (𝑥 = (normℎ‘(𝑇‘𝐴)) → (𝑥 = (normℎ‘(𝑇‘𝑦)) ↔ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))))
16	15	anbi2d 631	. . . . . . 7 ⊢ (𝑥 = (normℎ‘(𝑇‘𝐴)) → (((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦))) ↔ ((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦)))))
17	16	rexbidv 3159	. . . . . 6 ⊢ (𝑥 = (normℎ‘(𝑇‘𝐴)) → (∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦))) ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦)))))
18	14, 17	elab 3633	. . . . 5 ⊢ ((normℎ‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ (normℎ‘(𝑇‘𝐴)) = (normℎ‘(𝑇‘𝑦))))
19	13, 18	sylibr 234	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normℎ‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))})
20	19	3adant1 1131	. . 3 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normℎ‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))})
21		supxrub 13241	. . 3 ⊢ (({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ* ∧ (normℎ‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}) → (normℎ‘(𝑇‘𝐴)) ≤ sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
22	4, 20, 21	syl2anc 585	. 2 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normℎ‘(𝑇‘𝐴)) ≤ sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
23		nmopval 31912	. . 3 ⊢ (𝑇: ℋ⟶ ℋ → (normop‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
24	23	3ad2ant1 1134	. 2 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normop‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
25	22, 24	breqtrrd 5125	1 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normℎ‘(𝑇‘𝐴)) ≤ (normop‘𝑇))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  {cab 2713  ∃wrex 3059   ⊆ wss 3900   class class class wbr 5097  ⟶wf 6487  ‘cfv 6491  supcsup 9345  ℝcr 11027  1c1 11029  ℝ^*cxr 11167   < clt 11168   ≤ cle 11169   ℋchba 30975  norm_ℎcno 30979  norm_opcnop 31001

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-rep 5223  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104  ax-pre-mulgt0 11105  ax-pre-sup 11106  ax-hilex 31055  ax-hfvadd 31056  ax-hvcom 31057  ax-hvass 31058  ax-hv0cl 31059  ax-hvaddid 31060  ax-hfvmul 31061  ax-hvmulid 31062  ax-hvmulass 31063  ax-hvdistr1 31064  ax-hvdistr2 31065  ax-hvmul0 31066  ax-hfi 31135  ax-his1 31138  ax-his2 31139  ax-his3 31140  ax-his4 31141

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-nel 3036  df-ral 3051  df-rex 3060  df-rmo 3349  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6258  df-ord 6319  df-on 6320  df-lim 6321  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-er 8635  df-map 8767  df-en 8886  df-dom 8887  df-sdom 8888  df-sup 9347  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-sub 11368  df-neg 11369  df-div 11797  df-nn 12148  df-2 12210  df-3 12211  df-4 12212  df-n0 12404  df-z 12491  df-uz 12754  df-rp 12908  df-seq 13927  df-exp 13987  df-cj 15024  df-re 15025  df-im 15026  df-sqrt 15160  df-abs 15161  df-grpo 30549  df-gid 30550  df-ablo 30601  df-vc 30615  df-nv 30648  df-va 30651  df-ba 30652  df-sm 30653  df-0v 30654  df-nmcv 30656  df-hnorm 31024  df-hba 31025  df-hvsub 31027  df-nmop 31895

This theorem is referenced by:  nmopge0  31967  nmbdoplbi  32080  nmcoplbi  32084  nmophmi  32087  nmoptrii  32150  nmopcoi  32151