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

Theorem nmooval 31115
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 6895 . . . 4 𝑌 ∈ V
3 nmoofval.1 . . . . 5 𝑋 = (BaseSet‘𝑈)
43fvexi 6895 . . . 4 𝑋 ∈ V
52, 4elmap 8865 . . 3 (𝑇 ∈ (𝑌m 𝑋) ↔ 𝑇:𝑋𝑌)
6 nmoofval.3 . . . . . 6 𝐿 = (normCV𝑈)
7 nmoofval.4 . . . . . 6 𝑀 = (normCV𝑊)
8 nmoofval.6 . . . . . 6 𝑁 = (𝑈 normOpOLD 𝑊)
93, 1, 6, 7, 8nmoofval 31114 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑁 = (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < )))
109fveq1d 6883 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑁𝑇) = ((𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))‘𝑇))
11 fveq1 6880 . . . . . . . . . . 11 (𝑡 = 𝑇 → (𝑡𝑧) = (𝑇𝑧))
1211fveq2d 6885 . . . . . . . . . 10 (𝑡 = 𝑇 → (𝑀‘(𝑡𝑧)) = (𝑀‘(𝑇𝑧)))
1312eqeq2d 2774 . . . . . . . . 9 (𝑡 = 𝑇 → (𝑥 = (𝑀‘(𝑡𝑧)) ↔ 𝑥 = (𝑀‘(𝑇𝑧))))
1413anbi2d 641 . . . . . . . 8 (𝑡 = 𝑇 → (((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧))) ↔ ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))))
1514rexbidv 3189 . . . . . . 7 (𝑡 = 𝑇 → (∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧))) ↔ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))))
1615abbidv 2829 . . . . . 6 (𝑡 = 𝑇 → {𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))} = {𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))})
1716supeq1d 9402 . . . . 5 (𝑡 = 𝑇 → sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
18 eqid 2763 . . . . 5 (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < )) = (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))
19 xrltso 13161 . . . . . 6 < Or ℝ*
2019supex 9420 . . . . 5 sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ) ∈ V
2117, 18, 20fvmpt 6989 . . . 4 (𝑇 ∈ (𝑌m 𝑋) → ((𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))‘𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
2210, 21sylan9eq 2818 . . 3 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑇 ∈ (𝑌m 𝑋)) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
235, 22sylan2br 606 . 2 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑇:𝑋𝑌) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
24233impa 1127 1 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋𝑌) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  {cab 2741  wrex 3089   class class class wbr 5109  cmpt 5192  wf 6532  cfv 6536  (class class class)co 7410  m cmap 8820  supcsup 9396  1c1 11096  *cxr 11237   < clt 11238  cle 11239  NrmCVeccnv 30936  BaseSetcba 30938  normCVcnmcv 30942   normOpOLD cnmoo 31093
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152  ax-pre-lttri 11169  ax-pre-lttrn 11170
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  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 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-po 5569  df-so 5570  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-sup 9398  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-nmoo 31097
This theorem is referenced by:  nmoxr  31118  nmooge0  31119  nmorepnf  31120  nmoolb  31123  nmoubi  31124  nmoo0  31143  nmlno0lem  31145
  Copyright terms: Public domain W3C validator