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

Theorem lnophsi 32660
Description: The sum of two linear operators is linear. (Contributed by NM, 10-Mar-2006.) (New usage is discouraged.)
Hypotheses
Ref Expression
lnopco.1 𝑆 ∈ LinOp
lnopco.2 𝑇 ∈ LinOp
Assertion
Ref Expression
lnophsi (𝑆 +op 𝑇) ∈ LinOp

Proof of Theorem lnophsi
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lnopco.1 . . . 4 𝑆 ∈ LinOp
21lnopfi 32628 . . 3 𝑆: ℋ⟶ ℋ
3 lnopco.2 . . . 4 𝑇 ∈ LinOp
43lnopfi 32628 . . 3 𝑇: ℋ⟶ ℋ
52, 4hoaddcli 32427 . 2 (𝑆 +op 𝑇): ℋ⟶ ℋ
6 hvmulcl 31672 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ 𝑦) ∈ ℋ)
71lnopaddi 32630 . . . . . . . 8 (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)))
83lnopaddi 32630 . . . . . . . 8 (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧)))
97, 8oveq12d 7469 . . . . . . 7 (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))))
106, 9sylan 592 . . . . . 6 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))))
112ffvelcdmi 7115 . . . . . . . . 9 ((𝑥 ·ℎ 𝑦) ∈ ℋ → (𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
126, 11syl 18 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
132ffvelcdmi 7115 . . . . . . . 8 (𝑧 ∈ ℋ → (𝑆‘𝑧) ∈ ℋ)
1412, 13anim12i 625 . . . . . . 7 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑆‘𝑧) ∈ ℋ))
154ffvelcdmi 7115 . . . . . . . . 9 ((𝑥 ·ℎ 𝑦) ∈ ℋ → (𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
166, 15syl 18 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
174ffvelcdmi 7115 . . . . . . . 8 (𝑧 ∈ ℋ → (𝑇‘𝑧) ∈ ℋ)
1816, 17anim12i 625 . . . . . . 7 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑇‘𝑧) ∈ ℋ))
19 hvadd4 31695 . . . . . . 7 ((((𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑆‘𝑧) ∈ ℋ) ∧ ((𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑇‘𝑧) ∈ ℋ)) → (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
2014, 18, 19syl2anc 596 . . . . . 6 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
2110, 20eqtrd 2798 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
22 hvaddcl 31671 . . . . . . 7 (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
236, 22sylan 592 . . . . . 6 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
24 hosval 32399 . . . . . . 7 ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ) → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
252, 4, 24mp3an12 1481 . . . . . 6 (((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
2623, 25syl 18 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
272ffvelcdmi 7115 . . . . . . . . 9 (𝑦 ∈ ℋ → (𝑆‘𝑦) ∈ ℋ)
284ffvelcdmi 7115 . . . . . . . . 9 (𝑦 ∈ ℋ → (𝑇‘𝑦) ∈ ℋ)
2927, 28jca 521 . . . . . . . 8 (𝑦 ∈ ℋ → ((𝑆‘𝑦) ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ))
30 ax-hvdistr1 31667 . . . . . . . . 9 ((𝑥 ∈ ℂ ∧ (𝑆‘𝑦) ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ) → (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
31303expb 1138 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ ((𝑆‘𝑦) ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ)) → (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
3229, 31sylan2 605 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
33 hosval 32399 . . . . . . . . . 10 ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → ((𝑆 +op 𝑇)‘𝑦) = ((𝑆‘𝑦) +ℎ (𝑇‘𝑦)))
342, 4, 33mp3an12 1481 . . . . . . . . 9 (𝑦 ∈ ℋ → ((𝑆 +op 𝑇)‘𝑦) = ((𝑆‘𝑦) +ℎ (𝑇‘𝑦)))
3534oveq2d 7467 . . . . . . . 8 (𝑦 ∈ ℋ → (𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) = (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))))
3635adantl 487 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) = (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))))
371lnopmuli 32631 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑆‘(𝑥 ·ℎ 𝑦)) = (𝑥 ·ℎ (𝑆‘𝑦)))
383lnopmuli 32631 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 ·ℎ 𝑦)) = (𝑥 ·ℎ (𝑇‘𝑦)))
3937, 38oveq12d 7469 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
4032, 36, 393eqtr4d 2808 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) = ((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))))
41 hosval 32399 . . . . . . 7 ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑆 +op 𝑇)‘𝑧) = ((𝑆‘𝑧) +ℎ (𝑇‘𝑧)))
422, 4, 41mp3an12 1481 . . . . . 6 (𝑧 ∈ ℋ → ((𝑆 +op 𝑇)‘𝑧) = ((𝑆‘𝑧) +ℎ (𝑇‘𝑧)))
4340, 42oveqan12d 7470 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧)) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
4421, 26, 433eqtr4d 2808 . . . 4 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧)))
4544ralrimiva 3158 . . 3 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ∀𝑧 ∈ ℋ ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧)))
4645rgen2 3206 . 2 ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧))
47 ellnop 32517 . 2 ((𝑆 +op 𝑇) ∈ LinOp ↔ ((𝑆 +op 𝑇): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧))))
485, 46, 47mpbir2an 724 1 (𝑆 +op 𝑇) ∈ LinOp
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  ℂcc 11237   ℋchba 31578   +ℎ cva 31579   ·ℎ csm 31580   +op chos 31597  LinOpclo 31606
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-hilex 31658  ax-hfvadd 31659  ax-hvcom 31660  ax-hvass 31661  ax-hv0cl 31662  ax-hvaddid 31663  ax-hfvmul 31664  ax-hvmulid 31665  ax-hvdistr1 31667  ax-hvdistr2 31668  ax-hvmul0 31669
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-po 5566  df-so 5567  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-ltxr 11387  df-sub 11582  df-neg 11583  df-hvsub 31630  df-hosum 32389  df-lnop 32500
This theorem is used by:  lnophdi  32661  bdophsi  32755
  Copyright terms: Public domain W3C validator