nmorepnf - Metamath Proof Explorer

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

Theorem nmorepnf 30456

Description: The norm of an operator is either real or plus infinity. (Contributed by NM, 8-Dec-2007.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
nmoxr.1	⊢ 𝑋 = (BaseSet‘𝑈)
nmoxr.2	⊢ 𝑌 = (BaseSet‘𝑊)
nmoxr.3	⊢ 𝑁 = (𝑈 normOp_OLD 𝑊)

**Assertion**
Ref	Expression
nmorepnf	⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ((𝑁‘𝑇) ∈ ℝ ↔ (𝑁‘𝑇) ≠ +∞))

Proof of Theorem nmorepnf Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nmoxr.2	. . . . 5 ⊢ 𝑌 = (BaseSet‘𝑊)
2		eqid 2724	. . . . 5 ⊢ (norm_CV‘𝑊) = (norm_CV‘𝑊)
3	1, 2	nmosetre 30452	. . . 4 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → {𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))} ⊆ ℝ)
4		nmoxr.1	. . . . . 6 ⊢ 𝑋 = (BaseSet‘𝑈)
5		eqid 2724	. . . . . 6 ⊢ (0_vec‘𝑈) = (0_vec‘𝑈)
6		eqid 2724	. . . . . 6 ⊢ (norm_CV‘𝑈) = (norm_CV‘𝑈)
7	4, 5, 6	nmosetn0 30453	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → ((norm_CV‘𝑊)‘(𝑇‘(0_vec‘𝑈))) ∈ {𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))})
8	7	ne0d 4327	. . . 4 ⊢ (𝑈 ∈ NrmCVec → {𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))} ≠ ∅)
9		supxrre2 13306	. . . 4 ⊢ (({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))} ⊆ ℝ ∧ {𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))} ≠ ∅) → (sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))}, ℝ^, < ) ∈ ℝ ↔ sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))}, ℝ^, < ) ≠ +∞))
10	3, 8, 9	syl2anr 596	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌)) → (sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))}, ℝ^, < ) ∈ ℝ ↔ sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))}, ℝ^, < ) ≠ +∞))
11	10	3impb 1112	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))}, ℝ^, < ) ∈ ℝ ↔ sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))}, ℝ^, < ) ≠ +∞))
12		nmoxr.3	. . . 4 ⊢ 𝑁 = (𝑈 normOp_OLD 𝑊)
13	4, 1, 6, 2, 12	nmooval 30451	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝑁‘𝑇) = sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))}, ℝ^*, < ))
14	13	eleq1d 2810	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ((𝑁‘𝑇) ∈ ℝ ↔ sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))}, ℝ^*, < ) ∈ ℝ))
15	13	neeq1d 2992	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ((𝑁‘𝑇) ≠ +∞ ↔ sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((norm_CV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((norm_CV‘𝑊)‘(𝑇‘𝑧)))}, ℝ^*, < ) ≠ +∞))
16	11, 14, 15	3bitr4d 311	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ((𝑁‘𝑇) ∈ ℝ ↔ (𝑁‘𝑇) ≠ +∞))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 {cab 2701 ≠ wne 2932 ∃wrex 3062 ⊆ wss 3940 ∅c0 4314 class class class wbr 5138 ⟶wf 6529 ‘cfv 6533 (class class class)co 7401 supcsup 9430 ℝcr 11104 1c1 11106 +∞cpnf 11241 ℝ^*cxr 11243 < clt 11244 ≤ cle 11245 NrmCVeccnv 30272 BaseSetcba 30274 0_veccn0v 30276 norm_CVcnmcv 30278 normOp_OLD cnmoo 30429

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5275 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-cnex 11161 ax-resscn 11162 ax-1cn 11163 ax-icn 11164 ax-addcl 11165 ax-addrcl 11166 ax-mulcl 11167 ax-mulrcl 11168 ax-mulcom 11169 ax-addass 11170 ax-mulass 11171 ax-distr 11172 ax-i2m1 11173 ax-1ne0 11174 ax-1rid 11175 ax-rnegex 11176 ax-rrecex 11177 ax-cnre 11178 ax-pre-lttri 11179 ax-pre-lttrn 11180 ax-pre-ltadd 11181 ax-pre-mulgt0 11182 ax-pre-sup 11183

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7357 df-ov 7404 df-oprab 7405 df-mpo 7406 df-om 7849 df-1st 7968 df-2nd 7969 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-er 8698 df-map 8817 df-en 8935 df-dom 8936 df-sdom 8937 df-sup 9432 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-n0 12469 df-z 12555 df-uz 12819 df-rp 12971 df-seq 13963 df-exp 14024 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-grpo 30181 df-gid 30182 df-ginv 30183 df-ablo 30233 df-vc 30247 df-nv 30280 df-va 30283 df-ba 30284 df-sm 30285 df-0v 30286 df-nmcv 30288 df-nmoo 30433

This theorem is referenced by: nmoreltpnf 30457 nmogtmnf 30458 nmounbi 30464

W3C validator