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

Theorem hstel2 32878
Description: Properties of a Hilbert-space-valued state. (Contributed by NM, 25-Jun-2006.) (New usage is discouraged.)
Assertion
Ref Expression
hstel2 (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))

Proof of Theorem hstel2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ishst 32873 . . . 4 (𝑆 ∈ CHStates ↔ (𝑆: Cℋ ⟶ ℋ ∧ (normℎ‘(𝑆‘ ℋ)) = 1 ∧ ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦))))))
21simp3bi 1165 . . 3 (𝑆 ∈ CHStates → ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))))
32ad2antrr 739 . 2 (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))))
4 sseq1 3938 . . . . . . 7 (𝑥 = 𝐴 → (𝑥 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝑦)))
5 fveq2 6916 . . . . . . . . . 10 (𝑥 = 𝐴 → (𝑆‘𝑥) = (𝑆‘𝐴))
65oveq1d 7466 . . . . . . . . 9 (𝑥 = 𝐴 → ((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = ((𝑆‘𝐴) ·ih (𝑆‘𝑦)))
76eqeq1d 2765 . . . . . . . 8 (𝑥 = 𝐴 → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ↔ ((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0))
8 fvoveq1 7474 . . . . . . . . 9 (𝑥 = 𝐴 → (𝑆‘(𝑥 ∨ℋ 𝑦)) = (𝑆‘(𝐴 ∨ℋ 𝑦)))
95oveq1d 7466 . . . . . . . . 9 (𝑥 = 𝐴 → ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))
108, 9eqeq12d 2779 . . . . . . . 8 (𝑥 = 𝐴 → ((𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)) ↔ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))))
117, 10anbi12d 644 . . . . . . 7 (𝑥 = 𝐴 → ((((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦))) ↔ (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))))
124, 11imbi12d 347 . . . . . 6 (𝑥 = 𝐴 → ((𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) ↔ (𝐴 ⊆ (⊥‘𝑦) → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))))))
13 fveq2 6916 . . . . . . . 8 (𝑦 = 𝐵 → (⊥‘𝑦) = (⊥‘𝐵))
1413sseq2d 3945 . . . . . . 7 (𝑦 = 𝐵 → (𝐴 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝐵)))
15 fveq2 6916 . . . . . . . . . 10 (𝑦 = 𝐵 → (𝑆‘𝑦) = (𝑆‘𝐵))
1615oveq2d 7467 . . . . . . . . 9 (𝑦 = 𝐵 → ((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = ((𝑆‘𝐴) ·ih (𝑆‘𝐵)))
1716eqeq1d 2765 . . . . . . . 8 (𝑦 = 𝐵 → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ↔ ((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0))
18 oveq2 7459 . . . . . . . . . 10 (𝑦 = 𝐵 → (𝐴 ∨ℋ 𝑦) = (𝐴 ∨ℋ 𝐵))
1918fveq2d 6920 . . . . . . . . 9 (𝑦 = 𝐵 → (𝑆‘(𝐴 ∨ℋ 𝑦)) = (𝑆‘(𝐴 ∨ℋ 𝐵)))
2015oveq2d 7467 . . . . . . . . 9 (𝑦 = 𝐵 → ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))
2119, 20eqeq12d 2779 . . . . . . . 8 (𝑦 = 𝐵 → ((𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)) ↔ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))
2217, 21anbi12d 644 . . . . . . 7 (𝑦 = 𝐵 → ((((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))) ↔ (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))))
2314, 22imbi12d 347 . . . . . 6 (𝑦 = 𝐵 → ((𝐴 ⊆ (⊥‘𝑦) → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))) ↔ (𝐴 ⊆ (⊥‘𝐵) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))))
2412, 23rspc2v 3590 . . . . 5 ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (𝐴 ⊆ (⊥‘𝐵) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))))
2524com23 87 . . . 4 ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 ⊆ (⊥‘𝐵) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))))
2625impr 460 . . 3 ((𝐴 ∈ Cℋ ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))))
2726adantll 727 . 2 (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))))
283, 27mpd 16 1 (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  0cc0 11239  1c1 11240   ℋchba 31578   +ℎ cva 31579   ·ih csp 31581  normℎcno 31582   Cℋ cch 31588  ⊥cort 31589   ∨ℋ chj 31592  CHStateschst 31622
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-sep 5255  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-hilex 31658
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  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-br 5109  df-opab 5174  df-id 5553  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-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-sh 31866  df-ch 31880  df-hst 32871
This theorem is used by:  hstorth  32879  hstosum  32880
  Copyright terms: Public domain W3C validator