| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nmoreltpnf | Structured version Visualization version GIF version | ||
| Description: The norm of any operator is real iff it is less than plus infinity. (Contributed by NM, 8-Dec-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nmoxr.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| nmoxr.2 | ⊢ 𝑌 = (BaseSet‘𝑊) |
| nmoxr.3 | ⊢ 𝑁 = (𝑈 normOpOLD 𝑊) |
| Ref | Expression |
|---|---|
| nmoreltpnf | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ((𝑁‘𝑇) ∈ ℝ ↔ (𝑁‘𝑇) < +∞)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nmoxr.1 | . . 3 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 2 | nmoxr.2 | . . 3 ⊢ 𝑌 = (BaseSet‘𝑊) | |
| 3 | nmoxr.3 | . . 3 ⊢ 𝑁 = (𝑈 normOpOLD 𝑊) | |
| 4 | 1, 2, 3 | nmorepnf 31382 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ((𝑁‘𝑇) ∈ ℝ ↔ (𝑁‘𝑇) ≠ +∞)) |
| 5 | 1, 2, 3 | nmoxr 31380 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝑁‘𝑇) ∈ ℝ*) |
| 6 | nltpnft 13304 | . . . 4 ⊢ ((𝑁‘𝑇) ∈ ℝ* → ((𝑁‘𝑇) = +∞ ↔ ¬ (𝑁‘𝑇) < +∞)) | |
| 7 | 5, 6 | syl 18 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ((𝑁‘𝑇) = +∞ ↔ ¬ (𝑁‘𝑇) < +∞)) |
| 8 | 7 | necon2abid 3000 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ((𝑁‘𝑇) < +∞ ↔ (𝑁‘𝑇) ≠ +∞)) |
| 9 | 4, 8 | bitr4d 285 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ((𝑁‘𝑇) ∈ ℝ ↔ (𝑁‘𝑇) < +∞)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 ≠ wne 2958 class class class wbr 5105 ⟶wf 6542 ‘cfv 6546 (class class class)co 7427 ℝcr 11209 +∞cpnf 11350 ℝ*cxr 11352 < clt 11353 NrmCVeccnv 31198 BaseSetcba 31200 normOpOLD cnmoo 31355 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 ax-pre-sup 11288 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-1st 8008 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-er 8728 df-map 8860 df-en 8985 df-dom 8986 df-sdom 8987 df-sup 9444 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-div 11984 df-nn 12346 df-2 12415 df-3 12416 df-n0 12617 df-z 12704 df-uz 12976 df-rp 13131 df-seq 14155 df-exp 14215 df-cj 15278 df-re 15279 df-im 15280 df-sqrt 15414 df-abs 15415 df-grpo 31107 df-gid 31108 df-ginv 31109 df-ablo 31159 df-vc 31173 df-nv 31206 df-va 31209 df-ba 31210 df-sm 31211 df-0v 31212 df-nmcv 31214 df-nmoo 31359 |
| This theorem is used by: isblo2 31397 |
| Copyright terms: Public domain | W3C validator |