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

Theorem kbass2 29811
Description: Dirac bra-ket associative law (⟨𝐴𝐵⟩)⟨𝐶 ∣ = 𝐴 ∣ ( ∣ 𝐵 𝐶 ∣ ) i.e. the juxtaposition of an inner product with a bra equals a ket juxtaposed with an outer product. (Contributed by NM, 23-May-2006.) (New usage is discouraged.)
Assertion
Ref Expression
kbass2 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶)) = ((bra‘𝐴) ∘ (𝐵 ketbra 𝐶)))

Proof of Theorem kbass2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ovex 7181 . . . 4 (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥)) ∈ V
2 eqid 2826 . . . 4 (𝑥 ∈ ℋ ↦ (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥))) = (𝑥 ∈ ℋ ↦ (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥)))
31, 2fnmpti 6488 . . 3 (𝑥 ∈ ℋ ↦ (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥))) Fn ℋ
4 bracl 29643 . . . . . 6 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((bra‘𝐴)‘𝐵) ∈ ℂ)
5 brafn 29641 . . . . . 6 (𝐶 ∈ ℋ → (bra‘𝐶): ℋ⟶ℂ)
6 hfmmval 29433 . . . . . 6 ((((bra‘𝐴)‘𝐵) ∈ ℂ ∧ (bra‘𝐶): ℋ⟶ℂ) → (((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶)) = (𝑥 ∈ ℋ ↦ (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥))))
74, 5, 6syl2an 595 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ 𝐶 ∈ ℋ) → (((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶)) = (𝑥 ∈ ℋ ↦ (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥))))
873impa 1104 . . . 4 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶)) = (𝑥 ∈ ℋ ↦ (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥))))
98fneq1d 6443 . . 3 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶)) Fn ℋ ↔ (𝑥 ∈ ℋ ↦ (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥))) Fn ℋ))
103, 9mpbiri 259 . 2 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶)) Fn ℋ)
11 brafn 29641 . . . . 5 (𝐴 ∈ ℋ → (bra‘𝐴): ℋ⟶ℂ)
12 kbop 29647 . . . . 5 ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ketbra 𝐶): ℋ⟶ ℋ)
13 fco 6528 . . . . 5 (((bra‘𝐴): ℋ⟶ℂ ∧ (𝐵 ketbra 𝐶): ℋ⟶ ℋ) → ((bra‘𝐴) ∘ (𝐵 ketbra 𝐶)): ℋ⟶ℂ)
1411, 12, 13syl2an 595 . . . 4 ((𝐴 ∈ ℋ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → ((bra‘𝐴) ∘ (𝐵 ketbra 𝐶)): ℋ⟶ℂ)
15143impb 1109 . . 3 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴) ∘ (𝐵 ketbra 𝐶)): ℋ⟶ℂ)
1615ffnd 6512 . 2 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴) ∘ (𝐵 ketbra 𝐶)) Fn ℋ)
17 simpl1 1185 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → 𝐴 ∈ ℋ)
18 simpl2 1186 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → 𝐵 ∈ ℋ)
19 braval 29638 . . . . 5 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((bra‘𝐴)‘𝐵) = (𝐵 ·ih 𝐴))
2017, 18, 19syl2anc 584 . . . 4 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((bra‘𝐴)‘𝐵) = (𝐵 ·ih 𝐴))
21 simpl3 1187 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → 𝐶 ∈ ℋ)
22 simpr 485 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → 𝑥 ∈ ℋ)
23 braval 29638 . . . . 5 ((𝐶 ∈ ℋ ∧ 𝑥 ∈ ℋ) → ((bra‘𝐶)‘𝑥) = (𝑥 ·ih 𝐶))
2421, 22, 23syl2anc 584 . . . 4 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((bra‘𝐶)‘𝑥) = (𝑥 ·ih 𝐶))
2520, 24oveq12d 7166 . . 3 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥)) = ((𝐵 ·ih 𝐴) · (𝑥 ·ih 𝐶)))
26 hicl 28774 . . . . . 6 ((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (𝐵 ·ih 𝐴) ∈ ℂ)
2718, 17, 26syl2anc 584 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐵 ·ih 𝐴) ∈ ℂ)
2820, 27eqeltrd 2918 . . . 4 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((bra‘𝐴)‘𝐵) ∈ ℂ)
2921, 5syl 17 . . . 4 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (bra‘𝐶): ℋ⟶ℂ)
30 hfmval 29438 . . . 4 ((((bra‘𝐴)‘𝐵) ∈ ℂ ∧ (bra‘𝐶): ℋ⟶ℂ ∧ 𝑥 ∈ ℋ) → ((((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶))‘𝑥) = (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥)))
3128, 29, 22, 30syl3anc 1365 . . 3 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶))‘𝑥) = (((bra‘𝐴)‘𝐵) · ((bra‘𝐶)‘𝑥)))
32 hicl 28774 . . . . . 6 ((𝑥 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑥 ·ih 𝐶) ∈ ℂ)
3322, 21, 32syl2anc 584 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (𝑥 ·ih 𝐶) ∈ ℂ)
34 ax-his3 28778 . . . . 5 (((𝑥 ·ih 𝐶) ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (((𝑥 ·ih 𝐶) · 𝐵) ·ih 𝐴) = ((𝑥 ·ih 𝐶) · (𝐵 ·ih 𝐴)))
3533, 18, 17, 34syl3anc 1365 . . . 4 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝑥 ·ih 𝐶) · 𝐵) ·ih 𝐴) = ((𝑥 ·ih 𝐶) · (𝐵 ·ih 𝐴)))
36123adant1 1124 . . . . . 6 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ketbra 𝐶): ℋ⟶ ℋ)
37 fvco3 6757 . . . . . 6 (((𝐵 ketbra 𝐶): ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (((bra‘𝐴) ∘ (𝐵 ketbra 𝐶))‘𝑥) = ((bra‘𝐴)‘((𝐵 ketbra 𝐶)‘𝑥)))
3836, 37sylan 580 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (((bra‘𝐴) ∘ (𝐵 ketbra 𝐶))‘𝑥) = ((bra‘𝐴)‘((𝐵 ketbra 𝐶)‘𝑥)))
39 kbval 29648 . . . . . . 7 ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝑥 ∈ ℋ) → ((𝐵 ketbra 𝐶)‘𝑥) = ((𝑥 ·ih 𝐶) · 𝐵))
4018, 21, 22, 39syl3anc 1365 . . . . . 6 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐵 ketbra 𝐶)‘𝑥) = ((𝑥 ·ih 𝐶) · 𝐵))
4140fveq2d 6671 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((bra‘𝐴)‘((𝐵 ketbra 𝐶)‘𝑥)) = ((bra‘𝐴)‘((𝑥 ·ih 𝐶) · 𝐵)))
42 hvmulcl 28707 . . . . . . 7 (((𝑥 ·ih 𝐶) ∈ ℂ ∧ 𝐵 ∈ ℋ) → ((𝑥 ·ih 𝐶) · 𝐵) ∈ ℋ)
4333, 18, 42syl2anc 584 . . . . . 6 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑥 ·ih 𝐶) · 𝐵) ∈ ℋ)
44 braval 29638 . . . . . 6 ((𝐴 ∈ ℋ ∧ ((𝑥 ·ih 𝐶) · 𝐵) ∈ ℋ) → ((bra‘𝐴)‘((𝑥 ·ih 𝐶) · 𝐵)) = (((𝑥 ·ih 𝐶) · 𝐵) ·ih 𝐴))
4517, 43, 44syl2anc 584 . . . . 5 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((bra‘𝐴)‘((𝑥 ·ih 𝐶) · 𝐵)) = (((𝑥 ·ih 𝐶) · 𝐵) ·ih 𝐴))
4638, 41, 453eqtrd 2865 . . . 4 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (((bra‘𝐴) ∘ (𝐵 ketbra 𝐶))‘𝑥) = (((𝑥 ·ih 𝐶) · 𝐵) ·ih 𝐴))
4727, 33mulcomd 10651 . . . 4 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐵 ·ih 𝐴) · (𝑥 ·ih 𝐶)) = ((𝑥 ·ih 𝐶) · (𝐵 ·ih 𝐴)))
4835, 46, 473eqtr4d 2871 . . 3 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (((bra‘𝐴) ∘ (𝐵 ketbra 𝐶))‘𝑥) = ((𝐵 ·ih 𝐴) · (𝑥 ·ih 𝐶)))
4925, 31, 483eqtr4d 2871 . 2 (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶))‘𝑥) = (((bra‘𝐴) ∘ (𝐵 ketbra 𝐶))‘𝑥))
5010, 16, 49eqfnfvd 6801 1 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (((bra‘𝐴)‘𝐵) ·fn (bra‘𝐶)) = ((bra‘𝐴) ∘ (𝐵 ketbra 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1081   = wceq 1530  wcel 2107  cmpt 5143  ccom 5558   Fn wfn 6347  wf 6348  cfv 6352  (class class class)co 7148  cc 10524   · cmul 10531  chba 28613   · csm 28615   ·ih csp 28616   ·fn chft 28636  bracbr 28650   ketbra ck 28651
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798  ax-rep 5187  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7451  ax-cnex 10582  ax-mulcom 10590  ax-hilex 28693  ax-hfvmul 28699  ax-hfi 28773  ax-his3 28778
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ne 3022  df-ral 3148  df-rex 3149  df-reu 3150  df-rab 3152  df-v 3502  df-sbc 3777  df-csb 3888  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4838  df-iun 4919  df-br 5064  df-opab 5126  df-mpt 5144  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6312  df-fun 6354  df-fn 6355  df-f 6356  df-f1 6357  df-fo 6358  df-f1o 6359  df-fv 6360  df-ov 7151  df-oprab 7152  df-mpo 7153  df-map 8398  df-hfmul 29428  df-bra 29544  df-kb 29545
This theorem is referenced by:  kbass6  29815
  Copyright terms: Public domain W3C validator