Theorem hstel2 32644

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 32639	. . . 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 3963	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝑦)))
5		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑆‘𝑥) = (𝑆‘𝐴))
6	5	oveq1d 7434	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = ((𝑆‘𝐴) ·ih (𝑆‘𝑦)))
7	6	eqeq1d 2767	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ↔ ((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0))
8		fvoveq1 7442	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (𝑆‘(𝑥 ∨ℋ 𝑦)) = (𝑆‘(𝐴 ∨ℋ 𝑦)))
9	5	oveq1d 7434	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))
10	8, 9	eqeq12d 2781	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)) ↔ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))))
11	7, 10	anbi12d 644	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦))) ↔ (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)))))
12	4, 11	imbi12d 347	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ (⊥‘𝑦) → (((𝑆‘𝑥) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) +ℎ (𝑆‘𝑦)))) ↔ (𝐴 ⊆ (⊥‘𝑦) → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ∧ (𝑆‘(𝐴 ∨ℋ 𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝑦))))))
13		fveq2 6885	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (⊥‘𝑦) = (⊥‘𝐵))
14	13	sseq2d 3970	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝐴 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝐵)))
15		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝑆‘𝑦) = (𝑆‘𝐵))
16	15	oveq2d 7435	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → ((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = ((𝑆‘𝐴) ·ih (𝑆‘𝐵)))
17	16	eqeq1d 2767	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (((𝑆‘𝐴) ·ih (𝑆‘𝑦)) = 0 ↔ ((𝑆‘𝐴) ·ih (𝑆‘𝐵)) = 0))
18		oveq2 7427	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝐴 ∨ℋ 𝑦) = (𝐴 ∨ℋ 𝐵))
19	18	fveq2d 6889	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝑆‘(𝐴 ∨ℋ 𝑦)) = (𝑆‘(𝐴 ∨ℋ 𝐵)))
20	15	oveq2d 7435	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → ((𝑆‘𝐴) +ℎ (𝑆‘𝑦)) = ((𝑆‘𝐴) +ℎ (𝑆‘𝐵)))
21	19, 20	eqeq12d 2781	. . . . . . . 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 3594	. . . . 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 1570   ∈ wcel 2146  ∀wral 3081   ⊆ wss 3906  ⟶wf 6536  ‘cfv 6540  (class class class)co 7419  0cc0 11117  1c1 11118   ℋchba 31344   +_ℎ cva 31345   ·_ih csp 31347  norm_ℎcno 31348   C_ℋ cch 31354  ⊥cort 31355   ∨_ℋ chj 31358  CHStateschst 31388

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-hilex 31424

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-map 8832  df-sh 31632  df-ch 31646  df-hst 32637

This theorem is used by:  hstorth  32645  hstosum  32646