Theorem nmfnlb 32389

Description: A lower bound for a functional norm. (Contributed by NM, 14-Feb-2006.) (New usage is discouraged.)

Assertion

Ref	Expression
nmfnlb	⊢ ((𝑇: ℋ⟶ℂ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (abs‘(𝑇‘𝐴)) ≤ (normfn‘𝑇))

Proof of Theorem nmfnlb

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

Step	Hyp	Ref	Expression
1		nmfnsetre 32342	. . . . 5 ⊢ (𝑇: ℋ⟶ℂ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))} ⊆ ℝ)
2		ressxr 11278	. . . . 5 ⊢ ℝ ⊆ ℝ*
3	1, 2	sstrdi 3946	. . . 4 ⊢ (𝑇: ℋ⟶ℂ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))} ⊆ ℝ*)
4	3	3ad2ant1 1151	. . 3 ⊢ ((𝑇: ℋ⟶ℂ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))} ⊆ ℝ*)
5		fveq2 6882	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (normℎ‘𝑦) = (normℎ‘𝐴))
6	5	breq1d 5117	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → ((normℎ‘𝑦) ≤ 1 ↔ (normℎ‘𝐴) ≤ 1))
7		2fveq3 6887	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (abs‘(𝑇‘𝑦)) = (abs‘(𝑇‘𝐴)))
8	7	eqeq2d 2773	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → ((abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝑦)) ↔ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝐴))))
9	6, 8	anbi12d 644	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (((normℎ‘𝑦) ≤ 1 ∧ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝑦))) ↔ ((normℎ‘𝐴) ≤ 1 ∧ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝐴)))))
10		eqid 2762	. . . . . . . 8 ⊢ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝐴))
11	10	biantru 539	. . . . . . 7 ⊢ ((normℎ‘𝐴) ≤ 1 ↔ ((normℎ‘𝐴) ≤ 1 ∧ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝐴))))
12	9, 11	bitr4di 292	. . . . . 6 ⊢ (𝑦 = 𝐴 → (((normℎ‘𝑦) ≤ 1 ∧ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝑦))) ↔ (normℎ‘𝐴) ≤ 1))
13	12	rspcev 3579	. . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝑦))))
14		fvex 6895	. . . . . 6 ⊢ (abs‘(𝑇‘𝐴)) ∈ V
15		eqeq1 2766	. . . . . . . 8 ⊢ (𝑥 = (abs‘(𝑇‘𝐴)) → (𝑥 = (abs‘(𝑇‘𝑦)) ↔ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝑦))))
16	15	anbi2d 642	. . . . . . 7 ⊢ (𝑥 = (abs‘(𝑇‘𝐴)) → (((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦))) ↔ ((normℎ‘𝑦) ≤ 1 ∧ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝑦)))))
17	16	rexbidv 3188	. . . . . 6 ⊢ (𝑥 = (abs‘(𝑇‘𝐴)) → (∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦))) ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝑦)))))
18	14, 17	elab 3636	. . . . 5 ⊢ ((abs‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))} ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ (abs‘(𝑇‘𝐴)) = (abs‘(𝑇‘𝑦))))
19	13, 18	sylibr 237	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (abs‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))})
20	19	3adant1 1148	. . 3 ⊢ ((𝑇: ℋ⟶ℂ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (abs‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))})
21		supxrub 13376	. . 3 ⊢ (({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))} ⊆ ℝ* ∧ (abs‘(𝑇‘𝐴)) ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}) → (abs‘(𝑇‘𝐴)) ≤ sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}, ℝ*, < ))
22	4, 20, 21	syl2anc 596	. 2 ⊢ ((𝑇: ℋ⟶ℂ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (abs‘(𝑇‘𝐴)) ≤ sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}, ℝ*, < ))
23		nmfnval 32341	. . 3 ⊢ (𝑇: ℋ⟶ℂ → (normfn‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}, ℝ*, < ))
24	23	3ad2ant1 1151	. 2 ⊢ ((𝑇: ℋ⟶ℂ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (normfn‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}, ℝ*, < ))
25	22, 24	breqtrrd 5137	1 ⊢ ((𝑇: ℋ⟶ℂ ∧ 𝐴 ∈ ℋ ∧ (normℎ‘𝐴) ≤ 1) → (abs‘(𝑇‘𝐴)) ≤ (normfn‘𝑇))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {cab 2740  ∃wrex 3088   ⊆ wss 3902   class class class wbr 5107  ⟶wf 6533  ‘cfv 6537  supcsup 9413  ℂcc 11123  ℝcr 11124  1c1 11126  ℝ^*cxr 11267   < clt 11268   ≤ cle 11269  abscabs 15321   ℋchba 31384  norm_ℎcno 31388  norm_fncnmf 31416

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11181  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201  ax-pre-mulgt0 11202  ax-pre-sup 11203  ax-hilex 31464

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-er 8699  df-map 8831  df-en 8956  df-dom 8957  df-sdom 8958  df-sup 9415  df-pnf 11270  df-mnf 11271  df-xr 11272  df-ltxr 11273  df-le 11274  df-sub 11468  df-neg 11469  df-div 11897  df-nn 12259  df-2 12328  df-3 12329  df-n0 12530  df-z 12617  df-uz 12889  df-rp 13043  df-seq 14066  df-exp 14126  df-cj 15186  df-re 15187  df-im 15188  df-sqrt 15322  df-abs 15323  df-nmfn 32310

This theorem is used by:  nmfnge0  32392  nmbdfnlbi  32514  nmcfnlbi  32517