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

Theorem braadd 30208
Description: Linearity property of bra for addition. (Contributed by NM, 23-May-2006.) (New usage is discouraged.)
Assertion
Ref Expression
braadd ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘(𝐵 + 𝐶)) = (((bra‘𝐴)‘𝐵) + ((bra‘𝐴)‘𝐶)))

Proof of Theorem braadd
StepHypRef Expression
1 ax-his2 29346 . . 3 ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → ((𝐵 + 𝐶) ·ih 𝐴) = ((𝐵 ·ih 𝐴) + (𝐶 ·ih 𝐴)))
213comr 1123 . 2 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 + 𝐶) ·ih 𝐴) = ((𝐵 ·ih 𝐴) + (𝐶 ·ih 𝐴)))
3 hvaddcl 29275 . . . 4 ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 + 𝐶) ∈ ℋ)
4 braval 30207 . . . 4 ((𝐴 ∈ ℋ ∧ (𝐵 + 𝐶) ∈ ℋ) → ((bra‘𝐴)‘(𝐵 + 𝐶)) = ((𝐵 + 𝐶) ·ih 𝐴))
53, 4sylan2 592 . . 3 ((𝐴 ∈ ℋ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → ((bra‘𝐴)‘(𝐵 + 𝐶)) = ((𝐵 + 𝐶) ·ih 𝐴))
653impb 1113 . 2 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘(𝐵 + 𝐶)) = ((𝐵 + 𝐶) ·ih 𝐴))
7 braval 30207 . . . 4 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((bra‘𝐴)‘𝐵) = (𝐵 ·ih 𝐴))
873adant3 1130 . . 3 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘𝐵) = (𝐵 ·ih 𝐴))
9 braval 30207 . . . 4 ((𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘𝐶) = (𝐶 ·ih 𝐴))
1093adant2 1129 . . 3 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘𝐶) = (𝐶 ·ih 𝐴))
118, 10oveq12d 7273 . 2 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (((bra‘𝐴)‘𝐵) + ((bra‘𝐴)‘𝐶)) = ((𝐵 ·ih 𝐴) + (𝐶 ·ih 𝐴)))
122, 6, 113eqtr4d 2788 1 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘(𝐵 + 𝐶)) = (((bra‘𝐴)‘𝐵) + ((bra‘𝐴)‘𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1539  wcel 2108  cfv 6418  (class class class)co 7255   + caddc 10805  chba 29182   + cva 29183   ·ih csp 29185  bracbr 29219
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-hilex 29262  ax-hfvadd 29263  ax-his2 29346
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-bra 30113
This theorem is referenced by:  bralnfn  30211
  Copyright terms: Public domain W3C validator