Theorem hstel2 32308

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.

Step	Hyp	Ref	Expression
1		ishst 32303	. . . 4 ⊢ (𝑆 ∈ CHStates ↔ (𝑆: Cℋ ⟶ ℋ ∧ (normℎ‘(𝑆‘ ℋ)) = 1 ∧ ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦))))))
2	1	simp3bi 1148	. . 3 ⊢ (𝑆 ∈ CHStates → ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))))
3	2	ad2antrr 727	. 2 ⊢ (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))))
4		sseq1 3948	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝑦)))
5		fveq2 6835	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑆‘𝑥) = (𝑆‘𝐴))
6	5	oveq1d 7376	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = ((𝑆‘𝐴) ·ih (𝑆‘𝑦)))
7	6	eqeq1d 2739	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ↔ ((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0))
8		fvoveq1 7384	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (𝑆‘(𝑥 ∨ℋ 𝑦)) = (𝑆‘(𝐴 ∨ℋ 𝑦)))
9	5	oveq1d 7376	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))
10	8, 9	eqeq12d 2753	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)) ↔ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))))
11	7, 10	anbi12d 633	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦))) ↔ (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))))
12	4, 11	imbi12d 344	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) ↔ (𝐴 ⊆ (⊥‘𝑦) → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))))))
13		fveq2 6835	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (⊥‘𝑦) = (⊥‘𝐵))
14	13	sseq2d 3955	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝐴 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝐵)))
15		fveq2 6835	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝑆‘𝑦) = (𝑆‘𝐵))
16	15	oveq2d 7377	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → ((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = ((𝑆‘𝐴) ·ih (𝑆‘𝐵)))
17	16	eqeq1d 2739	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ↔ ((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0))
18		oveq2 7369	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝐴 ∨ℋ 𝑦) = (𝐴 ∨ℋ 𝐵))
19	18	fveq2d 6839	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝑆‘(𝐴 ∨ℋ 𝑦)) = (𝑆‘(𝐴 ∨ℋ 𝐵)))
20	15	oveq2d 7377	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))
21	19, 20	eqeq12d 2753	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → ((𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)) ↔ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))
22	17, 21	anbi12d 633	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))) ↔ (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))))
23	14, 22	imbi12d 344	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝐴 ⊆ (⊥‘𝑦) → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))) ↔ (𝐴 ⊆ (⊥‘𝐵) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))))
24	12, 23	rspc2v 3576	. . . . 5 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (𝐴 ⊆ (⊥‘𝐵) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))))
25	24	com23 86	. . . 4 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 ⊆ (⊥‘𝐵) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))))
26	25	impr 454	. . 3 ⊢ ((𝐴 ∈ Cℋ ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))))
27	26	adantll 715	. 2 ⊢ (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))))
28	3, 27	mpd 15	1 ⊢ (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052   ⊆ wss 3890  ⟶wf 6489  ‘cfv 6493  (class class class)co 7361  0cc0 11032  1c1 11033   ℋchba 31008   +_ℎ cva 31009   ·_ih csp 31011  norm_ℎcno 31012   C_ℋ cch 31018  ⊥cort 31019   ∨_ℋ chj 31022  CHStateschst 31052

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-pow 5303  ax-pr 5371  ax-un 7683  ax-hilex 31088

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-map 8769  df-sh 31296  df-ch 31310  df-hst 32301

This theorem is referenced by:  hstorth  32309  hstosum  32310