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

Theorem lnoval 30580
Description: The set of linear operators between two normed complex vector spaces. (Contributed by NM, 6-Nov-2007.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
lnoval.1 𝑋 = (BaseSet‘𝑈)
lnoval.2 𝑌 = (BaseSet‘𝑊)
lnoval.3 𝐺 = ( +𝑣𝑈)
lnoval.4 𝐻 = ( +𝑣𝑊)
lnoval.5 𝑅 = ( ·𝑠OLD𝑈)
lnoval.6 𝑆 = ( ·𝑠OLD𝑊)
lnoval.7 𝐿 = (𝑈 LnOp 𝑊)
Assertion
Ref Expression
lnoval ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐿 = {𝑡 ∈ (𝑌m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡𝑦))𝐻(𝑡𝑧))})
Distinct variable groups:   𝑥,𝑡,𝑦,𝑧,𝑈   𝑡,𝑊,𝑥,𝑦,𝑧   𝑡,𝑋,𝑦,𝑧   𝑡,𝑌   𝑡,𝐺   𝑡,𝑅   𝑡,𝐻   𝑡,𝑆
Allowed substitution hints:   𝑅(𝑥,𝑦,𝑧)   𝑆(𝑥,𝑦,𝑧)   𝐺(𝑥,𝑦,𝑧)   𝐻(𝑥,𝑦,𝑧)   𝐿(𝑥,𝑦,𝑧,𝑡)   𝑋(𝑥)   𝑌(𝑥,𝑦,𝑧)

