strlem1 - Hilbert Space Explorer

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

Theorem strlem1 31491

Description: Lemma for strong state theorem: if closed subspace 𝐴 is not contained in 𝐵, there is a unit vector 𝑢 in their difference. (Contributed by NM, 25-Oct-1999.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
strlem1.1	⊢ 𝐴 ∈ C_ℋ
strlem1.2	⊢ 𝐵 ∈ C_ℋ

**Assertion**
Ref	Expression
strlem1	⊢ (¬ 𝐴 ⊆ 𝐵 → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(norm_ℎ‘𝑢) = 1)

Distinct variable groups: 𝑢,𝐴 𝑢,𝐵

Proof of Theorem strlem1 Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		neq0 4345	. . 3 ⊢ (¬ (𝐴 ∖ 𝐵) = ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
2		ssdif0 4363	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∖ 𝐵) = ∅)
3	1, 2	xchnxbir 333	. 2 ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
4		eldifi 4126	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ 𝐴)
5		strlem1.1	. . . . . . . . . . . 12 ⊢ 𝐴 ∈ C_ℋ
6	5	cheli 30473	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ ℋ)
7		normcl 30366	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℋ → (norm_ℎ‘𝑥) ∈ ℝ)
8	4, 6, 7	3syl 18	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (norm_ℎ‘𝑥) ∈ ℝ)
9		strlem1.2	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 ∈ C_ℋ
10		ch0 30469	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ C_ℋ → 0_ℎ ∈ 𝐵)
11	9, 10	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ 0_ℎ ∈ 𝐵
12		eldifn 4127	. . . . . . . . . . . . . . 15 ⊢ (0_ℎ ∈ (𝐴 ∖ 𝐵) → ¬ 0_ℎ ∈ 𝐵)
13	11, 12	mt2 199	. . . . . . . . . . . . . 14 ⊢ ¬ 0_ℎ ∈ (𝐴 ∖ 𝐵)
14		eleq1 2822	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 0_ℎ → (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ 0_ℎ ∈ (𝐴 ∖ 𝐵)))
15	13, 14	mtbiri 327	. . . . . . . . . . . . 13 ⊢ (𝑥 = 0_ℎ → ¬ 𝑥 ∈ (𝐴 ∖ 𝐵))
16	15	con2i 139	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ¬ 𝑥 = 0_ℎ)
17		norm-i 30370	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℋ → ((norm_ℎ‘𝑥) = 0 ↔ 𝑥 = 0_ℎ))
18	4, 6, 17	3syl 18	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((norm_ℎ‘𝑥) = 0 ↔ 𝑥 = 0_ℎ))
19	16, 18	mtbird 325	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ¬ (norm_ℎ‘𝑥) = 0)
20	19	neqned 2948	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (norm_ℎ‘𝑥) ≠ 0)
21	8, 20	rereccld 12038	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (norm_ℎ‘𝑥)) ∈ ℝ)
22	21	recnd 11239	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (norm_ℎ‘𝑥)) ∈ ℂ)
23	5	chshii 30468	. . . . . . . . . 10 ⊢ 𝐴 ∈ S_ℋ
24		shmulcl 30459	. . . . . . . . . 10 ⊢ ((𝐴 ∈ S_ℋ ∧ (1 / (norm_ℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝐴) → ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐴)
25	23, 24	mp3an1 1449	. . . . . . . . 9 ⊢ (((1 / (norm_ℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝐴) → ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐴)
26	25	ex 414	. . . . . . . 8 ⊢ ((1 / (norm_ℎ‘𝑥)) ∈ ℂ → (𝑥 ∈ 𝐴 → ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐴))
27	22, 26	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ∈ 𝐴 → ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐴))
28	8	recnd 11239	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (norm_ℎ‘𝑥) ∈ ℂ)
29	9	chshii 30468	. . . . . . . . . . . 12 ⊢ 𝐵 ∈ S_ℋ
30		shmulcl 30459	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ S_ℋ ∧ (norm_ℎ‘𝑥) ∈ ℂ ∧ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐵) → ((norm_ℎ‘𝑥) ·_ℎ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) ∈ 𝐵)
31	29, 30	mp3an1 1449	. . . . . . . . . . 11 ⊢ (((norm_ℎ‘𝑥) ∈ ℂ ∧ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐵) → ((norm_ℎ‘𝑥) ·_ℎ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) ∈ 𝐵)
32	31	ex 414	. . . . . . . . . 10 ⊢ ((norm_ℎ‘𝑥) ∈ ℂ → (((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐵 → ((norm_ℎ‘𝑥) ·_ℎ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) ∈ 𝐵))
33	28, 32	syl 17	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐵 → ((norm_ℎ‘𝑥) ·_ℎ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) ∈ 𝐵))
34	28, 20	recidd 11982	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((norm_ℎ‘𝑥) · (1 / (norm_ℎ‘𝑥))) = 1)
35	34	oveq1d 7421	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((norm_ℎ‘𝑥) · (1 / (norm_ℎ‘𝑥))) ·_ℎ 𝑥) = (1 ·_ℎ 𝑥))
36	4, 6	syl 17	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ ℋ)
37		ax-hvmulass 30248	. . . . . . . . . . . 12 ⊢ (((norm_ℎ‘𝑥) ∈ ℂ ∧ (1 / (norm_ℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ ℋ) → (((norm_ℎ‘𝑥) · (1 / (norm_ℎ‘𝑥))) ·_ℎ 𝑥) = ((norm_ℎ‘𝑥) ·_ℎ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)))
38	28, 22, 36, 37	syl3anc 1372	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((norm_ℎ‘𝑥) · (1 / (norm_ℎ‘𝑥))) ·_ℎ 𝑥) = ((norm_ℎ‘𝑥) ·_ℎ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)))
39		ax-hvmulid 30247	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℋ → (1 ·_ℎ 𝑥) = 𝑥)
40	4, 6, 39	3syl 18	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 ·_ℎ 𝑥) = 𝑥)
41	35, 38, 40	3eqtr3d 2781	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((norm_ℎ‘𝑥) ·_ℎ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) = 𝑥)
42	41	eleq1d 2819	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((norm_ℎ‘𝑥) ·_ℎ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
43	33, 42	sylibd 238	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐵 → 𝑥 ∈ 𝐵))
44	43	con3d 152	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (¬ 𝑥 ∈ 𝐵 → ¬ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐵))
45	27, 44	anim12d 610	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → (((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐴 ∧ ¬ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐵)))
46		eldif 3958	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
47		eldif 3958	. . . . . 6 ⊢ (((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ (𝐴 ∖ 𝐵) ↔ (((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐴 ∧ ¬ ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ 𝐵))
48	45, 46, 47	3imtr4g 296	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ (𝐴 ∖ 𝐵)))
49	48	pm2.43i 52	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ (𝐴 ∖ 𝐵))
50		norm-iii 30381	. . . . . 6 ⊢ (((1 / (norm_ℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ ℋ) → (norm_ℎ‘((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) = ((abs‘(1 / (norm_ℎ‘𝑥))) · (norm_ℎ‘𝑥)))
51	22, 36, 50	syl2anc 585	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (norm_ℎ‘((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) = ((abs‘(1 / (norm_ℎ‘𝑥))) · (norm_ℎ‘𝑥)))
52	15	necon2ai 2971	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ≠ 0_ℎ)
53		normgt0 30368	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℋ → (𝑥 ≠ 0_ℎ ↔ 0 < (norm_ℎ‘𝑥)))
54	4, 6, 53	3syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ≠ 0_ℎ ↔ 0 < (norm_ℎ‘𝑥)))
55	52, 54	mpbid 231	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 < (norm_ℎ‘𝑥))
56		1re 11211	. . . . . . . . 9 ⊢ 1 ∈ ℝ
57		0le1 11734	. . . . . . . . 9 ⊢ 0 ≤ 1
58		divge0 12080	. . . . . . . . 9 ⊢ (((1 ∈ ℝ ∧ 0 ≤ 1) ∧ ((norm_ℎ‘𝑥) ∈ ℝ ∧ 0 < (norm_ℎ‘𝑥))) → 0 ≤ (1 / (norm_ℎ‘𝑥)))
59	56, 57, 58	mpanl12 701	. . . . . . . 8 ⊢ (((norm_ℎ‘𝑥) ∈ ℝ ∧ 0 < (norm_ℎ‘𝑥)) → 0 ≤ (1 / (norm_ℎ‘𝑥)))
60	8, 55, 59	syl2anc 585	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 ≤ (1 / (norm_ℎ‘𝑥)))
61	21, 60	absidd 15366	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (abs‘(1 / (norm_ℎ‘𝑥))) = (1 / (norm_ℎ‘𝑥)))
62	61	oveq1d 7421	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((abs‘(1 / (norm_ℎ‘𝑥))) · (norm_ℎ‘𝑥)) = ((1 / (norm_ℎ‘𝑥)) · (norm_ℎ‘𝑥)))
63	28, 20	recid2d 11983	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (norm_ℎ‘𝑥)) · (norm_ℎ‘𝑥)) = 1)
64	51, 62, 63	3eqtrd 2777	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (norm_ℎ‘((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) = 1)
65		fveqeq2 6898	. . . . 5 ⊢ (𝑢 = ((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) → ((norm_ℎ‘𝑢) = 1 ↔ (norm_ℎ‘((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) = 1))
66	65	rspcev 3613	. . . 4 ⊢ ((((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥) ∈ (𝐴 ∖ 𝐵) ∧ (norm_ℎ‘((1 / (norm_ℎ‘𝑥)) ·_ℎ 𝑥)) = 1) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(norm_ℎ‘𝑢) = 1)
67	49, 64, 66	syl2anc 585	. . 3 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(norm_ℎ‘𝑢) = 1)
68	67	exlimiv 1934	. 2 ⊢ (∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(norm_ℎ‘𝑢) = 1)
69	3, 68	sylbi 216	1 ⊢ (¬ 𝐴 ⊆ 𝐵 → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(norm_ℎ‘𝑢) = 1)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∃wex 1782 ∈ wcel 2107 ≠ wne 2941 ∃wrex 3071 ∖ cdif 3945 ⊆ wss 3948 ∅c0 4322 class class class wbr 5148 ‘cfv 6541 (class class class)co 7406 ℂcc 11105 ℝcr 11106 0cc0 11107 1c1 11108 · cmul 11112 < clt 11245 ≤ cle 11246 / cdiv 11868 abscabs 15178 ℋchba 30160 ·_ℎ csm 30162 norm_ℎcno 30164 0_ℎc0v 30165 S_ℋ csh 30169 C_ℋ cch 30170

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185 ax-hilex 30240 ax-hfvadd 30241 ax-hv0cl 30244 ax-hfvmul 30246 ax-hvmulid 30247 ax-hvmulass 30248 ax-hvmul0 30251 ax-hfi 30320 ax-his1 30323 ax-his3 30325 ax-his4 30326

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-sup 9434 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 df-nn 12210 df-2 12272 df-3 12273 df-n0 12470 df-z 12556 df-uz 12820 df-rp 12972 df-seq 13964 df-exp 14025 df-cj 15043 df-re 15044 df-im 15045 df-sqrt 15179 df-abs 15180 df-hnorm 30209 df-sh 30448 df-ch 30462

This theorem is referenced by: stri 31498 hstri 31506

W3C validator