HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  lnopmi Structured version   Visualization version   GIF version

Theorem lnopmi 32293
Description: The scalar product of a linear operator is a linear operator. (Contributed by NM, 10-Mar-2006.) (New usage is discouraged.)
Hypothesis
Ref Expression
lnopm.1 𝑇 ∈ LinOp
Assertion
Ref Expression
lnopmi (𝐴 ∈ ℂ → (𝐴 ·op 𝑇) ∈ LinOp)

Proof of Theorem lnopmi
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lnopm.1 . . . 4 𝑇 ∈ LinOp
21lnopfi 32262 . . 3 𝑇: ℋ⟶ ℋ
3 homulcl 32052 . . 3 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (𝐴 ·op 𝑇): ℋ⟶ ℋ)
42, 3mpan2 703 . 2 (𝐴 ∈ ℂ → (𝐴 ·op 𝑇): ℋ⟶ ℋ)
5 hvmulcl 31306 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 · 𝑦) ∈ ℋ)
6 hvaddcl 31305 . . . . . . . 8 (((𝑥 · 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑥 · 𝑦) + 𝑧) ∈ ℋ)
75, 6sylan 591 . . . . . . 7 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 · 𝑦) + 𝑧) ∈ ℋ)
8 homval 32034 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ ((𝑥 · 𝑦) + 𝑧) ∈ ℋ) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
92, 8mp3an2 1475 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 · 𝑦) + 𝑧) ∈ ℋ) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
107, 9sylan2 604 . . . . . 6 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
11 id 23 . . . . . . . . 9 (𝐴 ∈ ℂ → 𝐴 ∈ ℂ)
122ffvelcdmi 7079 . . . . . . . . . 10 (𝑦 ∈ ℋ → (𝑇𝑦) ∈ ℋ)
13 hvmulcl 31306 . . . . . . . . . 10 ((𝑥 ∈ ℂ ∧ (𝑇𝑦) ∈ ℋ) → (𝑥 · (𝑇𝑦)) ∈ ℋ)
1412, 13sylan2 604 . . . . . . . . 9 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 · (𝑇𝑦)) ∈ ℋ)
152ffvelcdmi 7079 . . . . . . . . 9 (𝑧 ∈ ℋ → (𝑇𝑧) ∈ ℋ)
16 ax-hvdistr1 31301 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ (𝑥 · (𝑇𝑦)) ∈ ℋ ∧ (𝑇𝑧) ∈ ℋ) → (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
1711, 14, 15, 16syl3an 1176 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
18173expb 1136 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
191lnopli 32261 . . . . . . . . . 10 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)))
20193expa 1134 . . . . . . . . 9 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)))
2120oveq2d 7427 . . . . . . . 8 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))) = (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))))
2221adantl 486 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))) = (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))))
23 homval 32034 . . . . . . . . . . . . 13 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑦) = (𝐴 · (𝑇𝑦)))
242, 23mp3an2 1475 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑦) = (𝐴 · (𝑇𝑦)))
2524adantrl 728 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → ((𝐴 ·op 𝑇)‘𝑦) = (𝐴 · (𝑇𝑦)))
2625oveq2d 7427 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) = (𝑥 · (𝐴 · (𝑇𝑦))))
27 hvmulcom 31336 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (𝑇𝑦) ∈ ℋ) → (𝐴 · (𝑥 · (𝑇𝑦))) = (𝑥 · (𝐴 · (𝑇𝑦))))
2812, 27syl3an3 1181 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝐴 · (𝑥 · (𝑇𝑦))) = (𝑥 · (𝐴 · (𝑇𝑦))))
29283expb 1136 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝐴 · (𝑥 · (𝑇𝑦))) = (𝑥 · (𝐴 · (𝑇𝑦))))
3026, 29eqtr4d 2807 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) = (𝐴 · (𝑥 · (𝑇𝑦))))
31 homval 32034 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑧 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑧) = (𝐴 · (𝑇𝑧)))
322, 31mp3an2 1475 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑧) = (𝐴 · (𝑇𝑧)))
3330, 32oveqan12d 7430 . . . . . . . 8 (((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ (𝐴 ∈ ℂ ∧ 𝑧 ∈ ℋ)) → ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
3433anandis 690 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
3518, 22, 343eqtr4rd 2815 . . . . . 6 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
3610, 35eqtr4d 2807 . . . . 5 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)))
3736exp32 425 . . . 4 (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑧 ∈ ℋ → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)))))
3837ralrimdv 3169 . . 3 (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ∀𝑧 ∈ ℋ ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧))))
3938ralrimivv 3212 . 2 (𝐴 ∈ ℂ → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)))
40 ellnop 32151 . 2 ((𝐴 ·op 𝑇) ∈ LinOp ↔ ((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧))))
414, 39, 40sylanbrc 594 1 (𝐴 ∈ ℂ → (𝐴 ·op 𝑇) ∈ LinOp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1567  wcel 2149  wral 3085  wf 6533  cfv 6537  (class class class)co 7411  cc 11098  chba 31212   + cva 31213   · csm 31214   ·op chot 31232  LinOpclo 31240
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-mulcom 11164  ax-hilex 31292  ax-hfvadd 31293  ax-hfvmul 31298  ax-hvmulass 31300  ax-hvdistr1 31301
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-map 8826  df-homul 32024  df-lnop 32134
This theorem is referenced by:  lnophdi  32295  bdophmi  32325
  Copyright terms: Public domain W3C validator