Theorem bloval 30870

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 7363	. . . 4 ⊢ (𝑢 = 𝑈 → (𝑢 LnOp 𝑤) = (𝑈 LnOp 𝑤))
3		oveq1 7363	. . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑤))
4	3	fveq1d 6829	. . . . 5 ⊢ (𝑢 = 𝑈 → ((𝑢 normOpOLD 𝑤)‘𝑡) = ((𝑈 normOpOLD 𝑤)‘𝑡))
5	4	breq1d 5082	. . . 4 ⊢ (𝑢 = 𝑈 → (((𝑢 normOpOLD 𝑤)‘𝑡) < +∞ ↔ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞))
6	2, 5	rabeqbidv 3409	. . 3 ⊢ (𝑢 = 𝑈 → {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞})
7		oveq2 7364	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = (𝑈 LnOp 𝑊))
8		bloval.4	. . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
9	7, 8	eqtr4di 2792	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = 𝐿)
10		oveq2 7364	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑊))
11		bloval.3	. . . . . . 7 ⊢ 𝑁 = (𝑈 normOpOLD 𝑊)
12	10, 11	eqtr4di 2792	. . . . . 6 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = 𝑁)
13	12	fveq1d 6829	. . . . 5 ⊢ (𝑤 = 𝑊 → ((𝑈 normOpOLD 𝑤)‘𝑡) = (𝑁‘𝑡))
14	13	breq1d 5082	. . . 4 ⊢ (𝑤 = 𝑊 → (((𝑈 normOpOLD 𝑤)‘𝑡) < +∞ ↔ (𝑁‘𝑡) < +∞))
15	9, 14	rabeqbidv 3409	. . 3 ⊢ (𝑤 = 𝑊 → {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})
16		df-blo 30835	. . 3 ⊢ BLnOp = (𝑢 ∈ NrmCVec, 𝑤 ∈ NrmCVec ↦ {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞})
17	8	ovexi 7390	. . . 4 ⊢ 𝐿 ∈ V
18	17	rabex 5267	. . 3 ⊢ {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞} ∈ V
19	6, 15, 16, 18	ovmpo 7516	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑈 BLnOp 𝑊) = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})
20	1, 19	eqtrid 2786	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐵 = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞})

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119  {crab 3391   class class class wbr 5072  ‘cfv 6485  (class class class)co 7356  +∞cpnf 11167   < clt 11170  NrmCVeccnv 30673   LnOp clno 30829   normOp_OLD cnmoo 30830   BLnOp cblo 30831

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-iota 6441  df-fun 6487  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-blo 30835

This theorem is referenced by:  isblo  30871  hhbloi  31991