minvecolem5 - Metamath Proof Explorer

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

Theorem minvecolem5 31370

Description: Lemma for minveco 31373. Discharge the assumption about the sequence 𝐹 by applying countable choice ax-cc 10441. (Contributed by Mario Carneiro, 9-May-2014.) (Revised by AV, 4-Oct-2020.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
minveco.x	⊢ 𝑋 = (BaseSet‘𝑈)
minveco.m	⊢ 𝑀 = ( −_𝑣 ‘𝑈)
minveco.n	⊢ 𝑁 = (norm_CV‘𝑈)
minveco.y	⊢ 𝑌 = (BaseSet‘𝑊)
minveco.u	⊢ (𝜑 → 𝑈 ∈ CPreHil_OLD)
minveco.w	⊢ (𝜑 → 𝑊 ∈ ((SubSp‘𝑈) ∩ CBan))
minveco.a	⊢ (𝜑 → 𝐴 ∈ 𝑋)
minveco.d	⊢ 𝐷 = (IndMet‘𝑈)
minveco.j	⊢ 𝐽 = (MetOpen‘𝐷)
minveco.r	⊢ 𝑅 = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))
minveco.s	⊢ 𝑆 = inf(𝑅, ℝ, < )

**Assertion**
Ref	Expression
minvecolem5	⊢ (𝜑 → ∃𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑥)) ≤ (𝑁‘(𝐴𝑀𝑦)))

Distinct variable groups: 𝑥,𝑦,𝐽 𝑥,𝑀,𝑦 𝑥,𝑁,𝑦 𝜑,𝑥,𝑦 𝑥,𝑅 𝑥,𝑆,𝑦 𝑥,𝐴,𝑦 𝑥,𝐷,𝑦 𝑥,𝑈,𝑦 𝑥,𝑊,𝑦 𝑥,𝑋 𝑥,𝑌,𝑦 Allowed substitution hints: 𝑅(𝑦) 𝑋(𝑦)

