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

Theorem lnopmi 32089
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 32058 . . 3 𝑇: ℋ⟶ ℋ
3 homulcl 31848 . . 3 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (𝐴 ·op 𝑇): ℋ⟶ ℋ)
42, 3mpan2 692 . 2 (𝐴 ∈ ℂ → (𝐴 ·op 𝑇): ℋ⟶ ℋ)
5 hvmulcl 31102 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 · 𝑦) ∈ ℋ)
6 hvaddcl 31101 . . . . . . . 8 (((𝑥 · 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑥 · 𝑦) + 𝑧) ∈ ℋ)
75, 6sylan 581 . . . . . . 7 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 · 𝑦) + 𝑧) ∈ ℋ)
8 homval 31830 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ ((𝑥 · 𝑦) + 𝑧) ∈ ℋ) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
92, 8mp3an2 1452 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 · 𝑦) + 𝑧) ∈ ℋ) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
107, 9sylan2 594 . . . . . 6 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
11 id 22 . . . . . . . . 9 (𝐴 ∈ ℂ → 𝐴 ∈ ℂ)
122ffvelcdmi 7030 . . . . . . . . . 10 (𝑦 ∈ ℋ → (𝑇𝑦) ∈ ℋ)
13 hvmulcl 31102 . . . . . . . . . 10 ((𝑥 ∈ ℂ ∧ (𝑇𝑦) ∈ ℋ) → (𝑥 · (𝑇𝑦)) ∈ ℋ)
1412, 13sylan2 594 . . . . . . . . 9 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 · (𝑇𝑦)) ∈ ℋ)
152ffvelcdmi 7030 . . . . . . . . 9 (𝑧 ∈ ℋ → (𝑇𝑧) ∈ ℋ)
16 ax-hvdistr1 31097 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ (𝑥 · (𝑇𝑦)) ∈ ℋ ∧ (𝑇𝑧) ∈ ℋ) → (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
1711, 14, 15, 16syl3an 1161 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
18173expb 1121 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
191lnopli 32057 . . . . . . . . . 10 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)))
20193expa 1119 . . . . . . . . 9 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)))
2120oveq2d 7377 . . . . . . . 8 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))) = (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))))
2221adantl 481 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))) = (𝐴 · ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))))
23 homval 31830 . . . . . . . . . . . . 13 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑦) = (𝐴 · (𝑇𝑦)))
242, 23mp3an2 1452 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑦) = (𝐴 · (𝑇𝑦)))
2524adantrl 717 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → ((𝐴 ·op 𝑇)‘𝑦) = (𝐴 · (𝑇𝑦)))
2625oveq2d 7377 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) = (𝑥 · (𝐴 · (𝑇𝑦))))
27 hvmulcom 31132 . . . . . . . . . . . 12 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (𝑇𝑦) ∈ ℋ) → (𝐴 · (𝑥 · (𝑇𝑦))) = (𝑥 · (𝐴 · (𝑇𝑦))))
2812, 27syl3an3 1166 . . . . . . . . . . 11 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝐴 · (𝑥 · (𝑇𝑦))) = (𝑥 · (𝐴 · (𝑇𝑦))))
29283expb 1121 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝐴 · (𝑥 · (𝑇𝑦))) = (𝑥 · (𝐴 · (𝑇𝑦))))
3026, 29eqtr4d 2775 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) = (𝐴 · (𝑥 · (𝑇𝑦))))
31 homval 31830 . . . . . . . . . 10 ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑧 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑧) = (𝐴 · (𝑇𝑧)))
322, 31mp3an2 1452 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑧) = (𝐴 · (𝑇𝑧)))
3330, 32oveqan12d 7380 . . . . . . . 8 (((𝐴 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ (𝐴 ∈ ℂ ∧ 𝑧 ∈ ℋ)) → ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
3433anandis 679 . . . . . . 7 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)) = ((𝐴 · (𝑥 · (𝑇𝑦))) + (𝐴 · (𝑇𝑧))))
3518, 22, 343eqtr4rd 2783 . . . . . 6 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)) = (𝐴 · (𝑇‘((𝑥 · 𝑦) + 𝑧))))
3610, 35eqtr4d 2775 . . . . 5 ((𝐴 ∈ ℂ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)))
3736exp32 420 . . . 4 (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑧 ∈ ℋ → ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)))))
3837ralrimdv 3136 . . 3 (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ∀𝑧 ∈ ℋ ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧))))
3938ralrimivv 3179 . 2 (𝐴 ∈ ℂ → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧)))
40 ellnop 31947 . 2 ((𝐴 ·op 𝑇) ∈ LinOp ↔ ((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝐴 ·op 𝑇)‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · ((𝐴 ·op 𝑇)‘𝑦)) + ((𝐴 ·op 𝑇)‘𝑧))))
414, 39, 40sylanbrc 584 1 (𝐴 ∈ ℂ → (𝐴 ·op 𝑇) ∈ LinOp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052  wf 6489  cfv 6493  (class class class)co 7361  cc 11030  chba 31008   + cva 31009   · csm 31010   ·op chot 31028  LinOpclo 31036
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-mulcom 11096  ax-hilex 31088  ax-hfvadd 31089  ax-hfvmul 31094  ax-hvmulass 31096  ax-hvdistr1 31097
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  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-ral 3053  df-rex 3063  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-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-map 8769  df-homul 31820  df-lnop 31930
This theorem is referenced by:  lnophdi  32091  bdophmi  32121
  Copyright terms: Public domain W3C validator