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

Theorem adjadd 30455
Description: The adjoint of the sum of two operators. Theorem 3.11(iii) of [Beran] p. 106. (Contributed by NM, 22-Feb-2006.) (New usage is discouraged.)
Assertion
Ref Expression
adjadd ((𝑆 ∈ dom adj𝑇 ∈ dom adj) → (adj‘(𝑆 +op 𝑇)) = ((adj𝑆) +op (adj𝑇)))

Proof of Theorem adjadd
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dmadjop 30250 . . 3 (𝑆 ∈ dom adj𝑆: ℋ⟶ ℋ)
2 dmadjop 30250 . . 3 (𝑇 ∈ dom adj𝑇: ℋ⟶ ℋ)
3 hoaddcl 30120 . . 3 ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) → (𝑆 +op 𝑇): ℋ⟶ ℋ)
41, 2, 3syl2an 596 . 2 ((𝑆 ∈ dom adj𝑇 ∈ dom adj) → (𝑆 +op 𝑇): ℋ⟶ ℋ)
5 dmadjrn 30257 . . . 4 (𝑆 ∈ dom adj → (adj𝑆) ∈ dom adj)
6 dmadjop 30250 . . . 4 ((adj𝑆) ∈ dom adj → (adj𝑆): ℋ⟶ ℋ)
75, 6syl 17 . . 3 (𝑆 ∈ dom adj → (adj𝑆): ℋ⟶ ℋ)
8 dmadjrn 30257 . . . 4 (𝑇 ∈ dom adj → (adj𝑇) ∈ dom adj)
9 dmadjop 30250 . . . 4 ((adj𝑇) ∈ dom adj → (adj𝑇): ℋ⟶ ℋ)
108, 9syl 17 . . 3 (𝑇 ∈ dom adj → (adj𝑇): ℋ⟶ ℋ)
11 hoaddcl 30120 . . 3 (((adj𝑆): ℋ⟶ ℋ ∧ (adj𝑇): ℋ⟶ ℋ) → ((adj𝑆) +op (adj𝑇)): ℋ⟶ ℋ)
127, 10, 11syl2an 596 . 2 ((𝑆 ∈ dom adj𝑇 ∈ dom adj) → ((adj𝑆) +op (adj𝑇)): ℋ⟶ ℋ)
13 adj2 30296 . . . . . . . 8 ((𝑆 ∈ dom adj𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → ((𝑆𝑥) ·ih 𝑦) = (𝑥 ·ih ((adj𝑆)‘𝑦)))
14133expb 1119 . . . . . . 7 ((𝑆 ∈ dom adj ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑆𝑥) ·ih 𝑦) = (𝑥 ·ih ((adj𝑆)‘𝑦)))
1514adantlr 712 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑆𝑥) ·ih 𝑦) = (𝑥 ·ih ((adj𝑆)‘𝑦)))
16 adj2 30296 . . . . . . . 8 ((𝑇 ∈ dom adj𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → ((𝑇𝑥) ·ih 𝑦) = (𝑥 ·ih ((adj𝑇)‘𝑦)))
17163expb 1119 . . . . . . 7 ((𝑇 ∈ dom adj ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑇𝑥) ·ih 𝑦) = (𝑥 ·ih ((adj𝑇)‘𝑦)))
1817adantll 711 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑇𝑥) ·ih 𝑦) = (𝑥 ·ih ((adj𝑇)‘𝑦)))
1915, 18oveq12d 7293 . . . . 5 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (((𝑆𝑥) ·ih 𝑦) + ((𝑇𝑥) ·ih 𝑦)) = ((𝑥 ·ih ((adj𝑆)‘𝑦)) + (𝑥 ·ih ((adj𝑇)‘𝑦))))
201ffvelrnda 6961 . . . . . . 7 ((𝑆 ∈ dom adj𝑥 ∈ ℋ) → (𝑆𝑥) ∈ ℋ)
2120ad2ant2r 744 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑆𝑥) ∈ ℋ)
222ffvelrnda 6961 . . . . . . 7 ((𝑇 ∈ dom adj𝑥 ∈ ℋ) → (𝑇𝑥) ∈ ℋ)
2322ad2ant2lr 745 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑇𝑥) ∈ ℋ)
24 simprr 770 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → 𝑦 ∈ ℋ)
25 ax-his2 29445 . . . . . 6 (((𝑆𝑥) ∈ ℋ ∧ (𝑇𝑥) ∈ ℋ ∧ 𝑦 ∈ ℋ) → (((𝑆𝑥) + (𝑇𝑥)) ·ih 𝑦) = (((𝑆𝑥) ·ih 𝑦) + ((𝑇𝑥) ·ih 𝑦)))
2621, 23, 24, 25syl3anc 1370 . . . . 5 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (((𝑆𝑥) + (𝑇𝑥)) ·ih 𝑦) = (((𝑆𝑥) ·ih 𝑦) + ((𝑇𝑥) ·ih 𝑦)))
27 simprl 768 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → 𝑥 ∈ ℋ)
28 adjcl 30294 . . . . . . 7 ((𝑆 ∈ dom adj𝑦 ∈ ℋ) → ((adj𝑆)‘𝑦) ∈ ℋ)
2928ad2ant2rl 746 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((adj𝑆)‘𝑦) ∈ ℋ)
30 adjcl 30294 . . . . . . 7 ((𝑇 ∈ dom adj𝑦 ∈ ℋ) → ((adj𝑇)‘𝑦) ∈ ℋ)
3130ad2ant2l 743 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((adj𝑇)‘𝑦) ∈ ℋ)
32 his7 29452 . . . . . 6 ((𝑥 ∈ ℋ ∧ ((adj𝑆)‘𝑦) ∈ ℋ ∧ ((adj𝑇)‘𝑦) ∈ ℋ) → (𝑥 ·ih (((adj𝑆)‘𝑦) + ((adj𝑇)‘𝑦))) = ((𝑥 ·ih ((adj𝑆)‘𝑦)) + (𝑥 ·ih ((adj𝑇)‘𝑦))))
3327, 29, 31, 32syl3anc 1370 . . . . 5 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·ih (((adj𝑆)‘𝑦) + ((adj𝑇)‘𝑦))) = ((𝑥 ·ih ((adj𝑆)‘𝑦)) + (𝑥 ·ih ((adj𝑇)‘𝑦))))
3419, 26, 333eqtr4rd 2789 . . . 4 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·ih (((adj𝑆)‘𝑦) + ((adj𝑇)‘𝑦))) = (((𝑆𝑥) + (𝑇𝑥)) ·ih 𝑦))
357, 10anim12i 613 . . . . . . 7 ((𝑆 ∈ dom adj𝑇 ∈ dom adj) → ((adj𝑆): ℋ⟶ ℋ ∧ (adj𝑇): ℋ⟶ ℋ))
36 hosval 30102 . . . . . . . 8 (((adj𝑆): ℋ⟶ ℋ ∧ (adj𝑇): ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → (((adj𝑆) +op (adj𝑇))‘𝑦) = (((adj𝑆)‘𝑦) + ((adj𝑇)‘𝑦)))
37363expa 1117 . . . . . . 7 ((((adj𝑆): ℋ⟶ ℋ ∧ (adj𝑇): ℋ⟶ ℋ) ∧ 𝑦 ∈ ℋ) → (((adj𝑆) +op (adj𝑇))‘𝑦) = (((adj𝑆)‘𝑦) + ((adj𝑇)‘𝑦)))
3835, 37sylan 580 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ 𝑦 ∈ ℋ) → (((adj𝑆) +op (adj𝑇))‘𝑦) = (((adj𝑆)‘𝑦) + ((adj𝑇)‘𝑦)))
3938adantrl 713 . . . . 5 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (((adj𝑆) +op (adj𝑇))‘𝑦) = (((adj𝑆)‘𝑦) + ((adj𝑇)‘𝑦)))
4039oveq2d 7291 . . . 4 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·ih (((adj𝑆) +op (adj𝑇))‘𝑦)) = (𝑥 ·ih (((adj𝑆)‘𝑦) + ((adj𝑇)‘𝑦))))
411, 2anim12i 613 . . . . . . 7 ((𝑆 ∈ dom adj𝑇 ∈ dom adj) → (𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ))
42 hosval 30102 . . . . . . . 8 ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝑆 +op 𝑇)‘𝑥) = ((𝑆𝑥) + (𝑇𝑥)))
43423expa 1117 . . . . . . 7 (((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑆 +op 𝑇)‘𝑥) = ((𝑆𝑥) + (𝑇𝑥)))
4441, 43sylan 580 . . . . . 6 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ 𝑥 ∈ ℋ) → ((𝑆 +op 𝑇)‘𝑥) = ((𝑆𝑥) + (𝑇𝑥)))
4544adantrr 714 . . . . 5 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑆 +op 𝑇)‘𝑥) = ((𝑆𝑥) + (𝑇𝑥)))
4645oveq1d 7290 . . . 4 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (((𝑆 +op 𝑇)‘𝑥) ·ih 𝑦) = (((𝑆𝑥) + (𝑇𝑥)) ·ih 𝑦))
4734, 40, 463eqtr4rd 2789 . . 3 (((𝑆 ∈ dom adj𝑇 ∈ dom adj) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → (((𝑆 +op 𝑇)‘𝑥) ·ih 𝑦) = (𝑥 ·ih (((adj𝑆) +op (adj𝑇))‘𝑦)))
4847ralrimivva 3123 . 2 ((𝑆 ∈ dom adj𝑇 ∈ dom adj) → ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (((𝑆 +op 𝑇)‘𝑥) ·ih 𝑦) = (𝑥 ·ih (((adj𝑆) +op (adj𝑇))‘𝑦)))
49 adjeq 30297 . 2 (((𝑆 +op 𝑇): ℋ⟶ ℋ ∧ ((adj𝑆) +op (adj𝑇)): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (((𝑆 +op 𝑇)‘𝑥) ·ih 𝑦) = (𝑥 ·ih (((adj𝑆) +op (adj𝑇))‘𝑦))) → (adj‘(𝑆 +op 𝑇)) = ((adj𝑆) +op (adj𝑇)))
504, 12, 48, 49syl3anc 1370 1 ((𝑆 ∈ dom adj𝑇 ∈ dom adj) → (adj‘(𝑆 +op 𝑇)) = ((adj𝑆) +op (adj𝑇)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1539  wcel 2106  wral 3064  dom cdm 5589  wf 6429  cfv 6433  (class class class)co 7275   + caddc 10874  chba 29281   + cva 29282   ·ih csp 29284   +op chos 29300  adjcado 29317
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-hilex 29361  ax-hfvadd 29362  ax-hvcom 29363  ax-hvass 29364  ax-hv0cl 29365  ax-hvaddid 29366  ax-hfvmul 29367  ax-hvmulid 29368  ax-hvdistr2 29371  ax-hvmul0 29372  ax-hfi 29441  ax-his1 29444  ax-his2 29445  ax-his3 29446  ax-his4 29447
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-po 5503  df-so 5504  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-sdom 8736  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-2 12036  df-cj 14810  df-re 14811  df-im 14812  df-hvsub 29333  df-hosum 30092  df-adjh 30211
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator