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

Theorem nmooval 29026
Description: The operator norm function. (Contributed by NM, 27-Nov-2007.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
nmoofval.1 𝑋 = (BaseSet‘𝑈)
nmoofval.2 𝑌 = (BaseSet‘𝑊)
nmoofval.3 𝐿 = (normCV𝑈)
nmoofval.4 𝑀 = (normCV𝑊)
nmoofval.6 𝑁 = (𝑈 normOpOLD 𝑊)
Assertion
Ref Expression
nmooval ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋𝑌) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
Distinct variable groups:   𝑥,𝑧,𝑈   𝑥,𝑊,𝑧   𝑧,𝑋   𝑥,𝑌   𝑥,𝑇,𝑧
Allowed substitution hints:   𝐿(𝑥,𝑧)   𝑀(𝑥,𝑧)   𝑁(𝑥,𝑧)   𝑋(𝑥)   𝑌(𝑧)

Proof of Theorem nmooval
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 nmoofval.2 . . . . 5 𝑌 = (BaseSet‘𝑊)
21fvexi 6770 . . . 4 𝑌 ∈ V
3 nmoofval.1 . . . . 5 𝑋 = (BaseSet‘𝑈)
43fvexi 6770 . . . 4 𝑋 ∈ V
52, 4elmap 8617 . . 3 (𝑇 ∈ (𝑌m 𝑋) ↔ 𝑇:𝑋𝑌)
6 nmoofval.3 . . . . . 6 𝐿 = (normCV𝑈)
7 nmoofval.4 . . . . . 6 𝑀 = (normCV𝑊)
8 nmoofval.6 . . . . . 6 𝑁 = (𝑈 normOpOLD 𝑊)
93, 1, 6, 7, 8nmoofval 29025 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑁 = (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < )))
109fveq1d 6758 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑁𝑇) = ((𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))‘𝑇))
11 fveq1 6755 . . . . . . . . . . 11 (𝑡 = 𝑇 → (𝑡𝑧) = (𝑇𝑧))
1211fveq2d 6760 . . . . . . . . . 10 (𝑡 = 𝑇 → (𝑀‘(𝑡𝑧)) = (𝑀‘(𝑇𝑧)))
1312eqeq2d 2749 . . . . . . . . 9 (𝑡 = 𝑇 → (𝑥 = (𝑀‘(𝑡𝑧)) ↔ 𝑥 = (𝑀‘(𝑇𝑧))))
1413anbi2d 628 . . . . . . . 8 (𝑡 = 𝑇 → (((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧))) ↔ ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))))
1514rexbidv 3225 . . . . . . 7 (𝑡 = 𝑇 → (∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧))) ↔ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))))
1615abbidv 2808 . . . . . 6 (𝑡 = 𝑇 → {𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))} = {𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))})
1716supeq1d 9135 . . . . 5 (𝑡 = 𝑇 → sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
18 eqid 2738 . . . . 5 (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < )) = (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))
19 xrltso 12804 . . . . . 6 < Or ℝ*
2019supex 9152 . . . . 5 sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ) ∈ V
2117, 18, 20fvmpt 6857 . . . 4 (𝑇 ∈ (𝑌m 𝑋) → ((𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))‘𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
2210, 21sylan9eq 2799 . . 3 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑇 ∈ (𝑌m 𝑋)) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
235, 22sylan2br 594 . 2 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑇:𝑋𝑌) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
24233impa 1108 1 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋𝑌) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1539  wcel 2108  {cab 2715  wrex 3064   class class class wbr 5070  cmpt 5153  wf 6414  cfv 6418  (class class class)co 7255  m cmap 8573  supcsup 9129  1c1 10803  *cxr 10939   < clt 10940  cle 10941  NrmCVeccnv 28847  BaseSetcba 28849  normCVcnmcv 28853   normOpOLD cnmoo 29004
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-pre-lttri 10876  ax-pre-lttrn 10877
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-po 5494  df-so 5495  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-er 8456  df-map 8575  df-en 8692  df-dom 8693  df-sdom 8694  df-sup 9131  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-nmoo 29008
This theorem is referenced by:  nmoxr  29029  nmooge0  29030  nmorepnf  29031  nmoolb  29034  nmoubi  29035  nmoo0  29054  nmlno0lem  29056
  Copyright terms: Public domain W3C validator