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 30952

Description: Lemma for minveco 30955. Discharge the assumption about the sequence 𝐹 by applying countable choice ax-cc 10357. (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 12220	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → 0 < (1 / 𝑛))
2	1	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 < (1 / 𝑛))
3		nnrecre 12219	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ)
4	3	adantl 481	. . . . . . . . . . . 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 30945	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
17	16	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
18	17	simp1d 1143	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑅 ⊆ ℝ)
19	17	simp2d 1144	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑅 ≠ ∅)
20		0re 11146	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℝ
21	17	simp3d 1145	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)
22		breq1 5088	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 0 → (𝑥 ≤ 𝑤 ↔ 0 ≤ 𝑤))
23	22	ralbidv 3160	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 0 → (∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤 ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
24	23	rspcev 3564	. . . . . . . . . . . . . . . 16 ⊢ ((0 ∈ ℝ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤)
25	20, 21, 24	sylancr 588	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤)
26		infrecl 12138	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) → inf(𝑅, ℝ, < ) ∈ ℝ)
27	18, 19, 25, 26	syl3anc 1374	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → inf(𝑅, ℝ, < ) ∈ ℝ)
28	5, 27	eqeltrid 2840	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑆 ∈ ℝ)
29	28	resqcld 14087	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆↑2) ∈ ℝ)
30	4, 29	ltaddposd 11734	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (0 < (1 / 𝑛) ↔ (𝑆↑2) < ((𝑆↑2) + (1 / 𝑛))))
31	2, 30	mpbid 232	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆↑2) < ((𝑆↑2) + (1 / 𝑛)))
32	29, 4	readdcld 11174	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑆↑2) + (1 / 𝑛)) ∈ ℝ)
33	28	sqge0d 14099	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ (𝑆↑2))
34	29, 4, 33, 2	addgegt0d 11723	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 < ((𝑆↑2) + (1 / 𝑛)))
35	32, 34	elrpd 12983	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑆↑2) + (1 / 𝑛)) ∈ ℝ⁺)
36	35	rpge0d 12990	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ ((𝑆↑2) + (1 / 𝑛)))
37		resqrtth 15217	. . . . . . . . . . 11 ⊢ ((((𝑆↑2) + (1 / 𝑛)) ∈ ℝ ∧ 0 ≤ ((𝑆↑2) + (1 / 𝑛))) → ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) = ((𝑆↑2) + (1 / 𝑛)))
38	32, 36, 37	syl2anc 585	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) = ((𝑆↑2) + (1 / 𝑛)))
39	31, 38	breqtrrd 5113	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆↑2) < ((√‘((𝑆↑2) + (1 / 𝑛)))↑2))
40	35	rpsqrtcld 15374	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ⁺)
41	40	rpred 12986	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ)
42		0red 11147	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ∈ ℝ)
43		infregelb 12140	. . . . . . . . . . . . 13 ⊢ (((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) ∧ 0 ∈ ℝ) → (0 ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
44	18, 19, 25, 42, 43	syl31anc 1376	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (0 ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
45	21, 44	mpbird 257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ inf(𝑅, ℝ, < ))
46	45, 5	breqtrrdi 5127	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ 𝑆)
47	32, 36	sqrtge0d 15383	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ (√‘((𝑆↑2) + (1 / 𝑛))))
48	28, 41, 46, 47	lt2sqd 14218	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆 < (√‘((𝑆↑2) + (1 / 𝑛))) ↔ (𝑆↑2) < ((√‘((𝑆↑2) + (1 / 𝑛)))↑2)))
49	39, 48	mpbird 257	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑆 < (√‘((𝑆↑2) + (1 / 𝑛))))
50	28, 41	ltnled 11293	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆 < (√‘((𝑆↑2) + (1 / 𝑛))) ↔ ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆))
51	49, 50	mpbid 232	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆)
52	5	breq2i 5093	. . . . . . . . 9 ⊢ ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆 ↔ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ inf(𝑅, ℝ, < ))
53		infregelb 12140	. . . . . . . . . 10 ⊢ (((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) ∧ (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤))
54	18, 19, 25, 41, 53	syl31anc 1376	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤))
55	52, 54	bitrid 283	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆 ↔ ∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤))
56	15	raleqi 3293	. . . . . . . . 9 ⊢ (∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))(√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤)
57		fvex 6853	. . . . . . . . . . 11 ⊢ (𝑁‘(𝐴𝑀𝑦)) ∈ V
58	57	rgenw 3055	. . . . . . . . . 10 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑦)) ∈ V
59		eqid 2736	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))
60		breq2 5089	. . . . . . . . . . 11 ⊢ (𝑤 = (𝑁‘(𝐴𝑀𝑦)) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦))))
61	59, 60	ralrnmptw 7046	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑦)) ∈ V → (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))(√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦))))
62	58, 61	ax-mp 5	. . . . . . . . 9 ⊢ (∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))(√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
63	56, 62	bitri 275	. . . . . . . 8 ⊢ (∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
64	55, 63	bitrdi 287	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆 ↔ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦))))
65	51, 64	mtbid 324	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
66		rexnal 3089	. . . . . 6 ⊢ (∃𝑦 ∈ 𝑌 ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ¬ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
67	65, 66	sylibr 234	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑦 ∈ 𝑌 ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
68	32	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((𝑆↑2) + (1 / 𝑛)) ∈ ℝ)
69		phnv 30885	. . . . . . . . . . . . 13 ⊢ (𝑈 ∈ CPreHil_OLD → 𝑈 ∈ NrmCVec)
70	10, 69	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑈 ∈ NrmCVec)
71	70	ad2antrr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ NrmCVec)
72	12	ad2antrr 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋)
73		inss1 4177	. . . . . . . . . . . . . . . 16 ⊢ ((SubSp‘𝑈) ∩ CBan) ⊆ (SubSp‘𝑈)
74	73, 11	sselid 3919	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑊 ∈ (SubSp‘𝑈))
75		eqid 2736	. . . . . . . . . . . . . . . 16 ⊢ (SubSp‘𝑈) = (SubSp‘𝑈)
76	6, 9, 75	sspba 30798	. . . . . . . . . . . . . . 15 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ (SubSp‘𝑈)) → 𝑌 ⊆ 𝑋)
77	70, 74, 76	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
78	77	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑌 ⊆ 𝑋)
79	78	sselda 3921	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋)
80	6, 7	nvmcl 30717	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴𝑀𝑦) ∈ 𝑋)
81	71, 72, 79, 80	syl3anc 1374	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (𝐴𝑀𝑦) ∈ 𝑋)
82	6, 8	nvcl 30732	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑀𝑦) ∈ 𝑋) → (𝑁‘(𝐴𝑀𝑦)) ∈ ℝ)
83	71, 81, 82	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴𝑀𝑦)) ∈ ℝ)
84	83	resqcld 14087	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((𝑁‘(𝐴𝑀𝑦))↑2) ∈ ℝ)
85	68, 84	letrid 11298	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2) ∨ ((𝑁‘(𝐴𝑀𝑦))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
86	85	ord 865	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (¬ ((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2) → ((𝑁‘(𝐴𝑀𝑦))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
87	41	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ)
88	47	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 0 ≤ (√‘((𝑆↑2) + (1 / 𝑛))))
89	6, 8	nvge0 30744	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑀𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
90	71, 81, 89	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
91	87, 83, 88, 90	le2sqd 14219	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2)))
92	38	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) = ((𝑆↑2) + (1 / 𝑛)))
93	92	breq1d 5095	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (((√‘((𝑆↑2) + (1 / 𝑛)))↑2) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2) ↔ ((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2)))
94	91, 93	bitrd 279	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2)))
95	94	notbid 318	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ¬ ((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2)))
96	6, 7, 8, 13	imsdval 30757	. . . . . . . . . 10 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴𝐷𝑦) = (𝑁‘(𝐴𝑀𝑦)))
97	71, 72, 79, 96	syl3anc 1374	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (𝐴𝐷𝑦) = (𝑁‘(𝐴𝑀𝑦)))
98	97	oveq1d 7382	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((𝐴𝐷𝑦)↑2) = ((𝑁‘(𝐴𝑀𝑦))↑2))
99	98	breq1d 5095	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ↔ ((𝑁‘(𝐴𝑀𝑦))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
100	86, 95, 99	3imtr4d 294	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) → ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
101	100	reximdva 3150	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∃𝑦 ∈ 𝑌 ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) → ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
102	67, 101	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))
103	102	ralrimiva 3129	. . 3 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))
104	9	fvexi 6854	. . . 4 ⊢ 𝑌 ∈ V
105		nnenom 13942	. . . 4 ⊢ ℕ ≈ ω
106		oveq2 7375	. . . . . 6 ⊢ (𝑦 = (𝑓‘𝑛) → (𝐴𝐷𝑦) = (𝐴𝐷(𝑓‘𝑛)))
107	106	oveq1d 7382	. . . . 5 ⊢ (𝑦 = (𝑓‘𝑛) → ((𝐴𝐷𝑦)↑2) = ((𝐴𝐷(𝑓‘𝑛))↑2))
108	107	breq1d 5095	. . . 4 ⊢ (𝑦 = (𝑓‘𝑛) → (((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ↔ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
109	104, 105, 108	axcc4 10361	. . 3 ⊢ (∀𝑛 ∈ ℕ ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) → ∃𝑓(𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
110	103, 109	syl 17	. 2 ⊢ (𝜑 → ∃𝑓(𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
111	10	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → 𝑈 ∈ CPreHil_OLD)
112	11	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → 𝑊 ∈ ((SubSp‘𝑈) ∩ CBan))
113	12	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → 𝐴 ∈ 𝑋)
114		simprl 771	. . 3 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → 𝑓:ℕ⟶𝑌)
115		simprr 773	. . . 4 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))
116		fveq2 6840	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝑓‘𝑛) = (𝑓‘𝑘))
117	116	oveq2d 7383	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (𝐴𝐷(𝑓‘𝑛)) = (𝐴𝐷(𝑓‘𝑘)))
118	117	oveq1d 7382	. . . . . 6 ⊢ (𝑛 = 𝑘 → ((𝐴𝐷(𝑓‘𝑛))↑2) = ((𝐴𝐷(𝑓‘𝑘))↑2))
119		oveq2 7375	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (1 / 𝑛) = (1 / 𝑘))
120	119	oveq2d 7383	. . . . . 6 ⊢ (𝑛 = 𝑘 → ((𝑆↑2) + (1 / 𝑛)) = ((𝑆↑2) + (1 / 𝑘)))
121	118, 120	breq12d 5098	. . . . 5 ⊢ (𝑛 = 𝑘 → (((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ↔ ((𝐴𝐷(𝑓‘𝑘))↑2) ≤ ((𝑆↑2) + (1 / 𝑘))))
122	121	rspccva 3563	. . . 4 ⊢ ((∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ∧ 𝑘 ∈ ℕ) → ((𝐴𝐷(𝑓‘𝑘))↑2) ≤ ((𝑆↑2) + (1 / 𝑘)))
123	115, 122	sylan 581	. . 3 ⊢ (((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) ∧ 𝑘 ∈ ℕ) → ((𝐴𝐷(𝑓‘𝑘))↑2) ≤ ((𝑆↑2) + (1 / 𝑘)))
124		eqid 2736	. . 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 30951	. 2 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → ∃𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑥)) ≤ (𝑁‘(𝐴𝑀𝑦)))
126	110, 125	exlimddv 1937	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑥)) ≤ (𝑁‘(𝐴𝑀𝑦)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ≠ wne 2932 ∀wral 3051 ∃wrex 3061 Vcvv 3429 ∩ cin 3888 ⊆ wss 3889 ∅c0 4273 class class class wbr 5085 ↦ cmpt 5166 ran crn 5632 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 infcinf 9354 ℝcr 11037 0cc0 11038 1c1 11039 + caddc 11041 < clt 11179 ≤ cle 11180 − cmin 11377 / cdiv 11807 ℕcn 12174 2c2 12236 ↑cexp 14023 √csqrt 15195 MetOpencmopn 21342 ⇝_𝑡clm 23191 NrmCVeccnv 30655 BaseSetcba 30657 −_𝑣 cnsb 30660 norm_CVcnmcv 30661 IndMetcims 30662 SubSpcss 30792 CPreHil_OLDccphlo 30883 CBanccbn 30933

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-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-inf2 9562 ax-cc 10357 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-addf 11117 ax-mulf 11118

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-int 4890 df-iun 4935 df-iin 4936 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-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-map 8775 df-pm 8776 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-fi 9324 df-sup 9355 df-inf 9356 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-4 12246 df-n0 12438 df-z 12525 df-uz 12789 df-q 12899 df-rp 12943 df-xneg 13063 df-xadd 13064 df-xmul 13065 df-ico 13304 df-icc 13305 df-fl 13751 df-seq 13964 df-exp 14024 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-rest 17385 df-topgen 17406 df-psmet 21344 df-xmet 21345 df-met 21346 df-bl 21347 df-mopn 21348 df-fbas 21349 df-fg 21350 df-top 22859 df-topon 22876 df-bases 22911 df-cld 22984 df-ntr 22985 df-cls 22986 df-nei 23063 df-lm 23194 df-haus 23280 df-fil 23811 df-fm 23903 df-flim 23904 df-flf 23905 df-cfil 25222 df-cau 25223 df-cmet 25224 df-grpo 30564 df-gid 30565 df-ginv 30566 df-gdiv 30567 df-ablo 30616 df-vc 30630 df-nv 30663 df-va 30666 df-ba 30667 df-sm 30668 df-0v 30669 df-vs 30670 df-nmcv 30671 df-ims 30672 df-ssp 30793 df-ph 30884 df-cbn 30934

This theorem is referenced by: minvecolem7 30954

W3C validator