Theorem nmopub 32275

Description: An upper bound for an operator norm. (Contributed by NM, 7-Mar-2006.) (New usage is discouraged.)

Assertion

Ref	Expression
nmopub	⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℝ*) → ((normop‘𝑇) ≤ 𝐴 ↔ ∀𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 → (normℎ‘(𝑇‘𝑥)) ≤ 𝐴)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝑇

Proof of Theorem nmopub

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nmopval 32223	. . . 4 ⊢ (𝑇: ℋ⟶ ℋ → (normop‘𝑇) = sup({𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}, ℝ*, < ))
2	1	adantr 486	. . 3 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℝ*) → (normop‘𝑇) = sup({𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}, ℝ*, < ))
3	2	breq1d 5122	. 2 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℝ*) → ((normop‘𝑇) ≤ 𝐴 ↔ sup({𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}, ℝ*, < ) ≤ 𝐴))
4		nmopsetretALT 32230	. . . . 5 ⊢ (𝑇: ℋ⟶ ℋ → {𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))} ⊆ ℝ)
5		ressxr 11263	. . . . 5 ⊢ ℝ ⊆ ℝ*
6	4, 5	sstrdi 3952	. . . 4 ⊢ (𝑇: ℋ⟶ ℋ → {𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))} ⊆ ℝ*)
7		supxrleub 13362	. . . 4 ⊢ (({𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))} ⊆ ℝ* ∧ 𝐴 ∈ ℝ*) → (sup({𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}, ℝ*, < ) ≤ 𝐴 ↔ ∀𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}𝑧 ≤ 𝐴))
8	6, 7	sylan 592	. . 3 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℝ*) → (sup({𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}, ℝ*, < ) ≤ 𝐴 ↔ ∀𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}𝑧 ≤ 𝐴))
9		ancom 466	. . . . . . 7 ⊢ (((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥))) ↔ (𝑦 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1))
10		eqeq1 2770	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → (𝑦 = (normℎ‘(𝑇‘𝑥)) ↔ 𝑧 = (normℎ‘(𝑇‘𝑥))))
11	10	anbi1d 643	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ((𝑦 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) ↔ (𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1)))
12	9, 11	bitrid 286	. . . . . 6 ⊢ (𝑦 = 𝑧 → (((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥))) ↔ (𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1)))
13	12	rexbidv 3192	. . . . 5 ⊢ (𝑦 = 𝑧 → (∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥))) ↔ ∃𝑥 ∈ ℋ (𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1)))
14	13	ralab 3659	. . . 4 ⊢ (∀𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}𝑧 ≤ 𝐴 ↔ ∀𝑧(∃𝑥 ∈ ℋ (𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴))
15		ralcom4 3294	. . . . 5 ⊢ (∀𝑥 ∈ ℋ ∀𝑧((𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴) ↔ ∀𝑧∀𝑥 ∈ ℋ ((𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴))
16		impexp 456	. . . . . . . 8 ⊢ (((𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴) ↔ (𝑧 = (normℎ‘(𝑇‘𝑥)) → ((normℎ‘𝑥) ≤ 1 → 𝑧 ≤ 𝐴)))
17	16	albii 1852	. . . . . . 7 ⊢ (∀𝑧((𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴) ↔ ∀𝑧(𝑧 = (normℎ‘(𝑇‘𝑥)) → ((normℎ‘𝑥) ≤ 1 → 𝑧 ≤ 𝐴)))
18		fvex 6898	. . . . . . . 8 ⊢ (normℎ‘(𝑇‘𝑥)) ∈ V
19		breq1 5115	. . . . . . . . 9 ⊢ (𝑧 = (normℎ‘(𝑇‘𝑥)) → (𝑧 ≤ 𝐴 ↔ (normℎ‘(𝑇‘𝑥)) ≤ 𝐴))
20	19	imbi2d 343	. . . . . . . 8 ⊢ (𝑧 = (normℎ‘(𝑇‘𝑥)) → (((normℎ‘𝑥) ≤ 1 → 𝑧 ≤ 𝐴) ↔ ((normℎ‘𝑥) ≤ 1 → (normℎ‘(𝑇‘𝑥)) ≤ 𝐴)))
21	18, 20	ceqsalv 3497	. . . . . . 7 ⊢ (∀𝑧(𝑧 = (normℎ‘(𝑇‘𝑥)) → ((normℎ‘𝑥) ≤ 1 → 𝑧 ≤ 𝐴)) ↔ ((normℎ‘𝑥) ≤ 1 → (normℎ‘(𝑇‘𝑥)) ≤ 𝐴))
22	17, 21	bitri 278	. . . . . 6 ⊢ (∀𝑧((𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴) ↔ ((normℎ‘𝑥) ≤ 1 → (normℎ‘(𝑇‘𝑥)) ≤ 𝐴))
23	22	ralbii 3114	. . . . 5 ⊢ (∀𝑥 ∈ ℋ ∀𝑧((𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴) ↔ ∀𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 → (normℎ‘(𝑇‘𝑥)) ≤ 𝐴))
24		r19.23v 3195	. . . . . 6 ⊢ (∀𝑥 ∈ ℋ ((𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴) ↔ (∃𝑥 ∈ ℋ (𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴))
25	24	albii 1852	. . . . 5 ⊢ (∀𝑧∀𝑥 ∈ ℋ ((𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴) ↔ ∀𝑧(∃𝑥 ∈ ℋ (𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴))
26	15, 23, 25	3bitr3i 304	. . . 4 ⊢ (∀𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 → (normℎ‘(𝑇‘𝑥)) ≤ 𝐴) ↔ ∀𝑧(∃𝑥 ∈ ℋ (𝑧 = (normℎ‘(𝑇‘𝑥)) ∧ (normℎ‘𝑥) ≤ 1) → 𝑧 ≤ 𝐴))
27	14, 26	bitr4i 281	. . 3 ⊢ (∀𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}𝑧 ≤ 𝐴 ↔ ∀𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 → (normℎ‘(𝑇‘𝑥)) ≤ 𝐴))
28	8, 27	bitrdi 290	. 2 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℝ*) → (sup({𝑦 ∣ ∃𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 ∧ 𝑦 = (normℎ‘(𝑇‘𝑥)))}, ℝ*, < ) ≤ 𝐴 ↔ ∀𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 → (normℎ‘(𝑇‘𝑥)) ≤ 𝐴)))
29	3, 28	bitrd 282	1 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝐴 ∈ ℝ*) → ((normop‘𝑇) ≤ 𝐴 ↔ ∀𝑥 ∈ ℋ ((normℎ‘𝑥) ≤ 1 → (normℎ‘(𝑇‘𝑥)) ≤ 𝐴)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2146  {cab 2744  ∀wral 3082  ∃wrex 3092   ⊆ wss 3908   class class class wbr 5112  ⟶wf 6536  ‘cfv 6540  supcsup 9402  ℝcr 11109  1c1 11111  ℝ^*cxr 11252   < clt 11253   ≤ cle 11254   ℋchba 31286  norm_ℎcno 31290  norm_opcnop 31312

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5260  ax-nul 5272  ax-pow 5339  ax-pr 5407  ax-un 7738  ax-cnex 11166  ax-resscn 11167  ax-1cn 11168  ax-icn 11169  ax-addcl 11170  ax-addrcl 11171  ax-mulcl 11172  ax-mulrcl 11173  ax-mulcom 11174  ax-addass 11175  ax-mulass 11176  ax-distr 11177  ax-i2m1 11178  ax-1ne0 11179  ax-1rid 11180  ax-rnegex 11181  ax-rrecex 11182  ax-cnre 11183  ax-pre-lttri 11184  ax-pre-lttrn 11185  ax-pre-ltadd 11186  ax-pre-mulgt0 11187  ax-pre-sup 11188  ax-hilex 31366  ax-hv0cl 31370  ax-hvmul0 31377  ax-hfi 31446  ax-his1 31449  ax-his3 31451  ax-his4 31452

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4876  df-iun 4961  df-br 5113  df-opab 5177  df-mpt 5196  df-tr 5222  df-id 5559  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5617  df-we 5619  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-er 8696  df-map 8828  df-en 8946  df-dom 8947  df-sdom 8948  df-sup 9404  df-pnf 11255  df-mnf 11256  df-xr 11257  df-ltxr 11258  df-le 11259  df-sub 11453  df-neg 11454  df-div 11882  df-nn 12244  df-2 12313  df-3 12314  df-n0 12515  df-z 12602  df-uz 12873  df-rp 13027  df-seq 14049  df-exp 14109  df-cj 15161  df-re 15162  df-im 15163  df-sqrt 15297  df-hnorm 31335  df-nmop 32206

This theorem is used by:  nmopub2tALT  32276  nmophmi  32398  nmopadjlem  32456  nmoptrii  32461  nmopcoi  32462  nmopcoadji  32468