pjthlem2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > pjthlem2		Structured version Visualization version GIF version

Theorem pjthlem2 25487

Description: Lemma for pjth 25488. (Contributed by NM, 10-Oct-1999.) (Revised by Mario Carneiro, 15-May-2014.)

**Hypotheses**
Ref	Expression
pjthlem.v	⊢ 𝑉 = (Base‘𝑊)
pjthlem.n	⊢ 𝑁 = (norm‘𝑊)
pjthlem.p	⊢ + = (+_g‘𝑊)
pjthlem.m	⊢ − = (-_g‘𝑊)
pjthlem.h	⊢ , = (·_𝑖‘𝑊)
pjthlem.l	⊢ 𝐿 = (LSubSp‘𝑊)
pjthlem.1	⊢ (𝜑 → 𝑊 ∈ ℂHil)
pjthlem.2	⊢ (𝜑 → 𝑈 ∈ 𝐿)
pjthlem.4	⊢ (𝜑 → 𝐴 ∈ 𝑉)
pjthlem.j	⊢ 𝐽 = (TopOpen‘𝑊)
pjthlem.s	⊢ ⊕ = (LSSum‘𝑊)
pjthlem.o	⊢ 𝑂 = (ocv‘𝑊)
pjthlem.3	⊢ (𝜑 → 𝑈 ∈ (Clsd‘𝐽))

**Assertion**
Ref	Expression
pjthlem2	⊢ (𝜑 → 𝐴 ∈ (𝑈 ⊕ (𝑂‘𝑈)))

