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

Theorem lnopmi 31944
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 31913 . . 3 𝑇: ℋ⟶ ℋ
3 homulcl 31703 . . 3 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (𝐴 ·op 𝑇): ℋ⟶ ℋ)
42, 3mpan2 691 . 2 (𝐴 ∈ ℂ → (𝐴 ·op 𝑇): ℋ⟶ ℋ)
5 hvmulcl 30957 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 · 𝑦) ∈ ℋ)
6 hvaddcl 30956 . . . . . . . 8 (((𝑥 · 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑥 · 𝑦) + 𝑧) ∈ ℋ)
75, 6sylan 580 . . . . . . 7 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 · 𝑦) + 𝑧) ∈ ℋ)
8 homval 31685 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ ((𝑥 · 𝑦) + 𝑧) ∈ ℋ) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
92, 8mp3an2 1451 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 · 𝑦) + 𝑧) ∈ ℋ) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
107, 9sylan2 593 . . . . . 6 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
11 id 22 . . . . . . . . 9 (𝐴 ∈ ℂ → 𝐴 ∈ ℂ)
122ffvelcdmi 7017 . . . . . . . . . 10 (𝑦 ∈ ℋ → (𝑇𝑦) ∈ ℋ)
13 hvmulcl 30957 . . . . . . . . . 10 ((𝑥 ∈ ℂ ∧ (𝑇𝑦) ∈ ℋ) → (𝑥 · (𝑇𝑦)) ∈ ℋ)
1412, 13sylan2 593 . . . . . . . . 9 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 · (𝑇𝑦)) ∈ ℋ)
152ffvelcdmi 7017 . . . . . . . . 9 (𝑧 ∈ ℋ → (𝑇𝑧) ∈ ℋ)
16 ax-hvdistr1 30952 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ (𝑥 · (𝑇𝑦)) ∈ ℋ ∧ (𝑇𝑧) ∈ ℋ) → (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
1711, 14, 15, 16syl3an 1160 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
18173expb 1120 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
191lnopli 31912 . . . . . . . . . 10 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)))
20193expa 1118 . . . . . . . . 9 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)))
2120oveq2d 7365 . . . . . . . 8 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))) = (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))))
2221adantl 481 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))) = (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))))
23 homval 31685 . . . . . . . . . . . . 13 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑦) = (𝐴 · (𝑇𝑦)))
242, 23mp3an2 1451 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑦) = (𝐴 · (𝑇𝑦)))
2524adantrl 716 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → ((𝐴 ·op 𝑇)‘𝑦) = (𝐴 · (𝑇𝑦)))
2625oveq2d 7365 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) = (𝑥 · (𝐴 · (𝑇𝑦))))
27 hvmulcom 30987 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (𝑇𝑦) ∈ ℋ) → (𝐴 · (𝑥 · (𝑇𝑦))) = (𝑥 · (𝐴 · (𝑇𝑦))))
2812, 27syl3an3 1165 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝐴 · (𝑥 · (𝑇𝑦))) = (𝑥 · (𝐴 · (𝑇𝑦))))
29283expb 1120 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝐴 · (𝑥 · (𝑇𝑦))) = (𝑥 · (𝐴 · (𝑇𝑦))))
3026, 29eqtr4d 2767 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) = (𝐴 · (𝑥 · (𝑇𝑦))))
31 homval 31685 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑧 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑧) = (𝐴 · (𝑇𝑧)))
322, 31mp3an2 1451 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑧) = (𝐴 · (𝑇𝑧)))
3330, 32oveqan12d 7368 . . . . . . . 8 (((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ (𝐴 ∈ ℂ ∧ 𝑧 ∈ ℋ)) → ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
3433anandis 678 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
3518, 22, 343eqtr4rd 2775 . . . . . 6 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
3610, 35eqtr4d 2767 . . . . 5 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)))
3736exp32 420 . . . 4 (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑧 ∈ ℋ → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)))))
3837ralrimdv 3127 . . 3 (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ∀𝑧 ∈ ℋ ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧))))
3938ralrimivv 3170 . 2 (𝐴 ∈ ℂ → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)))
40 ellnop 31802 . 2 ((𝐴 ·op 𝑇) ∈ LinOp ↔ ((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧))))
414, 39, 40sylanbrc 583 1 (𝐴 ∈ ℂ → (𝐴 ·op 𝑇) ∈ LinOp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  wral 3044  wf 6478  cfv 6482  (class class class)co 7349  cc 11007  chba 30863   + cva 30864   · csm 30865   ·op chot 30883  LinOpclo 30891
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-mulcom 11073  ax-hilex 30943  ax-hfvadd 30944  ax-hfvmul 30949  ax-hvmulass 30951  ax-hvdistr1 30952
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-ov 7352  df-oprab 7353  df-mpo 7354  df-map 8755  df-homul 31675  df-lnop 31785
This theorem is referenced by:  lnophdi  31946  bdophmi  31976
  Copyright terms: Public domain W3C validator