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 32349

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 6843	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑆‘𝑥) = 1 ↔ (𝑆‘𝐴) = 1))
5	4	imbi1d 341	. . . . 5 ⊢ (𝑥 = 𝐴 → (((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) ↔ ((𝑆‘𝐴) = 1 → (𝑆‘𝑦) = 1)))
6		sseq1 3959	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝑦 ↔ 𝐴 ⊆ 𝑦))
7	5, 6	imbi12d 344	. . . 4 ⊢ (𝑥 = 𝐴 → ((((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) → 𝑥 ⊆ 𝑦) ↔ (((𝑆‘𝐴) = 1 → (𝑆‘𝑦) = 1) → 𝐴 ⊆ 𝑦)))
8		fveqeq2 6843	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑆‘𝑦) = 1 ↔ (𝑆‘𝐵) = 1))
9	8	imbi2d 340	. . . . 5 ⊢ (𝑦 = 𝐵 → (((𝑆‘𝐴) = 1 → (𝑆‘𝑦) = 1) ↔ ((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1)))
10		sseq2 3960	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 ⊆ 𝑦 ↔ 𝐴 ⊆ 𝐵))
11	9, 10	imbi12d 344	. . . 4 ⊢ (𝑦 = 𝐵 → ((((𝑆‘𝐴) = 1 → (𝑆‘𝑦) = 1) → 𝐴 ⊆ 𝑦) ↔ (((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1) → 𝐴 ⊆ 𝐵)))
12	7, 11	rspc2v 3587	. . 3 ⊢ ((𝐴 ∈ C_ℋ ∧ 𝐵 ∈ C_ℋ ) → (∀𝑥 ∈ C_ℋ ∀𝑦 ∈ C_ℋ (((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) → 𝑥 ⊆ 𝑦) → (((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1) → 𝐴 ⊆ 𝐵)))
13	2, 3, 12	mp2an 692	. 2 ⊢ (∀𝑥 ∈ C_ℋ ∀𝑦 ∈ C_ℋ (((𝑆‘𝑥) = 1 → (𝑆‘𝑦) = 1) → 𝑥 ⊆ 𝑦) → (((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1) → 𝐴 ⊆ 𝐵))
14	1, 13	simplbiim 504	1 ⊢ (𝜑 → (((𝑆‘𝐴) = 1 → (𝑆‘𝐵) = 1) → 𝐴 ⊆ 𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ⊆ wss 3901 ‘cfv 6492 1c1 11027 C_ℋ cch 31004 Statescst 31037

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-iota 6448 df-fv 6500

This theorem is referenced by: stcltr2i 32350 stcltrlem2 32352

W3C validator