| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nmoxr | Structured version Visualization version GIF version | ||
| Description: The norm of an operator is an extended real. (Contributed by NM, 27-Nov-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nmoxr.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| nmoxr.2 | ⊢ 𝑌 = (BaseSet‘𝑊) |
| nmoxr.3 | ⊢ 𝑁 = (𝑈 normOpOLD 𝑊) |
| Ref | Expression |
|---|---|
| nmoxr | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝑁‘𝑇) ∈ ℝ*) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nmoxr.1 | . . 3 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 2 | nmoxr.2 | . . 3 ⊢ 𝑌 = (BaseSet‘𝑊) | |
| 3 | eqid 2737 | . . 3 ⊢ (normCV‘𝑈) = (normCV‘𝑈) | |
| 4 | eqid 2737 | . . 3 ⊢ (normCV‘𝑊) = (normCV‘𝑊) | |
| 5 | nmoxr.3 | . . 3 ⊢ 𝑁 = (𝑈 normOpOLD 𝑊) | |
| 6 | 1, 2, 3, 4, 5 | nmooval 30851 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝑁‘𝑇) = sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((normCV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((normCV‘𝑊)‘(𝑇‘𝑧)))}, ℝ*, < )) |
| 7 | 2, 4 | nmosetre 30852 | . . . . 5 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → {𝑥 ∣ ∃𝑧 ∈ 𝑋 (((normCV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((normCV‘𝑊)‘(𝑇‘𝑧)))} ⊆ ℝ) |
| 8 | ressxr 11188 | . . . . 5 ⊢ ℝ ⊆ ℝ* | |
| 9 | 7, 8 | sstrdi 3948 | . . . 4 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → {𝑥 ∣ ∃𝑧 ∈ 𝑋 (((normCV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((normCV‘𝑊)‘(𝑇‘𝑧)))} ⊆ ℝ*) |
| 10 | supxrcl 13242 | . . . 4 ⊢ ({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((normCV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((normCV‘𝑊)‘(𝑇‘𝑧)))} ⊆ ℝ* → sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((normCV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((normCV‘𝑊)‘(𝑇‘𝑧)))}, ℝ*, < ) ∈ ℝ*) | |
| 11 | 9, 10 | syl 17 | . . 3 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((normCV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((normCV‘𝑊)‘(𝑇‘𝑧)))}, ℝ*, < ) ∈ ℝ*) |
| 12 | 11 | 3adant1 1131 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → sup({𝑥 ∣ ∃𝑧 ∈ 𝑋 (((normCV‘𝑈)‘𝑧) ≤ 1 ∧ 𝑥 = ((normCV‘𝑊)‘(𝑇‘𝑧)))}, ℝ*, < ) ∈ ℝ*) |
| 13 | 6, 12 | eqeltrd 2837 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝑁‘𝑇) ∈ ℝ*) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 {cab 2715 ∃wrex 3062 ⊆ wss 3903 class class class wbr 5100 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 supcsup 9355 ℝcr 11037 1c1 11039 ℝ*cxr 11177 < clt 11178 ≤ cle 11179 NrmCVeccnv 30672 BaseSetcba 30674 normCVcnmcv 30678 normOpOLD cnmoo 30829 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-po 5540 df-so 5541 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-er 8645 df-map 8777 df-en 8896 df-dom 8897 df-sdom 8898 df-sup 9357 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-vc 30647 df-nv 30680 df-va 30683 df-ba 30684 df-sm 30685 df-0v 30686 df-nmcv 30688 df-nmoo 30833 |
| This theorem is referenced by: nmooge0 30855 nmoreltpnf 30857 nmobndi 30863 nmblore 30874 nmlnogt0 30885 isblo3i 30889 ubthlem3 30960 |
| Copyright terms: Public domain | W3C validator |