Proof of Theorem minvecolem5 Dummy variables 𝑛 𝑘 𝑤 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nnrecgt0 12307	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → 0 < (1 / 𝑛))
2	1	adantl 487	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 < (1 / 𝑛))
3		nnrecre 12306	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ)
4	3	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℝ)
5		minveco.s	. . . . . . . . . . . . . 14 ⊢ 𝑆 = inf(𝑅, ℝ, < )
6		minveco.x	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑋 = (BaseSet‘𝑈)
7		minveco.m	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑀 = ( −_𝑣 ‘𝑈)
8		minveco.n	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑁 = (norm_CV‘𝑈)
9		minveco.y	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑌 = (BaseSet‘𝑊)
10		minveco.u	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑈 ∈ CPreHil_OLD)
11		minveco.w	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑊 ∈ ((SubSp‘𝑈) ∩ CBan))
12		minveco.a	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
13		minveco.d	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐷 = (IndMet‘𝑈)
14		minveco.j	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐽 = (MetOpen‘𝐷)
15		minveco.r	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑅 = ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))
16	6, 7, 8, 9, 10, 11, 12, 13, 14, 15	minvecolem1 31363	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
17	16	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
18	17	simp1d 1160	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑅 ⊆ ℝ)
19	17	simp2d 1161	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑅 ≠ ∅)
20		0re 11238	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℝ
21	17	simp3d 1162	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)
22		breq1 5110	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 0 → (𝑥 ≤ 𝑤 ↔ 0 ≤ 𝑤))
23	22	ralbidv 3187	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 0 → (∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤 ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
24	23	rspcev 3579	. . . . . . . . . . . . . . . 16 ⊢ ((0 ∈ ℝ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤)
25	20, 21, 24	sylancr 599	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤)
26		infrecl 12225	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) → inf(𝑅, ℝ, < ) ∈ ℝ)
27	18, 19, 25, 26	syl3anc 1398	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → inf(𝑅, ℝ, < ) ∈ ℝ)
28	5, 27	eqeltrid 2866	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑆 ∈ ℝ)
29	28	resqcld 14193	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆↑2) ∈ ℝ)
30	4, 29	ltaddposd 11826	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (0 < (1 / 𝑛) ↔ (𝑆↑2) < ((𝑆↑2) + (1 / 𝑛))))
31	2, 30	mpbid 235	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆↑2) < ((𝑆↑2) + (1 / 𝑛)))
32	29, 4	readdcld 11266	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑆↑2) + (1 / 𝑛)) ∈ ℝ)
33	28	sqge0d 14205	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ (𝑆↑2))
34	29, 4, 33, 2	addgegt0d 11815	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 < ((𝑆↑2) + (1 / 𝑛)))
35	32, 34	elrpd 13087	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑆↑2) + (1 / 𝑛)) ∈ ℝ⁺)
36	35	rpge0d 13094	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ ((𝑆↑2) + (1 / 𝑛)))
37		resqrtth 15346	. . . . . . . . . . 11 ⊢ ((((𝑆↑2) + (1 / 𝑛)) ∈ ℝ ∧ 0 ≤ ((𝑆↑2) + (1 / 𝑛))) → ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) = ((𝑆↑2) + (1 / 𝑛)))
38	32, 36, 37	syl2anc 596	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) = ((𝑆↑2) + (1 / 𝑛)))
39	31, 38	breqtrrd 5137	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆↑2) < ((√‘((𝑆↑2) + (1 / 𝑛)))↑2))
40	35	rpsqrtcld 15503	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ⁺)
41	40	rpred 13090	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ)
42		0red 11239	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ∈ ℝ)
43		infregelb 12227	. . . . . . . . . . . . 13 ⊢ (((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) ∧ 0 ∈ ℝ) → (0 ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
44	18, 19, 25, 42, 43	syl31anc 1400	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (0 ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
45	21, 44	mpbird 260	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ inf(𝑅, ℝ, < ))
46	45, 5	breqtrrdi 5151	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ 𝑆)
47	32, 36	sqrtge0d 15512	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ (√‘((𝑆↑2) + (1 / 𝑛))))
48	28, 41, 46, 47	lt2sqd 14324	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆 < (√‘((𝑆↑2) + (1 / 𝑛))) ↔ (𝑆↑2) < ((√‘((𝑆↑2) + (1 / 𝑛)))↑2)))
49	39, 48	mpbird 260	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑆 < (√‘((𝑆↑2) + (1 / 𝑛))))
50	28, 41	ltnled 11385	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆 < (√‘((𝑆↑2) + (1 / 𝑛))) ↔ ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆))
51	49, 50	mpbid 235	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆)
52	5	breq2i 5115	. . . . . . . . 9 ⊢ ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆 ↔ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ inf(𝑅, ℝ, < ))
53		infregelb 12227	. . . . . . . . . 10 ⊢ (((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) ∧ (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤))
54	18, 19, 25, 41, 53	syl31anc 1400	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤))
55	52, 54	bitrid 286	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆 ↔ ∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤))
56	15	raleqi 3319	. . . . . . . . 9 ⊢ (∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))(√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤)
57		fvex 6895	. . . . . . . . . . 11 ⊢ (𝑁‘(𝐴𝑀𝑦)) ∈ V
58	57	rgenw 3082	. . . . . . . . . 10 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑦)) ∈ V
59		eqid 2762	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))
60		breq2 5111	. . . . . . . . . . 11 ⊢ (𝑤 = (𝑁‘(𝐴𝑀𝑦)) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦))))
61	59, 60	ralrnmptw 7091	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑦)) ∈ V → (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))(√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦))))
62	58, 61	ax-mp 5	. . . . . . . . 9 ⊢ (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))(√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
63	56, 62	bitri 278	. . . . . . . 8 ⊢ (∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
64	55, 63	bitrdi 290	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆 ↔ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦))))
65	51, 64	mtbid 327	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
66		rexnal 3116	. . . . . 6 ⊢ (∃𝑦 ∈ 𝑌 ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ¬ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
67	65, 66	sylibr 237	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑦 ∈ 𝑌 ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
68	32	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((𝑆↑2) + (1 / 𝑛)) ∈ ℝ)
69		phnv 31303	. . . . . . . . . . . . 13 ⊢ (𝑈 ∈ CPreHil_OLD → 𝑈 ∈ NrmCVec)
70	10, 69	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑈 ∈ NrmCVec)
71	70	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ NrmCVec)
72	12	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋)
73		inss1 4185	. . . . . . . . . . . . . . . 16 ⊢ ((SubSp‘𝑈) ∩ CBan) ⊆ (SubSp‘𝑈)
74	73, 11	sselid 3932	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑊 ∈ (SubSp‘𝑈))
75		eqid 2762	. . . . . . . . . . . . . . . 16 ⊢ (SubSp‘𝑈) = (SubSp‘𝑈)
76	6, 9, 75	sspba 31216	. . . . . . . . . . . . . . 15 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ (SubSp‘𝑈)) → 𝑌 ⊆ 𝑋)
77	70, 74, 76	syl2anc 596	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
78	77	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑌 ⊆ 𝑋)
79	78	sselda 3934	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋)
80	6, 7	nvmcl 31135	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴𝑀𝑦) ∈ 𝑋)
81	71, 72, 79, 80	syl3anc 1398	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (𝐴𝑀𝑦) ∈ 𝑋)
82	6, 8	nvcl 31150	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑀𝑦) ∈ 𝑋) → (𝑁‘(𝐴𝑀𝑦)) ∈ ℝ)
83	71, 81, 82	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴𝑀𝑦)) ∈ ℝ)
84	83	resqcld 14193	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((𝑁‘(𝐴𝑀𝑦))↑2) ∈ ℝ)
85	68, 84	letrid 11390	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2) ∨ ((𝑁‘(𝐴𝑀𝑦))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
86	85	ord 878	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (¬ ((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2) → ((𝑁‘(𝐴𝑀𝑦))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
87	41	adantr 486	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ)
88	47	adantr 486	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 0 ≤ (√‘((𝑆↑2) + (1 / 𝑛))))
89	6, 8	nvge0 31162	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑀𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
90	71, 81, 89	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
91	87, 83, 88, 90	le2sqd 14325	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2)))
92	38	adantr 486	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) = ((𝑆↑2) + (1 / 𝑛)))
93	92	breq1d 5117	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (((√‘((𝑆↑2) + (1 / 𝑛)))↑2) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2) ↔ ((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2)))
94	91, 93	bitrd 282	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2)))
95	94	notbid 321	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ¬ ((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2)))
96	6, 7, 8, 13	imsdval 31175	. . . . . . . . . 10 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴𝐷𝑦) = (𝑁‘(𝐴𝑀𝑦)))
97	71, 72, 79, 96	syl3anc 1398	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (𝐴𝐷𝑦) = (𝑁‘(𝐴𝑀𝑦)))
98	97	oveq1d 7432	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((𝐴𝐷𝑦)↑2) = ((𝑁‘(𝐴𝑀𝑦))↑2))
99	98	breq1d 5117	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ↔ ((𝑁‘(𝐴𝑀𝑦))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
100	86, 95, 99	3imtr4d 297	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) → ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
101	100	reximdva 3177	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∃𝑦 ∈ 𝑌 ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) → ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
102	67, 101	mpd 16	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))
103	102	ralrimiva 3156	. . 3 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))
104	9	fvexi 6896	. . . 4 ⊢ 𝑌 ∈ V
105		nnenom 14048	. . . 4 ⊢ ℕ ≈ ω
106		oveq2 7425	. . . . . 6 ⊢ (𝑦 = (𝑓‘𝑛) → (𝐴𝐷𝑦) = (𝐴𝐷(𝑓‘𝑛)))
107	106	oveq1d 7432	. . . . 5 ⊢ (𝑦 = (𝑓‘𝑛) → ((𝐴𝐷𝑦)↑2) = ((𝐴𝐷(𝑓‘𝑛))↑2))
108	107	breq1d 5117	. . . 4 ⊢ (𝑦 = (𝑓‘𝑛) → (((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ↔ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
109	104, 105, 108	axcc4 10445	. . 3 ⊢ (∀𝑛 ∈ ℕ ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) → ∃𝑓(𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
110	103, 109	syl 18	. 2 ⊢ (𝜑 → ∃𝑓(𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
111	10	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → 𝑈 ∈ CPreHil_OLD)
112	11	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → 𝑊 ∈ ((SubSp‘𝑈) ∩ CBan))
113	12	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → 𝐴 ∈ 𝑋)
114		simprl 783	. . 3 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → 𝑓:ℕ⟶𝑌)
115		simprr 785	. . . 4 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))
116		fveq2 6882	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝑓‘𝑛) = (𝑓‘𝑘))
117	116	oveq2d 7433	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (𝐴𝐷(𝑓‘𝑛)) = (𝐴𝐷(𝑓‘𝑘)))
118	117	oveq1d 7432	. . . . . 6 ⊢ (𝑛 = 𝑘 → ((𝐴𝐷(𝑓‘𝑛))↑2) = ((𝐴𝐷(𝑓‘𝑘))↑2))
119		oveq2 7425	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (1 / 𝑛) = (1 / 𝑘))
120	119	oveq2d 7433	. . . . . 6 ⊢ (𝑛 = 𝑘 → ((𝑆↑2) + (1 / 𝑛)) = ((𝑆↑2) + (1 / 𝑘)))
121	118, 120	breq12d 5120	. . . . 5 ⊢ (𝑛 = 𝑘 → (((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ↔ ((𝐴𝐷(𝑓‘𝑘))↑2) ≤ ((𝑆↑2) + (1 / 𝑘))))
122	121	rspccva 3578	. . . 4 ⊢ ((∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ∧ 𝑘 ∈ ℕ) → ((𝐴𝐷(𝑓‘𝑘))↑2) ≤ ((𝑆↑2) + (1 / 𝑘)))
123	115, 122	sylan 592	. . 3 ⊢ (((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) ∧ 𝑘 ∈ ℕ) → ((𝐴𝐷(𝑓‘𝑘))↑2) ≤ ((𝑆↑2) + (1 / 𝑘)))
124		eqid 2762	. . 3 ⊢ (1 / (((((𝐴𝐷((⇝_𝑡‘𝐽)‘𝑓)) + 𝑆) / 2)↑2) − (𝑆↑2))) = (1 / (((((𝐴𝐷((⇝_𝑡‘𝐽)‘𝑓)) + 𝑆) / 2)↑2) − (𝑆↑2)))
125	6, 7, 8, 9, 111, 112, 113, 13, 14, 15, 5, 114, 123, 124	minvecolem4 31369	. 2 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → ∃𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑥)) ≤ (𝑁‘(𝐴𝑀𝑦)))
126	110, 125	exlimddv 1968	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑥)) ≤ (𝑁‘(𝐴𝑀𝑦)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ≠ wne 2957 ∀wral 3078 ∃wrex 3088 Vcvv 3453 ∩ cin 3901 ⊆ wss 3902 ∅c0 4282 class class class wbr 5107 ↦ cmpt 5190 ran crn 5660 ⟶wf 6533 ‘cfv 6537 (class class class)co 7417 infcinf 9415 ℝcr 11127 0cc0 11128 1c1 11129 + caddc 11131 < clt 11271 ≤ cle 11272 − cmin 11469 / cdiv 11899 ℕcn 12261 2c2 12323 ↑cexp 14129 √csqrt 15324 MetOpencmopn 21581 ⇝_𝑡clm 23457 NrmCVeccnv 31073 BaseSetcba 31075 −_𝑣 cnsb 31078 norm_CVcnmcv 31079 IndMetcims 31080 SubSpcss 31210 CPreHil_OLDccphlo 31301 CBanccbn 31351

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-inf2 9624 ax-cc 10441 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 ax-pre-sup 11206 ax-addf 11207 ax-mulf 11208

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 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 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-map 8832 df-pm 8833 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-fi 9385 df-sup 9416 df-inf 9417 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-div 11900 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-n0 12533 df-z 12620 df-uz 12892 df-q 13002 df-rp 13047 df-xneg 13167 df-xadd 13168 df-xmul 13169 df-ico 13408 df-icc 13409 df-fl 13857 df-seq 14070 df-exp 14130 df-cj 15190 df-re 15191 df-im 15192 df-sqrt 15326 df-abs 15327 df-rest 17513 df-topgen 17534 df-psmet 21583 df-xmet 21584 df-met 21585 df-bl 21586 df-mopn 21587 df-fbas 21588 df-fg 21589 df-top 23125 df-topon 23142 df-bases 23177 df-cld 23250 df-ntr 23251 df-cls 23252 df-nei 23329 df-lm 23460 df-haus 23546 df-fil 24078 df-fm 24170 df-flim 24171 df-flf 24172 df-cfil 25489 df-cau 25490 df-cmet 25491 df-grpo 30982 df-gid 30983 df-ginv 30984 df-gdiv 30985 df-ablo 31034 df-vc 31048 df-nv 31081 df-va 31084 df-ba 31085 df-sm 31086 df-0v 31087 df-vs 31088 df-nmcv 31089 df-ims 31090 df-ssp 31211 df-ph 31302 df-cbn 31352

This theorem is used by: minvecolem7 31372

W3C validator