Theorem strlem1 32186

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 4318	. . 3 ⊢ (¬ (𝐴 ∖ 𝐵) = ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
2		ssdif0 4332	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∖ 𝐵) = ∅)
3	1, 2	xchnxbir 333	. 2 ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
4		eldifi 4097	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ 𝐴)
5		strlem1.1	. . . . . . . . . . . 12 ⊢ 𝐴 ∈ Cℋ
6	5	cheli 31168	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ ℋ)
7		normcl 31061	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℋ → (normℎ‘𝑥) ∈ ℝ)
8	4, 6, 7	3syl 18	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ∈ ℝ)
9		strlem1.2	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 ∈ Cℋ
10		ch0 31164	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ Cℋ → 0ℎ ∈ 𝐵)
11	9, 10	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ 0ℎ ∈ 𝐵
12		eldifn 4098	. . . . . . . . . . . . . . 15 ⊢ (0ℎ ∈ (𝐴 ∖ 𝐵) → ¬ 0ℎ ∈ 𝐵)
13	11, 12	mt2 200	. . . . . . . . . . . . . 14 ⊢ ¬ 0ℎ ∈ (𝐴 ∖ 𝐵)
14		eleq1 2817	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 0ℎ → (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ 0ℎ ∈ (𝐴 ∖ 𝐵)))
15	13, 14	mtbiri 327	. . . . . . . . . . . . 13 ⊢ (𝑥 = 0ℎ → ¬ 𝑥 ∈ (𝐴 ∖ 𝐵))
16	15	con2i 139	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ¬ 𝑥 = 0ℎ)
17		norm-i 31065	. . . . . . . . . . . . 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 2933	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ≠ 0)
21	8, 20	rereccld 12016	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (normℎ‘𝑥)) ∈ ℝ)
22	21	recnd 11209	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (normℎ‘𝑥)) ∈ ℂ)
23	5	chshii 31163	. . . . . . . . . 10 ⊢ 𝐴 ∈ Sℋ
24		shmulcl 31154	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Sℋ ∧ (1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝐴) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴)
25	23, 24	mp3an1 1450	. . . . . . . . 9 ⊢ (((1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝐴) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴)
26	25	ex 412	. . . . . . . 8 ⊢ ((1 / (normℎ‘𝑥)) ∈ ℂ → (𝑥 ∈ 𝐴 → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴))
27	22, 26	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ∈ 𝐴 → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴))
28	8	recnd 11209	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ∈ ℂ)
29	9	chshii 31163	. . . . . . . . . . . 12 ⊢ 𝐵 ∈ Sℋ
30		shmulcl 31154	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ Sℋ ∧ (normℎ‘𝑥) ∈ ℂ ∧ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵)
31	29, 30	mp3an1 1450	. . . . . . . . . . 11 ⊢ (((normℎ‘𝑥) ∈ ℂ ∧ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵)
32	31	ex 412	. . . . . . . . . 10 ⊢ ((normℎ‘𝑥) ∈ ℂ → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵))
33	28, 32	syl 17	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵))
34	28, 20	recidd 11960	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) = 1)
35	34	oveq1d 7405	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = (1 ·ℎ 𝑥))
36	4, 6	syl 17	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ ℋ)
37		ax-hvmulass 30943	. . . . . . . . . . . 12 ⊢ (((normℎ‘𝑥) ∈ ℂ ∧ (1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ ℋ) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)))
38	28, 22, 36, 37	syl3anc 1373	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)))
39		ax-hvmulid 30942	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℋ → (1 ·ℎ 𝑥) = 𝑥)
40	4, 6, 39	3syl 18	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 ·ℎ 𝑥) = 𝑥)
41	35, 38, 40	3eqtr3d 2773	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 𝑥)
42	41	eleq1d 2814	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
43	33, 42	sylibd 239	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → 𝑥 ∈ 𝐵))
44	43	con3d 152	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (¬ 𝑥 ∈ 𝐵 → ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵))
45	27, 44	anim12d 609	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴 ∧ ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵)))
46		eldif 3927	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
47		eldif 3927	. . . . . 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 31076	. . . . . 6 ⊢ (((1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ ℋ) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)))
51	22, 36, 50	syl2anc 584	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)))
52	15	necon2ai 2955	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ≠ 0ℎ)
53		normgt0 31063	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℋ → (𝑥 ≠ 0ℎ ↔ 0 < (normℎ‘𝑥)))
54	4, 6, 53	3syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ≠ 0ℎ ↔ 0 < (normℎ‘𝑥)))
55	52, 54	mpbid 232	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 < (normℎ‘𝑥))
56		1re 11181	. . . . . . . . 9 ⊢ 1 ∈ ℝ
57		0le1 11708	. . . . . . . . 9 ⊢ 0 ≤ 1
58		divge0 12059	. . . . . . . . 9 ⊢ (((1 ∈ ℝ ∧ 0 ≤ 1) ∧ ((normℎ‘𝑥) ∈ ℝ ∧ 0 < (normℎ‘𝑥))) → 0 ≤ (1 / (normℎ‘𝑥)))
59	56, 57, 58	mpanl12 702	. . . . . . . 8 ⊢ (((normℎ‘𝑥) ∈ ℝ ∧ 0 < (normℎ‘𝑥)) → 0 ≤ (1 / (normℎ‘𝑥)))
60	8, 55, 59	syl2anc 584	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 ≤ (1 / (normℎ‘𝑥)))
61	21, 60	absidd 15396	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (abs‘(1 / (normℎ‘𝑥))) = (1 / (normℎ‘𝑥)))
62	61	oveq1d 7405	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)) = ((1 / (normℎ‘𝑥)) · (normℎ‘𝑥)))
63	28, 20	recid2d 11961	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (normℎ‘𝑥)) · (normℎ‘𝑥)) = 1)
64	51, 62, 63	3eqtrd 2769	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1)
65		fveqeq2 6870	. . . . 5 ⊢ (𝑢 = ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) → ((normℎ‘𝑢) = 1 ↔ (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1))
66	65	rspcev 3591	. . . 4 ⊢ ((((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵) ∧ (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
67	49, 64, 66	syl2anc 584	. . 3 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
68	67	exlimiv 1930	. 2 ⊢ (∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
69	3, 68	sylbi 217	1 ⊢ (¬ 𝐴 ⊆ 𝐵 → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109   ≠ wne 2926  ∃wrex 3054   ∖ cdif 3914   ⊆ wss 3917  ∅c0 4299   class class class wbr 5110  ‘cfv 6514  (class class class)co 7390  ℂcc 11073  ℝcr 11074  0cc0 11075  1c1 11076   · cmul 11080   < clt 11215   ≤ cle 11216   / cdiv 11842  abscabs 15207   ℋchba 30855   ·_ℎ csm 30857  norm_ℎcno 30859  0_ℎc0v 30860   S_ℋ csh 30864   C_ℋ cch 30865

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152  ax-pre-sup 11153  ax-hilex 30935  ax-hfvadd 30936  ax-hv0cl 30939  ax-hfvmul 30941  ax-hvmulid 30942  ax-hvmulass 30943  ax-hvmul0 30946  ax-hfi 31015  ax-his1 31018  ax-his3 31020  ax-his4 31021

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-er 8674  df-en 8922  df-dom 8923  df-sdom 8924  df-sup 9400  df-pnf 11217  df-mnf 11218  df-xr 11219  df-ltxr 11220  df-le 11221  df-sub 11414  df-neg 11415  df-div 11843  df-nn 12194  df-2 12256  df-3 12257  df-n0 12450  df-z 12537  df-uz 12801  df-rp 12959  df-seq 13974  df-exp 14034  df-cj 15072  df-re 15073  df-im 15074  df-sqrt 15208  df-abs 15209  df-hnorm 30904  df-sh 31143  df-ch 31157

This theorem is referenced by:  stri  32193  hstri  32201