Theorem bloval 30810

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 7438	. . . 4 ⊢ (𝑢 = 𝑈 → (𝑢 LnOp 𝑤) = (𝑈 LnOp 𝑤))
3		oveq1 7438	. . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑤))
4	3	fveq1d 6909	. . . . 5 ⊢ (𝑢 = 𝑈 → ((𝑢 normOpOLD 𝑤)‘𝑡) = ((𝑈 normOpOLD 𝑤)‘𝑡))
5	4	breq1d 5158	. . . 4 ⊢ (𝑢 = 𝑈 → (((𝑢 normOpOLD 𝑤)‘𝑡) < +∞ ↔ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞))
6	2, 5	rabeqbidv 3452	. . 3 ⊢ (𝑢 = 𝑈 → {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞})
7		oveq2 7439	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = (𝑈 LnOp 𝑊))
8		bloval.4	. . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
9	7, 8	eqtr4di 2793	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = 𝐿)
10		oveq2 7439	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑊))
11		bloval.3	. . . . . . 7 ⊢ 𝑁 = (𝑈 normOpOLD 𝑊)
12	10, 11	eqtr4di 2793	. . . . . 6 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = 𝑁)
13	12	fveq1d 6909	. . . . 5 ⊢ (𝑤 = 𝑊 → ((𝑈 normOpOLD 𝑤)‘𝑡) = (𝑁‘𝑡))
14	13	breq1d 5158	. . . 4 ⊢ (𝑤 = 𝑊 → (((𝑈 normOpOLD 𝑤)‘𝑡) < +∞ ↔ (𝑁‘𝑡) < +∞))
15	9, 14	rabeqbidv 3452	. . 3 ⊢ (𝑤 = 𝑊 → {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})
16		df-blo 30775	. . 3 ⊢ BLnOp = (𝑢 ∈ NrmCVec, 𝑤 ∈ NrmCVec ↦ {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞})
17	8	ovexi 7465	. . . 4 ⊢ 𝐿 ∈ V
18	17	rabex 5345	. . 3 ⊢ {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞} ∈ V
19	6, 15, 16, 18	ovmpo 7593	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑈 BLnOp 𝑊) = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})
20	1, 19	eqtrid 2787	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐵 = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2106  {crab 3433   class class class wbr 5148  ‘cfv 6563  (class class class)co 7431  +∞cpnf 11290   < clt 11293  NrmCVeccnv 30613   LnOp clno 30769   normOp_OLD cnmoo 30770   BLnOp cblo 30771

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-iota 6516  df-fun 6565  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-blo 30775

This theorem is referenced by:  isblo  30811  hhbloi  31931