isblo2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > isblo2		Structured version Visualization version GIF version

Theorem isblo2 30860

Description: The predicate "is a bounded linear operator." (Contributed by NM, 8-Dec-2007.) (New usage is discouraged.)

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

**Assertion**
Ref	Expression
isblo2	⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇 ∈ 𝐵 ↔ (𝑇 ∈ 𝐿 ∧ (𝑁‘𝑇) ∈ ℝ)))

**Proof of Theorem isblo2**
Step	Hyp	Ref	Expression
1		bloval.3	. . 3 ⊢ 𝑁 = (𝑈 normOp_OLD 𝑊)
2		bloval.4	. . 3 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
3		bloval.5	. . 3 ⊢ 𝐵 = (𝑈 BLnOp 𝑊)
4	1, 2, 3	isblo 30859	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇 ∈ 𝐵 ↔ (𝑇 ∈ 𝐿 ∧ (𝑁‘𝑇) < +∞)))
5		eqid 2736	. . . . . 6 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
6		eqid 2736	. . . . . 6 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊)
7	5, 6, 2	lnof 30832	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊))
8	5, 6, 1	nmoreltpnf 30846	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → ((𝑁‘𝑇) ∈ ℝ ↔ (𝑁‘𝑇) < +∞))
9	7, 8	syld3an3 1411	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) ∈ ℝ ↔ (𝑁‘𝑇) < +∞))
10	9	3expa 1118	. . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) ∈ ℝ ↔ (𝑁‘𝑇) < +∞))
11	10	pm5.32da 579	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → ((𝑇 ∈ 𝐿 ∧ (𝑁‘𝑇) ∈ ℝ) ↔ (𝑇 ∈ 𝐿 ∧ (𝑁‘𝑇) < +∞)))
12	4, 11	bitr4d 282	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇 ∈ 𝐵 ↔ (𝑇 ∈ 𝐿 ∧ (𝑁‘𝑇) ∈ ℝ)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 class class class wbr 5098 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 ℝcr 11027 +∞cpnf 11165 < clt 11168 NrmCVeccnv 30661 BaseSetcba 30663 LnOp clno 30817 normOp_OLD cnmoo 30818 BLnOp cblo 30819

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-map 8767 df-en 8886 df-dom 8887 df-sdom 8888 df-sup 9347 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12148 df-2 12210 df-3 12211 df-n0 12404 df-z 12491 df-uz 12754 df-rp 12908 df-seq 13927 df-exp 13987 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-grpo 30570 df-gid 30571 df-ginv 30572 df-ablo 30622 df-vc 30636 df-nv 30669 df-va 30672 df-ba 30673 df-sm 30674 df-0v 30675 df-nmcv 30677 df-lno 30821 df-nmoo 30822 df-blo 30823

This theorem is referenced by: 0blo 30869

W3C validator