HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem nmoval 8426
Description: The operator norm function.
Hypotheses
Ref Expression
nmofval.1 |- X = (Base` U)
nmofval.2 |- Y = (Base` W)
nmofval.3 |- L = (norm` U)
nmofval.4 |- M = (norm` W)
nmofval.6 |- N = (UnormOpW)
Assertion
Ref Expression
nmoval |- ((U e. NrmCVec /\ W e. NrmCVec /\ T:X-->Y) -> (N` T) = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))}, RR*, < ))
Distinct variable groups:   x,z,T   x,U,z   x,W,z   x,X,z   x,Y

Proof of Theorem nmoval
StepHypRef Expression
1 nmofval.1 . . . . 5 |- X = (Base` U)
2 nmofval.2 . . . . 5 |- Y = (Base` W)
3 nmofval.3 . . . . 5 |- L = (norm` U)
4 nmofval.4 . . . . 5 |- M = (norm` W)
5 nmofval.6 . . . . 5 |- N = (UnormOpW)
61, 2, 3, 4, 5nmofval 8425 . . . 4 |- ((U e. NrmCVec /\ W e. NrmCVec) -> N = {<.t, y>. | (t:X-->Y /\ y = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))}, RR*, < ))})
76fveq1d 3726 . . 3 |- ((U e. NrmCVec /\ W e. NrmCVec) -> (N` T) = ({<.t, y>. | (t:X-->Y /\ y = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))}, RR*, < ))}` T))
873adant3 799 . 2 |- ((U e. NrmCVec /\ W e. NrmCVec /\ T:X-->Y) -> (N` T) = ({<.t, y>. | (t:X-->Y /\ y = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))}, RR*, < ))}` T))
9 xrltso 5554 . . . . 5 |- < Or RR*
109supex 4577 . . . 4 |- sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))}, RR*, < ) e. V
11 fvex 3732 . . . . 5 |- (Base` U) e. V
121, 11eqeltr 1544 . . . 4 |- X e. V
13 fvex 3732 . . . . 5 |- (Base` W) e. V
142, 13eqeltr 1544 . . . 4 |- Y e. V
15 fveq1 3723 . . . . . . . . . 10 |- (t = T -> (t` z) = (T` z))
1615fveq2d 3728 . . . . . . . . 9 |- (t = T -> (M` (t` z)) = (M` (T` z)))
1716eqeq2d 1486 . . . . . . . 8 |- (t = T -> (x = (M` (t` z)) <-> x = (M` (T` z))))
1817anbi2d 616 . . . . . . 7 |- (t = T -> (((L` z) <_ 1 /\ x = (M` (t` z))) <-> ((L` z) <_ 1 /\ x = (M` (T` z)))))
1918rexbidv 1664 . . . . . 6 |- (t = T -> (E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z))) <-> E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))))
2019abbidv 1577 . . . . 5 |- (t = T -> {x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))} = {x | E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))})
21 supeq1 4575 . . . . 5 |- ({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))} = {x | E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))} -> sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))}, RR*, < ) = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))}, RR*, < ))
2220, 21syl 10 . . . 4 |- (t = T -> sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))}, RR*, < ) = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))}, RR*, < ))
23 eqid 1475 . . . 4 |- {<.t, y>. | (t:X-->Y /\ y = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))}, RR*, < ))} = {<.t, y>. | (t:X-->Y /\ y = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))}, RR*, < ))}
2410, 12, 14, 22, 23fvopabf4 4340 . . 3 |- (T:X-->Y -> ({<.t, y>. | (t:X-->Y /\ y = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))}, RR*, < ))}` T) = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))}, RR*, < ))
25243ad2ant3 802 . 2 |- ((U e. NrmCVec /\ W e. NrmCVec /\ T:X-->Y) -> ({<.t, y>. | (t:X-->Y /\ y = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (t` z)))}, RR*, < ))}` T) = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))}, RR*, < ))
268, 25eqtrd 1507 1 |- ((U e. NrmCVec /\ W e. NrmCVec /\ T:X-->Y) -> (N` T) = sup({x | E.z e. X ((L` z) <_ 1 /\ x = (M` (T` z)))}, RR*, < ))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   /\ w3a 775   = wceq 956   e. wcel 958  {cab 1463  E.wrex 1646  Vcvv 1811   class class class wbr 2619  {copab 2666  -->wf 3178  ` cfv 3182  (class class class)co 3963  supcsup 4573  1c1 5235   <_ cle 5295  RR*cxr 5485   < clt 5486  NrmCVeccnv 8203  Basecba 8205  normcnm 8209  normOpcnmo 8402
This theorem is referenced by:  nmoxr 8429  nmoge0 8430  nmorepnf 8431  nmolb 8434  nmoubi 8435  nmo0 8451  nmlno0lem 8453
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-9 965  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-rep 2693  ax-sep 2703  ax-nul 2710  ax-pow 2742  ax-pr 2779  ax-un 2866  ax-inf2 4625
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-nel 1588  df-ral 1649  df-rex 1650  df-reu 1651  df-rab 1652  df-v 1812  df-sbc 1942  df-csb 2002  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-pss 2055  df-nul 2281  df-if 2362  df-pw 2402  df-sn 2412  df-pr 2413  df-tp 2415  df-op 2416  df-uni 2504  df-int 2534  df-iun 2568  df-br 2620  df-opab 2667  df-tr 2681  df-eprel 2832  df-id 2835  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952  df-lim 2953  df-suc 2954  df-om 3132  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fn 3193  df-f 3194  df-f1 3195  df-fo 3196  df-f1o 3197  df-fv 3198  df-rdg 3932  df-opr 3965  df-oprab 3966  df-1st 4079  df-2nd 4080  df-1o 4133  df-oadd 4135  df-omul 4136  df-er 4261  df-ec 4263  df-qs 4266  df-map 4324  df-en 4368  df-dom 4369  df-sdom 4370  df-sup 4574  df-ni 5000  df-pli 5001  df-mi 5002  df-lti 5003  df-plpq 5035  df-mpq 5036  df-enq 5037  df-nq 5038  df-plq 5039  df-mq 5040  df-rq 5041  df-ltq 5042  df-1q 5043  df-np 5086  df-1p 5087  df-plp 5088  df-ltp 5090  df-enr 5166  df-nr 5167  df-ltr 5170  df-0r 5171  df-c 5240  df-r 5244  df-lt 5247  df-pnf 5487  df-mnf 5488  df-xr 5489  df-ltxr 5490  df-nmo 8406
Copyright terms: Public domain