Theorem strlem1 32321

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 4292	. . 3 ⊢ (¬ (𝐴 ∖ 𝐵) = ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
2		ssdif0 4306	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∖ 𝐵) = ∅)
3	1, 2	xchnxbir 333	. 2 ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
4		eldifi 4071	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ 𝐴)
5		strlem1.1	. . . . . . . . . . . 12 ⊢ 𝐴 ∈ Cℋ
6	5	cheli 31303	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ ℋ)
7		normcl 31196	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℋ → (normℎ‘𝑥) ∈ ℝ)
8	4, 6, 7	3syl 18	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ∈ ℝ)
9		strlem1.2	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 ∈ Cℋ
10		ch0 31299	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ Cℋ → 0ℎ ∈ 𝐵)
11	9, 10	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ 0ℎ ∈ 𝐵
12		eldifn 4072	. . . . . . . . . . . . . . 15 ⊢ (0ℎ ∈ (𝐴 ∖ 𝐵) → ¬ 0ℎ ∈ 𝐵)
13	11, 12	mt2 200	. . . . . . . . . . . . . 14 ⊢ ¬ 0ℎ ∈ (𝐴 ∖ 𝐵)
14		eleq1 2824	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 0ℎ → (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ 0ℎ ∈ (𝐴 ∖ 𝐵)))
15	13, 14	mtbiri 327	. . . . . . . . . . . . 13 ⊢ (𝑥 = 0ℎ → ¬ 𝑥 ∈ (𝐴 ∖ 𝐵))
16	15	con2i 139	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ¬ 𝑥 = 0ℎ)
17		norm-i 31200	. . . . . . . . . . . . 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 2939	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ≠ 0)
21	8, 20	rereccld 11982	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (normℎ‘𝑥)) ∈ ℝ)
22	21	recnd 11173	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (normℎ‘𝑥)) ∈ ℂ)
23	5	chshii 31298	. . . . . . . . . 10 ⊢ 𝐴 ∈ Sℋ
24		shmulcl 31289	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Sℋ ∧ (1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝐴) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴)
25	23, 24	mp3an1 1451	. . . . . . . . 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 11173	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ∈ ℂ)
29	9	chshii 31298	. . . . . . . . . . . 12 ⊢ 𝐵 ∈ Sℋ
30		shmulcl 31289	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ Sℋ ∧ (normℎ‘𝑥) ∈ ℂ ∧ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵)
31	29, 30	mp3an1 1451	. . . . . . . . . . 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 11926	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) = 1)
35	34	oveq1d 7382	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = (1 ·ℎ 𝑥))
36	4, 6	syl 17	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ ℋ)
37		ax-hvmulass 31078	. . . . . . . . . . . 12 ⊢ (((normℎ‘𝑥) ∈ ℂ ∧ (1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ ℋ) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)))
38	28, 22, 36, 37	syl3anc 1374	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)))
39		ax-hvmulid 31077	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℋ → (1 ·ℎ 𝑥) = 𝑥)
40	4, 6, 39	3syl 18	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 ·ℎ 𝑥) = 𝑥)
41	35, 38, 40	3eqtr3d 2779	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 𝑥)
42	41	eleq1d 2821	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
43	33, 42	sylibd 239	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → 𝑥 ∈ 𝐵))
44	43	con3d 152	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (¬ 𝑥 ∈ 𝐵 → ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵))
45	27, 44	anim12d 610	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴 ∧ ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵)))
46		eldif 3899	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
47		eldif 3899	. . . . . 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 31211	. . . . . 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 2961	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ≠ 0ℎ)
53		normgt0 31198	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℋ → (𝑥 ≠ 0ℎ ↔ 0 < (normℎ‘𝑥)))
54	4, 6, 53	3syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ≠ 0ℎ ↔ 0 < (normℎ‘𝑥)))
55	52, 54	mpbid 232	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 < (normℎ‘𝑥))
56		1re 11144	. . . . . . . . 9 ⊢ 1 ∈ ℝ
57		0le1 11673	. . . . . . . . 9 ⊢ 0 ≤ 1
58		divge0 12025	. . . . . . . . 9 ⊢ (((1 ∈ ℝ ∧ 0 ≤ 1) ∧ ((normℎ‘𝑥) ∈ ℝ ∧ 0 < (normℎ‘𝑥))) → 0 ≤ (1 / (normℎ‘𝑥)))
59	56, 57, 58	mpanl12 703	. . . . . . . 8 ⊢ (((normℎ‘𝑥) ∈ ℝ ∧ 0 < (normℎ‘𝑥)) → 0 ≤ (1 / (normℎ‘𝑥)))
60	8, 55, 59	syl2anc 585	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 ≤ (1 / (normℎ‘𝑥)))
61	21, 60	absidd 15385	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (abs‘(1 / (normℎ‘𝑥))) = (1 / (normℎ‘𝑥)))
62	61	oveq1d 7382	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)) = ((1 / (normℎ‘𝑥)) · (normℎ‘𝑥)))
63	28, 20	recid2d 11927	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (normℎ‘𝑥)) · (normℎ‘𝑥)) = 1)
64	51, 62, 63	3eqtrd 2775	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1)
65		fveqeq2 6849	. . . . 5 ⊢ (𝑢 = ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) → ((normℎ‘𝑢) = 1 ↔ (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1))
66	65	rspcev 3564	. . . 4 ⊢ ((((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵) ∧ (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
67	49, 64, 66	syl2anc 585	. . 3 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
68	67	exlimiv 1932	. 2 ⊢ (∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
69	3, 68	sylbi 217	1 ⊢ (¬ 𝐴 ⊆ 𝐵 → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2932  ∃wrex 3061   ∖ cdif 3886   ⊆ wss 3889  ∅c0 4273   class class class wbr 5085  ‘cfv 6498  (class class class)co 7367  ℂcc 11036  ℝcr 11037  0cc0 11038  1c1 11039   · cmul 11043   < clt 11179   ≤ cle 11180   / cdiv 11807  abscabs 15196   ℋchba 30990   ·_ℎ csm 30992  norm_ℎcno 30994  0_ℎc0v 30995   S_ℋ csh 30999   C_ℋ cch 31000

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116  ax-hilex 31070  ax-hfvadd 31071  ax-hv0cl 31074  ax-hfvmul 31076  ax-hvmulid 31077  ax-hvmulass 31078  ax-hvmul0 31081  ax-hfi 31150  ax-his1 31153  ax-his3 31155  ax-his4 31156

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-sup 9355  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-div 11808  df-nn 12175  df-2 12244  df-3 12245  df-n0 12438  df-z 12525  df-uz 12789  df-rp 12943  df-seq 13964  df-exp 14024  df-cj 15061  df-re 15062  df-im 15063  df-sqrt 15197  df-abs 15198  df-hnorm 31039  df-sh 31278  df-ch 31292

This theorem is referenced by:  stri  32328  hstri  32336