Proof of Theorem lnoval
Dummy variables 𝑢 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lnoval.7 . 2 𝐿 = (𝑈 LnOp 𝑊)
2 fveq2 6900 . . . . . 6 (𝑢 = 𝑈 → (BaseSet‘𝑢) = (BaseSet‘𝑈))
3 lnoval.1 . . . . . 6 𝑋 = (BaseSet‘𝑈)
42, 3eqtr4di 2785 . . . . 5 (𝑢 = 𝑈 → (BaseSet‘𝑢) = 𝑋)
54oveq2d 7440 . . . 4 (𝑢 = 𝑈 → ((BaseSet‘𝑤) ↑m (BaseSet‘𝑢)) = ((BaseSet‘𝑤) ↑m 𝑋))
6 fveq2 6900 . . . . . . . . . 10 (𝑢 = 𝑈 → ( +𝑣𝑢) = ( +𝑣𝑈))
7 lnoval.3 . . . . . . . . . 10 𝐺 = ( +𝑣𝑈)
86, 7eqtr4di 2785 . . . . . . . . 9 (𝑢 = 𝑈 → ( +𝑣𝑢) = 𝐺)
9 fveq2 6900 . . . . . . . . . . 11 (𝑢 = 𝑈 → ( ·𝑠OLD𝑢) = ( ·𝑠OLD𝑈))
10 lnoval.5 . . . . . . . . . . 11 𝑅 = ( ·𝑠OLD𝑈)
119, 10eqtr4di 2785 . . . . . . . . . 10 (𝑢 = 𝑈 → ( ·𝑠OLD𝑢) = 𝑅)
1211oveqd 7441 . . . . . . . . 9 (𝑢 = 𝑈 → (𝑥( ·𝑠OLD𝑢)𝑦) = (𝑥𝑅𝑦))
13 eqidd 2728 . . . . . . . . 9 (𝑢 = 𝑈𝑧 = 𝑧)
148, 12, 13oveq123d 7445 . . . . . . . 8 (𝑢 = 𝑈 → ((𝑥( ·𝑠OLD𝑢)𝑦)( +𝑣𝑢)𝑧) = ((𝑥𝑅𝑦)𝐺𝑧))
1514fveqeq2d 6908 . . . . . . 7 (𝑢 = 𝑈 → ((𝑡‘((𝑥( ·𝑠OLD𝑢)𝑦)( +𝑣𝑢)𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧)) ↔ (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧))))
164, 15raleqbidv 3338 . . . . . 6 (𝑢 = 𝑈 → (∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD𝑢)𝑦)( +𝑣𝑢)𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧)) ↔ ∀𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧))))
174, 16raleqbidv 3338 . . . . 5 (𝑢 = 𝑈 → (∀𝑦 ∈ (BaseSet‘𝑢)∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD𝑢)𝑦)( +𝑣𝑢)𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧)) ↔ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧))))
1817ralbidv 3173 . . . 4 (𝑢 = 𝑈 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑢)∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD𝑢)𝑦)( +𝑣𝑢)𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧))))
195, 18rabeqbidv 3446 . . 3 (𝑢 = 𝑈 → {𝑡 ∈ ((BaseSet‘𝑤) ↑m (BaseSet‘𝑢)) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑢)∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD𝑢)𝑦)( +𝑣𝑢)𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧))} = {𝑡 ∈ ((BaseSet‘𝑤) ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧))})
20 fveq2 6900 . . . . . 6 (𝑤 = 𝑊 → (BaseSet‘𝑤) = (BaseSet‘𝑊))
21 lnoval.2 . . . . . 6 𝑌 = (BaseSet‘𝑊)
2220, 21eqtr4di 2785 . . . . 5 (𝑤 = 𝑊 → (BaseSet‘𝑤) = 𝑌)
2322oveq1d 7439 . . . 4 (𝑤 = 𝑊 → ((BaseSet‘𝑤) ↑m 𝑋) = (𝑌m 𝑋))
24 fveq2 6900 . . . . . . . . 9 (𝑤 = 𝑊 → ( +𝑣𝑤) = ( +𝑣𝑊))
25 lnoval.4 . . . . . . . . 9 𝐻 = ( +𝑣𝑊)
2624, 25eqtr4di 2785 . . . . . . . 8 (𝑤 = 𝑊 → ( +𝑣𝑤) = 𝐻)
27 fveq2 6900 . . . . . . . . . 10 (𝑤 = 𝑊 → ( ·𝑠OLD𝑤) = ( ·𝑠OLD𝑊))
28 lnoval.6 . . . . . . . . . 10 𝑆 = ( ·𝑠OLD𝑊)
2927, 28eqtr4di 2785 . . . . . . . . 9 (𝑤 = 𝑊 → ( ·𝑠OLD𝑤) = 𝑆)
3029oveqd 7441 . . . . . . . 8 (𝑤 = 𝑊 → (𝑥( ·𝑠OLD𝑤)(𝑡𝑦)) = (𝑥𝑆(𝑡𝑦)))
31 eqidd 2728 . . . . . . . 8 (𝑤 = 𝑊 → (𝑡𝑧) = (𝑡𝑧))
3226, 30, 31oveq123d 7445 . . . . . . 7 (𝑤 = 𝑊 → ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧)) = ((𝑥𝑆(𝑡𝑦))𝐻(𝑡𝑧)))
3332eqeq2d 2738 . . . . . 6 (𝑤 = 𝑊 → ((𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧)) ↔ (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡𝑦))𝐻(𝑡𝑧))))
34332ralbidv 3214 . . . . 5 (𝑤 = 𝑊 → (∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧)) ↔ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡𝑦))𝐻(𝑡𝑧))))
3534ralbidv 3173 . . . 4 (𝑤 = 𝑊 → (∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡𝑦))𝐻(𝑡𝑧))))
3623, 35rabeqbidv 3446 . . 3 (𝑤 = 𝑊 → {𝑡 ∈ ((BaseSet‘𝑤) ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧))} = {𝑡 ∈ (𝑌m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡𝑦))𝐻(𝑡𝑧))})
37 df-lno 30572 . . 3 LnOp = (𝑢 ∈ NrmCVec, 𝑤 ∈ NrmCVec ↦ {𝑡 ∈ ((BaseSet‘𝑤) ↑m (BaseSet‘𝑢)) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑢)∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD𝑢)𝑦)( +𝑣𝑢)𝑧)) = ((𝑥( ·𝑠OLD𝑤)(𝑡𝑦))( +𝑣𝑤)(𝑡𝑧))})
38 ovex 7457 . . . 4 (𝑌m 𝑋) ∈ V
3938rabex 5336 . . 3 {𝑡 ∈ (𝑌m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡𝑦))𝐻(𝑡𝑧))} ∈ V
4019, 36, 37, 39ovmpo 7585 . 2 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑈 LnOp 𝑊) = {𝑡 ∈ (𝑌m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡𝑦))𝐻(𝑡𝑧))})
411, 40eqtrid 2779 1 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐿 = {𝑡 ∈ (𝑌m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡𝑦))𝐻(𝑡𝑧))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394   = wceq 1533  wcel 2098  wral 3057  {crab 3428  cfv 6551  (class class class)co 7424  m cmap 8849  cc 11142  NrmCVeccnv 30412   +𝑣 cpv 30413  BaseSetcba 30414   ·𝑠OLD cns 30415   LnOp clno 30568
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2698  ax-sep 5301  ax-nul 5308  ax-pr 5431
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2937  df-ral 3058  df-rex 3067  df-rab 3429  df-v 3473  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4325  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4911  df-br 5151  df-opab 5213  df-id 5578  df-xp 5686  df-rel 5687  df-cnv 5688  df-co 5689  df-dm 5690  df-iota 6503  df-fun 6553  df-fv 6559  df-ov 7427  df-oprab 7428  df-mpo 7429  df-lno 30572
This theorem is referenced by:  islno  30581  hhlnoi  31728
  Copyright terms: Public domain W3C validator