Theorem bloval 31204

Description: The class of bounded linear operators between two normed complex vector spaces. (Contributed by NM, 6-Nov-2007.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bloval.3	⊢ 𝑁 = (𝑈 normOpOLD 𝑊)
bloval.4	⊢ 𝐿 = (𝑈 LnOp 𝑊)
bloval.5	⊢ 𝐵 = (𝑈 BLnOp 𝑊)

Assertion

Ref	Expression
bloval	⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐵 = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})

Distinct variable groups:   𝑡,𝐿   𝑡,𝑁   𝑡,𝑈   𝑡,𝑊

Allowed substitution hint:   𝐵(𝑡)

Proof of Theorem bloval

Dummy variables 𝑢 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bloval.5	. 2 ⊢ 𝐵 = (𝑈 BLnOp 𝑊)
2		oveq1 7426	. . . 4 ⊢ (𝑢 = 𝑈 → (𝑢 LnOp 𝑤) = (𝑈 LnOp 𝑤))
3		oveq1 7426	. . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑤))
4	3	fveq1d 6887	. . . . 5 ⊢ (𝑢 = 𝑈 → ((𝑢 normOpOLD 𝑤)‘𝑡) = ((𝑈 normOpOLD 𝑤)‘𝑡))
5	4	breq1d 5121	. . . 4 ⊢ (𝑢 = 𝑈 → (((𝑢 normOpOLD 𝑤)‘𝑡) < +∞ ↔ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞))
6	2, 5	rabeqbidv 3436	. . 3 ⊢ (𝑢 = 𝑈 → {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞})
7		oveq2 7427	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = (𝑈 LnOp 𝑊))
8		bloval.4	. . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
9	7, 8	eqtr4di 2818	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = 𝐿)
10		oveq2 7427	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑊))
11		bloval.3	. . . . . . 7 ⊢ 𝑁 = (𝑈 normOpOLD 𝑊)
12	10, 11	eqtr4di 2818	. . . . . 6 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = 𝑁)
13	12	fveq1d 6887	. . . . 5 ⊢ (𝑤 = 𝑊 → ((𝑈 normOpOLD 𝑤)‘𝑡) = (𝑁‘𝑡))
14	13	breq1d 5121	. . . 4 ⊢ (𝑤 = 𝑊 → (((𝑈 normOpOLD 𝑤)‘𝑡) < +∞ ↔ (𝑁‘𝑡) < +∞))
15	9, 14	rabeqbidv 3436	. . 3 ⊢ (𝑤 = 𝑊 → {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})
16		df-blo 31169	. . 3 ⊢ BLnOp = (𝑢 ∈ NrmCVec, 𝑤 ∈ NrmCVec ↦ {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞})
17	8	ovexi 7453	. . . 4 ⊢ 𝐿 ∈ V
18	17	rabex 5311	. . 3 ⊢ {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞} ∈ V
19	6, 15, 16, 18	ovmpo 7579	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑈 BLnOp 𝑊) = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})
20	1, 19	eqtrid 2812	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐵 = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  {crab 3418   class class class wbr 5111  ‘cfv 6540  (class class class)co 7419  +∞cpnf 11255   < clt 11258  NrmCVeccnv 31007   LnOp clno 31163   normOp_OLD cnmoo 31164   BLnOp cblo 31165

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 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-blo 31169

This theorem is used by:  isblo  31205  hhbloi  32325