stcltr1i - Hilbert Space Explorer

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

Theorem stcltr1i 32933

Description: Property of a strong classical state. (Contributed by NM, 24-Oct-1999.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
stcltr1.1	⊢ (𝜑 ↔ (𝑆 ∈ States ∧ ∀𝑥 ∈ C_ℋ ∀𝑦 ∈ C_ℋ (((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) → 𝑥 ⊆ 𝑦)))
stcltr1.2	⊢ 𝐴 ∈ C_ℋ
stcltr1.3	⊢ 𝐵 ∈ C_ℋ

**Assertion**
Ref	Expression
stcltr1i	⊢ (𝜑 → (((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1) → 𝐴 ⊆ 𝐵))

Distinct variable groups: 𝑥,𝑦,𝐴 𝑥,𝐵,𝑦 𝑥,𝑆,𝑦 Allowed substitution hints: 𝜑(𝑥, 𝑦)

**Proof of Theorem stcltr1i**
Step	Hyp	Ref	Expression
1		stcltr1.1	. 2 ⊢ (𝜑 ↔ (𝑆 ∈ States ∧ ∀𝑥 ∈ C_ℋ ∀𝑦 ∈ C_ℋ (((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) → 𝑥 ⊆ 𝑦)))
2		stcltr1.2	. . 3 ⊢ 𝐴 ∈ C_ℋ
3		stcltr1.3	. . 3 ⊢ 𝐵 ∈ C_ℋ
4		fveqeq2 6925	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑆‘𝑥) = 1 ↔ (𝑆‘𝐴) = 1))
5	4	imbi1d 344	. . . . 5 ⊢ (𝑥 = 𝐴 → (((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) ↔ ((𝑆‘𝐴) = 1 → (𝑆‘𝑦) = 1)))
6		sseq1 3938	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝑦 ↔ 𝐴 ⊆ 𝑦))
7	5, 6	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝐴 → ((((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) → 𝑥 ⊆ 𝑦) ↔ (((𝑆‘𝐴) = 1 → (𝑆‘𝑦) = 1) → 𝐴 ⊆ 𝑦)))
8		fveqeq2 6925	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑆‘𝑦) = 1 ↔ (𝑆‘𝐵) = 1))
9	8	imbi2d 343	. . . . 5 ⊢ (𝑦 = 𝐵 → (((𝑆‘𝐴) = 1 → (𝑆‘𝑦) = 1) ↔ ((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1)))
10		sseq2 3939	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 ⊆ 𝑦 ↔ 𝐴 ⊆ 𝐵))
11	9, 10	imbi12d 347	. . . 4 ⊢ (𝑦 = 𝐵 → ((((𝑆‘𝐴) = 1 → (𝑆‘𝑦) = 1) → 𝐴 ⊆ 𝑦) ↔ (((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1) → 𝐴 ⊆ 𝐵)))
12	7, 11	rspc2v 3590	. . 3 ⊢ ((𝐴 ∈ C_ℋ ∧ 𝐵 ∈ C_ℋ ) → (∀𝑥 ∈ C_ℋ ∀𝑦 ∈ C_ℋ (((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) → 𝑥 ⊆ 𝑦) → (((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1) → 𝐴 ⊆ 𝐵)))
13	2, 3, 12	mp2an 705	. 2 ⊢ (∀𝑥 ∈ C_ℋ ∀𝑦 ∈ C_ℋ (((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) → 𝑥 ⊆ 𝑦) → (((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1) → 𝐴 ⊆ 𝐵))
14	1, 13	simplbiim 514	1 ⊢ (𝜑 → (((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1) → 𝐴 ⊆ 𝐵))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ⊆ wss 3900 ‘cfv 6566 1c1 11240 C_ℋ cch 31588 Statescst 31621

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-ext 2735

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-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-iota 6520 df-fv 6574

This theorem is used by: stcltr2i 32934 stcltrlem2 32936

W3C validator