Proof of Theorem pjthlem2 Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pjthlem.v	. . . 4 ⊢ 𝑉 = (Base‘𝑊)
2		pjthlem.m	. . . 4 ⊢ − = (-_g‘𝑊)
3		pjthlem.n	. . . 4 ⊢ 𝑁 = (norm‘𝑊)
4		pjthlem.1	. . . . 5 ⊢ (𝜑 → 𝑊 ∈ ℂHil)
5		hlcph 25413	. . . . 5 ⊢ (𝑊 ∈ ℂHil → 𝑊 ∈ ℂPreHil)
6	4, 5	syl 17	. . . 4 ⊢ (𝜑 → 𝑊 ∈ ℂPreHil)
7		pjthlem.2	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐿)
8		pjthlem.l	. . . . 5 ⊢ 𝐿 = (LSubSp‘𝑊)
9	7, 8	eleqtrdi 2871	. . . 4 ⊢ (𝜑 → 𝑈 ∈ (LSubSp‘𝑊))
10		pjthlem.3	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ (Clsd‘𝐽))
11		hlcms 25415	. . . . . . 7 ⊢ (𝑊 ∈ ℂHil → 𝑊 ∈ CMetSp)
12	4, 11	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ CMetSp)
13	1, 8	lssss 20990	. . . . . . 7 ⊢ (𝑈 ∈ 𝐿 → 𝑈 ⊆ 𝑉)
14	7, 13	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑈 ⊆ 𝑉)
15		eqid 2761	. . . . . . 7 ⊢ (𝑊 ↾_s 𝑈) = (𝑊 ↾_s 𝑈)
16		pjthlem.j	. . . . . . 7 ⊢ 𝐽 = (TopOpen‘𝑊)
17	15, 1, 16	cmsss 25400	. . . . . 6 ⊢ ((𝑊 ∈ CMetSp ∧ 𝑈 ⊆ 𝑉) → ((𝑊 ↾_s 𝑈) ∈ CMetSp ↔ 𝑈 ∈ (Clsd‘𝐽)))
18	12, 14, 17	syl2anc 593	. . . . 5 ⊢ (𝜑 → ((𝑊 ↾_s 𝑈) ∈ CMetSp ↔ 𝑈 ∈ (Clsd‘𝐽)))
19	10, 18	mpbird 259	. . . 4 ⊢ (𝜑 → (𝑊 ↾_s 𝑈) ∈ CMetSp)
20		pjthlem.4	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
21	1, 2, 3, 6, 9, 19, 20	minvec 25485	. . 3 ⊢ (𝜑 → ∃!𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))
22		reurex 3370	. . 3 ⊢ (∃!𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)) → ∃𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))
23	21, 22	syl 17	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))
24	6	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑊 ∈ ℂPreHil)
25		cphlmod 25223	. . . . . 6 ⊢ (𝑊 ∈ ℂPreHil → 𝑊 ∈ LMod)
26	24, 25	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑊 ∈ LMod)
27		lmodabl 20963	. . . . 5 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel)
28	26, 27	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑊 ∈ Abel)
29	7	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑈 ∈ 𝐿)
30	29, 13	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑈 ⊆ 𝑉)
31		simprl 780	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑥 ∈ 𝑈)
32	30, 31	sseldd 3935	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑥 ∈ 𝑉)
33	20	adantr 484	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝐴 ∈ 𝑉)
34		pjthlem.p	. . . . 5 ⊢ + = (+_g‘𝑊)
35	1, 34, 2	ablpncan3 19846	. . . 4 ⊢ ((𝑊 ∈ Abel ∧ (𝑥 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉)) → (𝑥 + (𝐴 − 𝑥)) = 𝐴)
36	28, 32, 33, 35	syl12anc 847	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → (𝑥 + (𝐴 − 𝑥)) = 𝐴)
37	8	lsssssubg 21012	. . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐿 ⊆ (SubGrp‘𝑊))
38	26, 37	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝐿 ⊆ (SubGrp‘𝑊))
39	38, 29	sseldd 3935	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑈 ∈ (SubGrp‘𝑊))
40		cphphl 25220	. . . . . . 7 ⊢ (𝑊 ∈ ℂPreHil → 𝑊 ∈ PreHil)
41	24, 40	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑊 ∈ PreHil)
42		pjthlem.o	. . . . . . 7 ⊢ 𝑂 = (ocv‘𝑊)
43	1, 42, 8	ocvlss 21711	. . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ⊆ 𝑉) → (𝑂‘𝑈) ∈ 𝐿)
44	41, 30, 43	syl2anc 593	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → (𝑂‘𝑈) ∈ 𝐿)
45	38, 44	sseldd 3935	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → (𝑂‘𝑈) ∈ (SubGrp‘𝑊))
46	1, 2	lmodvsubcl 20961	. . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝑉) → (𝐴 − 𝑥) ∈ 𝑉)
47	26, 33, 32, 46	syl3anc 1389	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → (𝐴 − 𝑥) ∈ 𝑉)
48		pjthlem.h	. . . . . . . 8 ⊢ , = (·_𝑖‘𝑊)
49	4	ad2antrr 736	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → 𝑊 ∈ ℂHil)
50	29	adantr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → 𝑈 ∈ 𝐿)
51	47	adantr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → (𝐴 − 𝑥) ∈ 𝑉)
52		simpr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → 𝑧 ∈ 𝑈)
53		oveq2 7398	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑤 + 𝑥) → (𝐴 − 𝑦) = (𝐴 − (𝑤 + 𝑥)))
54	53	fveq2d 6865	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑤 + 𝑥) → (𝑁‘(𝐴 − 𝑦)) = (𝑁‘(𝐴 − (𝑤 + 𝑥))))
55	54	breq2d 5109	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑤 + 𝑥) → ((𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)) ↔ (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − (𝑤 + 𝑥)))))
56		simplrr 787	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))
57	26	adantr 484	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → 𝑊 ∈ LMod)
58	29	adantr 484	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → 𝑈 ∈ 𝐿)
59		simpr 488	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → 𝑤 ∈ 𝑈)
60	31	adantr 484	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → 𝑥 ∈ 𝑈)
61	34, 8	lssvacl 20997	. . . . . . . . . . . . 13 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝐿) ∧ (𝑤 ∈ 𝑈 ∧ 𝑥 ∈ 𝑈)) → (𝑤 + 𝑥) ∈ 𝑈)
62	57, 58, 59, 60, 61	syl22anc 849	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → (𝑤 + 𝑥) ∈ 𝑈)
63	55, 56, 62	rspcdva 3581	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − (𝑤 + 𝑥))))
64		lmodgrp 20921	. . . . . . . . . . . . . . 15 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp)
65	26, 64	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝑊 ∈ Grp)
66	65	adantr 484	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → 𝑊 ∈ Grp)
67	33	adantr 484	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → 𝐴 ∈ 𝑉)
68	32	adantr 484	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → 𝑥 ∈ 𝑉)
69	30	sselda 3934	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → 𝑤 ∈ 𝑉)
70	1, 34, 2	grpsubsub4 19065	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ Grp ∧ (𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉)) → ((𝐴 − 𝑥) − 𝑤) = (𝐴 − (𝑤 + 𝑥)))
71	66, 67, 68, 69, 70	syl13anc 1390	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → ((𝐴 − 𝑥) − 𝑤) = (𝐴 − (𝑤 + 𝑥)))
72	71	fveq2d 6865	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → (𝑁‘((𝐴 − 𝑥) − 𝑤)) = (𝑁‘(𝐴 − (𝑤 + 𝑥))))
73	63, 72	breqtrrd 5125	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑤 ∈ 𝑈) → (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘((𝐴 − 𝑥) − 𝑤)))
74	73	ralrimiva 3153	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → ∀𝑤 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘((𝐴 − 𝑥) − 𝑤)))
75	74	adantr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → ∀𝑤 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘((𝐴 − 𝑥) − 𝑤)))
76		eqid 2761	. . . . . . . 8 ⊢ (((𝐴 − 𝑥) , 𝑧) / ((𝑧 , 𝑧) + 1)) = (((𝐴 − 𝑥) , 𝑧) / ((𝑧 , 𝑧) + 1))
77	1, 3, 34, 2, 48, 8, 49, 50, 51, 52, 75, 76	pjthlem1 25486	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → ((𝐴 − 𝑥) , 𝑧) = 0)
78	24	adantr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → 𝑊 ∈ ℂPreHil)
79		cphclm 25238	. . . . . . . . 9 ⊢ (𝑊 ∈ ℂPreHil → 𝑊 ∈ ℂMod)
80	78, 79	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → 𝑊 ∈ ℂMod)
81		eqid 2761	. . . . . . . . 9 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
82	81	clm0 25121	. . . . . . . 8 ⊢ (𝑊 ∈ ℂMod → 0 = (0_g‘(Scalar‘𝑊)))
83	80, 82	syl 17	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → 0 = (0_g‘(Scalar‘𝑊)))
84	77, 83	eqtrd 2796	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) ∧ 𝑧 ∈ 𝑈) → ((𝐴 − 𝑥) , 𝑧) = (0_g‘(Scalar‘𝑊)))
85	84	ralrimiva 3153	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → ∀𝑧 ∈ 𝑈 ((𝐴 − 𝑥) , 𝑧) = (0_g‘(Scalar‘𝑊)))
86		eqid 2761	. . . . . 6 ⊢ (0_g‘(Scalar‘𝑊)) = (0_g‘(Scalar‘𝑊))
87	1, 48, 81, 86, 42	elocv 21707	. . . . 5 ⊢ ((𝐴 − 𝑥) ∈ (𝑂‘𝑈) ↔ (𝑈 ⊆ 𝑉 ∧ (𝐴 − 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑈 ((𝐴 − 𝑥) , 𝑧) = (0_g‘(Scalar‘𝑊))))
88	30, 47, 85, 87	syl3anbrc 1356	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → (𝐴 − 𝑥) ∈ (𝑂‘𝑈))
89		pjthlem.s	. . . . 5 ⊢ ⊕ = (LSSum‘𝑊)
90	34, 89	lsmelvali 19680	. . . 4 ⊢ (((𝑈 ∈ (SubGrp‘𝑊) ∧ (𝑂‘𝑈) ∈ (SubGrp‘𝑊)) ∧ (𝑥 ∈ 𝑈 ∧ (𝐴 − 𝑥) ∈ (𝑂‘𝑈))) → (𝑥 + (𝐴 − 𝑥)) ∈ (𝑈 ⊕ (𝑂‘𝑈)))
91	39, 45, 31, 88, 90	syl22anc 849	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → (𝑥 + (𝐴 − 𝑥)) ∈ (𝑈 ⊕ (𝑂‘𝑈)))
92	36, 91	eqeltrrd 2862	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ ∀𝑦 ∈ 𝑈 (𝑁‘(𝐴 − 𝑥)) ≤ (𝑁‘(𝐴 − 𝑦)))) → 𝐴 ∈ (𝑈 ⊕ (𝑂‘𝑈)))
93	23, 92	rexlimddv 3168	1 ⊢ (𝜑 → 𝐴 ∈ (𝑈 ⊕ (𝑂‘𝑈)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∀wral 3075 ∃wrex 3085 ∃!wreu 3364 ⊆ wss 3902 class class class wbr 5097 ‘cfv 6515 (class class class)co 7390 0cc0 11066 1c1 11067 + caddc 11069 ≤ cle 11210 / cdiv 11837 Basecbs 17235 ↾_s cress 17256 +_gcplusg 17276 Scalarcsca 17279 ·_𝑖cip 17281 TopOpenctopn 17440 0_gc0g 17458 Grpcgrp 18965 -_gcsg 18967 SubGrpcsubg 19152 LSSumclsm 19664 Abelcabl 19811 LModclmod 20914 LSubSpclss 20985 PreHilcphl 21663 ocvcocv 21699 Clsdccld 23063 normcnm 24623 ℂModcclm 25111 ℂPreHilccph 25215 CMetSpccms 25381 ℂHilchl 25383

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7712 ax-cnex 11122 ax-resscn 11123 ax-1cn 11124 ax-icn 11125 ax-addcl 11126 ax-addrcl 11127 ax-mulcl 11128 ax-mulrcl 11129 ax-mulcom 11130 ax-addass 11131 ax-mulass 11132 ax-distr 11133 ax-i2m1 11134 ax-1ne0 11135 ax-1rid 11136 ax-rnegex 11137 ax-rrecex 11138 ax-cnre 11139 ax-pre-lttri 11140 ax-pre-lttrn 11141 ax-pre-ltadd 11142 ax-pre-mulgt0 11143 ax-pre-sup 11144 ax-addf 11145 ax-mulf 11146

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-iin 4949 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-se 5597 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-isom 6524 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-of 7654 df-om 7841 df-1st 7964 df-2nd 7965 df-supp 8134 df-tpos 8199 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-2o 8431 df-er 8671 df-map 8803 df-ixp 8873 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-fsupp 9301 df-fi 9350 df-sup 9381 df-inf 9382 df-oi 9451 df-card 9890 df-pnf 11211 df-mnf 11212 df-xr 11213 df-ltxr 11214 df-le 11215 df-sub 11409 df-neg 11410 df-div 11838 df-nn 12204 df-2 12273 df-3 12274 df-4 12275 df-5 12276 df-6 12277 df-7 12278 df-8 12279 df-9 12280 df-n0 12475 df-z 12562 df-dec 12682 df-uz 12833 df-q 12943 df-rp 12987 df-xneg 13107 df-xadd 13108 df-xmul 13109 df-ioo 13346 df-ico 13348 df-icc 13349 df-fz 13506 df-fzo 13653 df-seq 14008 df-exp 14068 df-hash 14337 df-cj 15116 df-re 15117 df-im 15118 df-sqrt 15252 df-abs 15253 df-struct 17173 df-sets 17190 df-slot 17208 df-ndx 17220 df-base 17236 df-ress 17257 df-plusg 17289 df-mulr 17290 df-starv 17291 df-sca 17292 df-vsca 17293 df-ip 17294 df-tset 17295 df-ple 17296 df-ds 17298 df-unif 17299 df-hom 17300 df-cco 17301 df-rest 17441 df-topn 17442 df-0g 17460 df-gsum 17461 df-topgen 17462 df-pt 17463 df-prds 17466 df-xrs 17522 df-qtop 17527 df-imas 17528 df-xps 17530 df-mre 17604 df-mrc 17605 df-acs 17607 df-mgm 18664 df-sgrp 18743 df-mnd 18759 df-mhm 18807 df-submnd 18808 df-grp 18968 df-minusg 18969 df-sbg 18970 df-mulg 19100 df-subg 19155 df-ghm 19244 df-cntz 19347 df-lsm 19666 df-cmn 19812 df-abl 19813 df-mgp 20177 df-rng 20189 df-ur 20218 df-ring 20271 df-cring 20272 df-oppr 20372 df-dvdsr 20392 df-unit 20393 df-invr 20423 df-dvr 20436 df-rhm 20507 df-subrng 20582 df-subrg 20606 df-drng 20767 df-staf 20875 df-srng 20876 df-lmod 20916 df-lss 20986 df-lmhm 21076 df-lvec 21157 df-sra 21227 df-rgmod 21228 df-psmet 21403 df-xmet 21404 df-met 21405 df-bl 21406 df-mopn 21407 df-fbas 21408 df-fg 21409 df-cnfld 21412 df-phl 21665 df-ocv 21702 df-top 22941 df-topon 22958 df-topsp 22980 df-bases 22993 df-cld 23066 df-ntr 23067 df-cls 23068 df-nei 23145 df-cn 23274 df-cnp 23275 df-haus 23362 df-cmp 23434 df-tx 23609 df-hmeo 23802 df-fil 23893 df-flim 23986 df-fcls 23988 df-xms 24367 df-ms 24368 df-tms 24369 df-nm 24629 df-ngp 24630 df-nlm 24633 df-cncf 24927 df-clm 25112 df-cph 25217 df-cfil 25304 df-cmet 25306 df-cms 25384 df-bn 25385 df-hl 25386

This theorem is referenced by: pjth 25488

W3C validator