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

Theorem nmooval 30852
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 6841 . . . 4 𝑌 ∈ V
3 nmoofval.1 . . . . 5 𝑋 = (BaseSet‘𝑈)
43fvexi 6841 . . . 4 𝑋 ∈ V
52, 4elmap 8809 . . 3 (𝑇 ∈ (𝑌m 𝑋) ↔ 𝑇:𝑋𝑌)
6 nmoofval.3 . . . . . 6 𝐿 = (normCV𝑈)
7 nmoofval.4 . . . . . 6 𝑀 = (normCV𝑊)
8 nmoofval.6 . . . . . 6 𝑁 = (𝑈 normOpOLD 𝑊)
93, 1, 6, 7, 8nmoofval 30851 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑁 = (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < )))
109fveq1d 6829 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑁𝑇) = ((𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))‘𝑇))
11 fveq1 6826 . . . . . . . . . . 11 (𝑡 = 𝑇 → (𝑡𝑧) = (𝑇𝑧))
1211fveq2d 6831 . . . . . . . . . 10 (𝑡 = 𝑇 → (𝑀‘(𝑡𝑧)) = (𝑀‘(𝑇𝑧)))
1312eqeq2d 2750 . . . . . . . . 9 (𝑡 = 𝑇 → (𝑥 = (𝑀‘(𝑡𝑧)) ↔ 𝑥 = (𝑀‘(𝑇𝑧))))
1413anbi2d 636 . . . . . . . 8 (𝑡 = 𝑇 → (((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧))) ↔ ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))))
1514rexbidv 3163 . . . . . . 7 (𝑡 = 𝑇 → (∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧))) ↔ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))))
1615abbidv 2805 . . . . . 6 (𝑡 = 𝑇 → {𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))} = {𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))})
1716supeq1d 9349 . . . . 5 (𝑡 = 𝑇 → sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
18 eqid 2739 . . . . 5 (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < )) = (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))
19 xrltso 13083 . . . . . 6 < Or ℝ*
2019supex 9367 . . . . 5 sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ) ∈ V
2117, 18, 20fvmpt 6935 . . . 4 (𝑇 ∈ (𝑌m 𝑋) → ((𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))‘𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
2210, 21sylan9eq 2794 . . 3 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑇 ∈ (𝑌m 𝑋)) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
235, 22sylan2br 601 . 2 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑇:𝑋𝑌) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
24233impa 1115 1 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋𝑌) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1092   = wceq 1547  wcel 2119  {cab 2717  wrex 3063   class class class wbr 5072  cmpt 5153  wf 6481  cfv 6485  (class class class)co 7356  m cmap 8763  supcsup 9343  1c1 11030  *cxr 11169   < clt 11170  cle 11171  NrmCVeccnv 30673  BaseSetcba 30675  normCVcnmcv 30679   normOpOLD cnmoo 30830
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086  ax-pre-lttri 11103  ax-pre-lttrn 11104
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-po 5526  df-so 5527  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-er 8633  df-map 8765  df-en 8884  df-dom 8885  df-sdom 8886  df-sup 9345  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-nmoo 30834
This theorem is referenced by:  nmoxr  30855  nmooge0  30856  nmorepnf  30857  nmoolb  30860  nmoubi  30861  nmoo0  30880  nmlno0lem  30882
  Copyright terms: Public domain W3C validator