Theorem strlem1 32339

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 4280	. . 3 ⊢ (¬ (𝐴 ∖ 𝐵) = ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
2		ssdif0 4294	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∖ 𝐵) = ∅)
3	1, 2	xchnxbir 334	. 2 ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
4		eldifi 4061	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ 𝐴)
5		strlem1.1	. . . . . . . . . . . 12 ⊢ 𝐴 ∈ Cℋ
6	5	cheli 31321	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ ℋ)
7		normcl 31214	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℋ → (normℎ‘𝑥) ∈ ℝ)
8	4, 6, 7	3syl 18	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ∈ ℝ)
9		strlem1.2	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 ∈ Cℋ
10		ch0 31317	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ Cℋ → 0ℎ ∈ 𝐵)
11	9, 10	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ 0ℎ ∈ 𝐵
12		eldifn 4062	. . . . . . . . . . . . . . 15 ⊢ (0ℎ ∈ (𝐴 ∖ 𝐵) → ¬ 0ℎ ∈ 𝐵)
13	11, 12	mt2 201	. . . . . . . . . . . . . 14 ⊢ ¬ 0ℎ ∈ (𝐴 ∖ 𝐵)
14		eleq1 2827	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 0ℎ → (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ 0ℎ ∈ (𝐴 ∖ 𝐵)))
15	13, 14	mtbiri 328	. . . . . . . . . . . . 13 ⊢ (𝑥 = 0ℎ → ¬ 𝑥 ∈ (𝐴 ∖ 𝐵))
16	15	con2i 139	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ¬ 𝑥 = 0ℎ)
17		norm-i 31218	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℋ → ((normℎ‘𝑥) = 0 ↔ 𝑥 = 0ℎ))
18	4, 6, 17	3syl 18	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) = 0 ↔ 𝑥 = 0ℎ))
19	16, 18	mtbird 326	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ¬ (normℎ‘𝑥) = 0)
20	19	neqned 2941	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ≠ 0)
21	8, 20	rereccld 11973	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (normℎ‘𝑥)) ∈ ℝ)
22	21	recnd 11164	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (normℎ‘𝑥)) ∈ ℂ)
23	5	chshii 31316	. . . . . . . . . 10 ⊢ 𝐴 ∈ Sℋ
24		shmulcl 31307	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Sℋ ∧ (1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝐴) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴)
25	23, 24	mp3an1 1456	. . . . . . . . 9 ⊢ (((1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝐴) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴)
26	25	ex 413	. . . . . . . 8 ⊢ ((1 / (normℎ‘𝑥)) ∈ ℂ → (𝑥 ∈ 𝐴 → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴))
27	22, 26	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ∈ 𝐴 → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴))
28	8	recnd 11164	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ∈ ℂ)
29	9	chshii 31316	. . . . . . . . . . . 12 ⊢ 𝐵 ∈ Sℋ
30		shmulcl 31307	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ Sℋ ∧ (normℎ‘𝑥) ∈ ℂ ∧ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵)
31	29, 30	mp3an1 1456	. . . . . . . . . . 11 ⊢ (((normℎ‘𝑥) ∈ ℂ ∧ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵)
32	31	ex 413	. . . . . . . . . 10 ⊢ ((normℎ‘𝑥) ∈ ℂ → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵))
33	28, 32	syl 17	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵))
34	28, 20	recidd 11917	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) = 1)
35	34	oveq1d 7371	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = (1 ·ℎ 𝑥))
36	4, 6	syl 17	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ ℋ)
37		ax-hvmulass 31096	. . . . . . . . . . . 12 ⊢ (((normℎ‘𝑥) ∈ ℂ ∧ (1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ ℋ) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)))
38	28, 22, 36, 37	syl3anc 1379	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)))
39		ax-hvmulid 31095	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℋ → (1 ·ℎ 𝑥) = 𝑥)
40	4, 6, 39	3syl 18	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 ·ℎ 𝑥) = 𝑥)
41	35, 38, 40	3eqtr3d 2782	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 𝑥)
42	41	eleq1d 2824	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
43	33, 42	sylibd 240	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → 𝑥 ∈ 𝐵))
44	43	con3d 152	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (¬ 𝑥 ∈ 𝐵 → ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵))
45	27, 44	anim12d 615	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴 ∧ ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵)))
46		eldif 3893	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
47		eldif 3893	. . . . . 6 ⊢ (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵) ↔ (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴 ∧ ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵))
48	45, 46, 47	3imtr4g 297	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵)))
49	48	pm2.43i 52	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵))
50		norm-iii 31229	. . . . . 6 ⊢ (((1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ ℋ) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)))
51	22, 36, 50	syl2anc 590	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)))
52	15	necon2ai 2963	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ≠ 0ℎ)
53		normgt0 31216	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℋ → (𝑥 ≠ 0ℎ ↔ 0 < (normℎ‘𝑥)))
54	4, 6, 53	3syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ≠ 0ℎ ↔ 0 < (normℎ‘𝑥)))
55	52, 54	mpbid 233	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 < (normℎ‘𝑥))
56		1re 11135	. . . . . . . . 9 ⊢ 1 ∈ ℝ
57		0le1 11664	. . . . . . . . 9 ⊢ 0 ≤ 1
58		divge0 12016	. . . . . . . . 9 ⊢ (((1 ∈ ℝ ∧ 0 ≤ 1) ∧ ((normℎ‘𝑥) ∈ ℝ ∧ 0 < (normℎ‘𝑥))) → 0 ≤ (1 / (normℎ‘𝑥)))
59	56, 57, 58	mpanl12 708	. . . . . . . 8 ⊢ (((normℎ‘𝑥) ∈ ℝ ∧ 0 < (normℎ‘𝑥)) → 0 ≤ (1 / (normℎ‘𝑥)))
60	8, 55, 59	syl2anc 590	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 ≤ (1 / (normℎ‘𝑥)))
61	21, 60	absidd 15376	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (abs‘(1 / (normℎ‘𝑥))) = (1 / (normℎ‘𝑥)))
62	61	oveq1d 7371	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)) = ((1 / (normℎ‘𝑥)) · (normℎ‘𝑥)))
63	28, 20	recid2d 11918	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (normℎ‘𝑥)) · (normℎ‘𝑥)) = 1)
64	51, 62, 63	3eqtrd 2778	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1)
65		fveqeq2 6836	. . . . 5 ⊢ (𝑢 = ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) → ((normℎ‘𝑢) = 1 ↔ (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1))
66	65	rspcev 3560	. . . 4 ⊢ ((((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵) ∧ (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
67	49, 64, 66	syl2anc 590	. . 3 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
68	67	exlimiv 1937	. 2 ⊢ (∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
69	3, 68	sylbi 218	1 ⊢ (¬ 𝐴 ⊆ 𝐵 → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547  ∃wex 1786   ∈ wcel 2119   ≠ wne 2934  ∃wrex 3063   ∖ cdif 3880   ⊆ wss 3883  ∅c0 4261   class class class wbr 5072  ‘cfv 6485  (class class class)co 7356  ℂcc 11027  ℝcr 11028  0cc0 11029  1c1 11030   · cmul 11034   < clt 11170   ≤ cle 11171   / cdiv 11798  abscabs 15187   ℋchba 31008   ·_ℎ csm 31010  norm_ℎcno 31012  0_ℎc0v 31013   S_ℋ csh 31017   C_ℋ cch 31018

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106  ax-pre-sup 11107  ax-hilex 31088  ax-hfvadd 31089  ax-hv0cl 31092  ax-hfvmul 31094  ax-hvmulid 31095  ax-hvmulass 31096  ax-hvmul0 31099  ax-hfi 31168  ax-his1 31171  ax-his3 31173  ax-his4 31174

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-er 8633  df-en 8884  df-dom 8885  df-sdom 8886  df-sup 9345  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-div 11799  df-nn 12166  df-2 12235  df-3 12236  df-n0 12429  df-z 12516  df-uz 12780  df-rp 12934  df-seq 13955  df-exp 14015  df-cj 15052  df-re 15053  df-im 15054  df-sqrt 15188  df-abs 15189  df-hnorm 31057  df-sh 31296  df-ch 31310

This theorem is referenced by:  stri  32346  hstri  32354