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 6849 . . . 4 𝑌 ∈ V
3 nmoofval.1 . . . . 5 𝑋 = (BaseSet‘𝑈)
43fvexi 6849 . . . 4 𝑋 ∈ V
52, 4elmap 8813 . . 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 6837 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑁𝑇) = ((𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))‘𝑇))
11 fveq1 6834 . . . . . . . . . . 11 (𝑡 = 𝑇 → (𝑡𝑧) = (𝑇𝑧))
1211fveq2d 6839 . . . . . . . . . 10 (𝑡 = 𝑇 → (𝑀‘(𝑡𝑧)) = (𝑀‘(𝑇𝑧)))
1312eqeq2d 2748 . . . . . . . . 9 (𝑡 = 𝑇 → (𝑥 = (𝑀‘(𝑡𝑧)) ↔ 𝑥 = (𝑀‘(𝑇𝑧))))
1413anbi2d 631 . . . . . . . 8 (𝑡 = 𝑇 → (((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧))) ↔ ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))))
1514rexbidv 3162 . . . . . . 7 (𝑡 = 𝑇 → (∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧))) ↔ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))))
1615abbidv 2803 . . . . . 6 (𝑡 = 𝑇 → {𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))} = {𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))})
1716supeq1d 9353 . . . . 5 (𝑡 = 𝑇 → sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
18 eqid 2737 . . . . 5 (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < )) = (𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))
19 xrltso 13086 . . . . . 6 < Or ℝ*
2019supex 9371 . . . . 5 sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ) ∈ V
2117, 18, 20fvmpt 6942 . . . 4 (𝑇 ∈ (𝑌m 𝑋) → ((𝑡 ∈ (𝑌m 𝑋) ↦ sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑡𝑧)))}, ℝ*, < ))‘𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
2210, 21sylan9eq 2792 . . 3 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑇 ∈ (𝑌m 𝑋)) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
235, 22sylan2br 596 . 2 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑇:𝑋𝑌) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
24233impa 1110 1 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋𝑌) → (𝑁𝑇) = sup({𝑥 ∣ ∃𝑧𝑋 ((𝐿𝑧) ≤ 1 ∧ 𝑥 = (𝑀‘(𝑇𝑧)))}, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  {cab 2715  wrex 3062   class class class wbr 5086  cmpt 5167  wf 6489  cfv 6493  (class class class)co 7361  m cmap 8767  supcsup 9347  1c1 11033  *cxr 11172   < clt 11173  cle 11174  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 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 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683  ax-cnex 11088  ax-resscn 11089  ax-pre-lttri 11106  ax-pre-lttrn 11107
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 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-po 5533  df-so 5534  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-er 8637  df-map 8769  df-en 8888  df-dom 8889  df-sdom 8890  df-sup 9349  df-pnf 11175  df-mnf 11176  df-xr 11177  df-ltxr 11178  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