Theorem hstel2 32833

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 32828	. . . 4 ⊢ (𝑆 ∈ CHStates ↔ (𝑆: Cℋ ⟶ ℋ ∧ (normℎ‘(𝑆‘ ℋ)) = 1 ∧ ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦))))))
2	1	simp3bi 1165	. . 3 ⊢ (𝑆 ∈ CHStates → ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))))
3	2	ad2antrr 739	. 2 ⊢ (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))))
4		sseq1 3937	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝑦)))
5		fveq2 6893	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑆‘𝑥) = (𝑆‘𝐴))
6	5	oveq1d 7442	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = ((𝑆‘𝐴) ·ih (𝑆‘𝑦)))
7	6	eqeq1d 2765	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ↔ ((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0))
8		fvoveq1 7450	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (𝑆‘(𝑥 ∨ℋ 𝑦)) = (𝑆‘(𝐴 ∨ℋ 𝑦)))
9	5	oveq1d 7442	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))
10	8, 9	eqeq12d 2779	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)) ↔ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))))
11	7, 10	anbi12d 644	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦))) ↔ (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))))
12	4, 11	imbi12d 347	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) ↔ (𝐴 ⊆ (⊥‘𝑦) → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))))))
13		fveq2 6893	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (⊥‘𝑦) = (⊥‘𝐵))
14	13	sseq2d 3944	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝐴 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝐵)))
15		fveq2 6893	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝑆‘𝑦) = (𝑆‘𝐵))
16	15	oveq2d 7443	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → ((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = ((𝑆‘𝐴) ·ih (𝑆‘𝐵)))
17	16	eqeq1d 2765	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ↔ ((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0))
18		oveq2 7435	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝐴 ∨ℋ 𝑦) = (𝐴 ∨ℋ 𝐵))
19	18	fveq2d 6897	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝑆‘(𝐴 ∨ℋ 𝑦)) = (𝑆‘(𝐴 ∨ℋ 𝐵)))
20	15	oveq2d 7443	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))
21	19, 20	eqeq12d 2779	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → ((𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)) ↔ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))
22	17, 21	anbi12d 644	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))) ↔ (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))))
23	14, 22	imbi12d 347	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝐴 ⊆ (⊥‘𝑦) → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))) ↔ (𝐴 ⊆ (⊥‘𝐵) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))))
24	12, 23	rspc2v 3589	. . . . 5 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (𝐴 ⊆ (⊥‘𝐵) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))))
25	24	com23 87	. . . 4 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 ⊆ (⊥‘𝐵) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))))
26	25	impr 460	. . 3 ⊢ ((𝐴 ∈ Cℋ ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))))
27	26	adantll 727	. 2 ⊢ (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))))
28	3, 27	mpd 16	1 ⊢ (((𝑆 ∈ CHStates ∧ 𝐴 ∈ Cℋ ) ∧ (𝐵 ∈ Cℋ ∧ 𝐴 ⊆ (⊥‘𝐵))) → (((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝐵)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3079   ⊆ wss 3899  ⟶wf 6542  ‘cfv 6546  (class class class)co 7427  0cc0 11210  1c1 11211   ℋchba 31533   +_ℎ cva 31534   ·_ih csp 31536  norm_ℎcno 31537   C_ℋ cch 31543  ⊥cort 31544   ∨_ℋ chj 31547  CHStateschst 31577

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pow 5330  ax-pr 5394  ax-un 7758  ax-hilex 31613

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-fv 6554  df-ov 7430  df-oprab 7431  df-mpo 7432  df-map 8860  df-sh 31821  df-ch 31835  df-hst 32826

This theorem is used by:  hstorth  32834  hstosum  32835