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 30913

Description: Lemma for minveco 30916. Discharge the assumption about the sequence 𝐹 by applying countable choice ax-cc 10504. (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 12336	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → 0 < (1 / 𝑛))
2	1	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 < (1 / 𝑛))
3		nnrecre 12335	. . . . . . . . . . . . 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 30906	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
17	16	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
18	17	simp1d 1142	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑅 ⊆ ℝ)
19	17	simp2d 1143	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑅 ≠ ∅)
20		0re 11292	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℝ
21	17	simp3d 1144	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∀𝑤 ∈ 𝑅 0 ≤ 𝑤)
22		breq1 5169	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 0 → (𝑥 ≤ 𝑤 ↔ 0 ≤ 𝑤))
23	22	ralbidv 3184	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 0 → (∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤 ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
24	23	rspcev 3635	. . . . . . . . . . . . . . . 16 ⊢ ((0 ∈ ℝ ∧ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤) → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤)
25	20, 21, 24	sylancr 586	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤)
26		infrecl 12277	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) → inf(𝑅, ℝ, < ) ∈ ℝ)
27	18, 19, 25, 26	syl3anc 1371	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → inf(𝑅, ℝ, < ) ∈ ℝ)
28	5, 27	eqeltrid 2848	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑆 ∈ ℝ)
29	28	resqcld 14175	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆↑2) ∈ ℝ)
30	4, 29	ltaddposd 11874	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (0 < (1 / 𝑛) ↔ (𝑆↑2) < ((𝑆↑2) + (1 / 𝑛))))
31	2, 30	mpbid 232	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆↑2) < ((𝑆↑2) + (1 / 𝑛)))
32	29, 4	readdcld 11319	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑆↑2) + (1 / 𝑛)) ∈ ℝ)
33	28	sqge0d 14187	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ (𝑆↑2))
34	29, 4, 33, 2	addgegt0d 11863	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 < ((𝑆↑2) + (1 / 𝑛)))
35	32, 34	elrpd 13096	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑆↑2) + (1 / 𝑛)) ∈ ℝ⁺)
36	35	rpge0d 13103	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ ((𝑆↑2) + (1 / 𝑛)))
37		resqrtth 15304	. . . . . . . . . . 11 ⊢ ((((𝑆↑2) + (1 / 𝑛)) ∈ ℝ ∧ 0 ≤ ((𝑆↑2) + (1 / 𝑛))) → ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) = ((𝑆↑2) + (1 / 𝑛)))
38	32, 36, 37	syl2anc 583	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) = ((𝑆↑2) + (1 / 𝑛)))
39	31, 38	breqtrrd 5194	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆↑2) < ((√‘((𝑆↑2) + (1 / 𝑛)))↑2))
40	35	rpsqrtcld 15460	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ⁺)
41	40	rpred 13099	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ)
42		0red 11293	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ∈ ℝ)
43		infregelb 12279	. . . . . . . . . . . . 13 ⊢ (((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) ∧ 0 ∈ ℝ) → (0 ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
44	18, 19, 25, 42, 43	syl31anc 1373	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (0 ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 0 ≤ 𝑤))
45	21, 44	mpbird 257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ inf(𝑅, ℝ, < ))
46	45, 5	breqtrrdi 5208	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ 𝑆)
47	32, 36	sqrtge0d 15469	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 0 ≤ (√‘((𝑆↑2) + (1 / 𝑛))))
48	28, 41, 46, 47	lt2sqd 14305	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆 < (√‘((𝑆↑2) + (1 / 𝑛))) ↔ (𝑆↑2) < ((√‘((𝑆↑2) + (1 / 𝑛)))↑2)))
49	39, 48	mpbird 257	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑆 < (√‘((𝑆↑2) + (1 / 𝑛))))
50	28, 41	ltnled 11437	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑆 < (√‘((𝑆↑2) + (1 / 𝑛))) ↔ ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆))
51	49, 50	mpbid 232	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆)
52	5	breq2i 5174	. . . . . . . . 9 ⊢ ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆 ↔ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ inf(𝑅, ℝ, < ))
53		infregelb 12279	. . . . . . . . . 10 ⊢ (((𝑅 ⊆ ℝ ∧ 𝑅 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑤 ∈ 𝑅 𝑥 ≤ 𝑤) ∧ (√‘((𝑆↑2) + (1 / 𝑛))) ∈ ℝ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤))
54	18, 19, 25, 41, 53	syl31anc 1373	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ inf(𝑅, ℝ, < ) ↔ ∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤))
55	52, 54	bitrid 283	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑆 ↔ ∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤))
56	15	raleqi 3332	. . . . . . . . 9 ⊢ (∀𝑤 ∈ 𝑅 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ ∀𝑤 ∈ ran (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))(√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤)
57		fvex 6933	. . . . . . . . . . 11 ⊢ (𝑁‘(𝐴𝑀𝑦)) ∈ V
58	57	rgenw 3071	. . . . . . . . . 10 ⊢ ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑦)) ∈ V
59		eqid 2740	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦))) = (𝑦 ∈ 𝑌 ↦ (𝑁‘(𝐴𝑀𝑦)))
60		breq2 5170	. . . . . . . . . . 11 ⊢ (𝑤 = (𝑁‘(𝐴𝑀𝑦)) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ 𝑤 ↔ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦))))
61	59, 60	ralrnmptw 7128	. . . . . . . . . 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 3106	. . . . . 6 ⊢ (∃𝑦 ∈ 𝑌 ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ¬ ∀𝑦 ∈ 𝑌 (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
67	65, 66	sylibr 234	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑦 ∈ 𝑌 ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)))
68	32	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((𝑆↑2) + (1 / 𝑛)) ∈ ℝ)
69		phnv 30846	. . . . . . . . . . . . 13 ⊢ (𝑈 ∈ CPreHil_OLD → 𝑈 ∈ NrmCVec)
70	10, 69	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑈 ∈ NrmCVec)
71	70	ad2antrr 725	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 𝑈 ∈ NrmCVec)
72	12	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ 𝑋)
73		inss1 4258	. . . . . . . . . . . . . . . 16 ⊢ ((SubSp‘𝑈) ∩ CBan) ⊆ (SubSp‘𝑈)
74	73, 11	sselid 4006	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑊 ∈ (SubSp‘𝑈))
75		eqid 2740	. . . . . . . . . . . . . . . 16 ⊢ (SubSp‘𝑈) = (SubSp‘𝑈)
76	6, 9, 75	sspba 30759	. . . . . . . . . . . . . . 15 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ (SubSp‘𝑈)) → 𝑌 ⊆ 𝑋)
77	70, 74, 76	syl2anc 583	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
78	77	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑌 ⊆ 𝑋)
79	78	sselda 4008	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 𝑦 ∈ 𝑋)
80	6, 7	nvmcl 30678	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴𝑀𝑦) ∈ 𝑋)
81	71, 72, 79, 80	syl3anc 1371	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (𝐴𝑀𝑦) ∈ 𝑋)
82	6, 8	nvcl 30693	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑀𝑦) ∈ 𝑋) → (𝑁‘(𝐴𝑀𝑦)) ∈ ℝ)
83	71, 81, 82	syl2anc 583	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (𝑁‘(𝐴𝑀𝑦)) ∈ ℝ)
84	83	resqcld 14175	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((𝑁‘(𝐴𝑀𝑦))↑2) ∈ ℝ)
85	68, 84	letrid 11442	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (((𝑆↑2) + (1 / 𝑛)) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2) ∨ ((𝑁‘(𝐴𝑀𝑦))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
86	85	ord 863	. . . . . . 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 30705	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑀𝑦) ∈ 𝑋) → 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
90	71, 81, 89	syl2anc 583	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → 0 ≤ (𝑁‘(𝐴𝑀𝑦)))
91	87, 83, 88, 90	le2sqd 14306	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) ↔ ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) ≤ ((𝑁‘(𝐴𝑀𝑦))↑2)))
92	38	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((√‘((𝑆↑2) + (1 / 𝑛)))↑2) = ((𝑆↑2) + (1 / 𝑛)))
93	92	breq1d 5176	. . . . . . . . 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 30718	. . . . . . . . . 10 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐴𝐷𝑦) = (𝑁‘(𝐴𝑀𝑦)))
97	71, 72, 79, 96	syl3anc 1371	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (𝐴𝐷𝑦) = (𝑁‘(𝐴𝑀𝑦)))
98	97	oveq1d 7463	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → ((𝐴𝐷𝑦)↑2) = ((𝑁‘(𝐴𝑀𝑦))↑2))
99	98	breq1d 5176	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ↔ ((𝑁‘(𝐴𝑀𝑦))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
100	86, 95, 99	3imtr4d 294	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑦 ∈ 𝑌) → (¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) → ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
101	100	reximdva 3174	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∃𝑦 ∈ 𝑌 ¬ (√‘((𝑆↑2) + (1 / 𝑛))) ≤ (𝑁‘(𝐴𝑀𝑦)) → ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
102	67, 101	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))
103	102	ralrimiva 3152	. . 3 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ∃𝑦 ∈ 𝑌 ((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))
104	9	fvexi 6934	. . . 4 ⊢ 𝑌 ∈ V
105		nnenom 14031	. . . 4 ⊢ ℕ ≈ ω
106		oveq2 7456	. . . . . 6 ⊢ (𝑦 = (𝑓‘𝑛) → (𝐴𝐷𝑦) = (𝐴𝐷(𝑓‘𝑛)))
107	106	oveq1d 7463	. . . . 5 ⊢ (𝑦 = (𝑓‘𝑛) → ((𝐴𝐷𝑦)↑2) = ((𝐴𝐷(𝑓‘𝑛))↑2))
108	107	breq1d 5176	. . . 4 ⊢ (𝑦 = (𝑓‘𝑛) → (((𝐴𝐷𝑦)↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ↔ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛))))
109	104, 105, 108	axcc4 10508	. . 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 770	. . 3 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → 𝑓:ℕ⟶𝑌)
115		simprr 772	. . . 4 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))
116		fveq2 6920	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝑓‘𝑛) = (𝑓‘𝑘))
117	116	oveq2d 7464	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (𝐴𝐷(𝑓‘𝑛)) = (𝐴𝐷(𝑓‘𝑘)))
118	117	oveq1d 7463	. . . . . 6 ⊢ (𝑛 = 𝑘 → ((𝐴𝐷(𝑓‘𝑛))↑2) = ((𝐴𝐷(𝑓‘𝑘))↑2))
119		oveq2 7456	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (1 / 𝑛) = (1 / 𝑘))
120	119	oveq2d 7464	. . . . . 6 ⊢ (𝑛 = 𝑘 → ((𝑆↑2) + (1 / 𝑛)) = ((𝑆↑2) + (1 / 𝑘)))
121	118, 120	breq12d 5179	. . . . 5 ⊢ (𝑛 = 𝑘 → (((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ↔ ((𝐴𝐷(𝑓‘𝑘))↑2) ≤ ((𝑆↑2) + (1 / 𝑘))))
122	121	rspccva 3634	. . . 4 ⊢ ((∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)) ∧ 𝑘 ∈ ℕ) → ((𝐴𝐷(𝑓‘𝑘))↑2) ≤ ((𝑆↑2) + (1 / 𝑘)))
123	115, 122	sylan 579	. . 3 ⊢ (((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) ∧ 𝑘 ∈ ℕ) → ((𝐴𝐷(𝑓‘𝑘))↑2) ≤ ((𝑆↑2) + (1 / 𝑘)))
124		eqid 2740	. . 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 30912	. 2 ⊢ ((𝜑 ∧ (𝑓:ℕ⟶𝑌 ∧ ∀𝑛 ∈ ℕ ((𝐴𝐷(𝑓‘𝑛))↑2) ≤ ((𝑆↑2) + (1 / 𝑛)))) → ∃𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑥)) ≤ (𝑁‘(𝐴𝑀𝑦)))
126	110, 125	exlimddv 1934	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑁‘(𝐴𝑀𝑥)) ≤ (𝑁‘(𝐴𝑀𝑦)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∃wex 1777 ∈ wcel 2108 ≠ wne 2946 ∀wral 3067 ∃wrex 3076 Vcvv 3488 ∩ cin 3975 ⊆ wss 3976 ∅c0 4352 class class class wbr 5166 ↦ cmpt 5249 ran crn 5701 ⟶wf 6569 ‘cfv 6573 (class class class)co 7448 infcinf 9510 ℝcr 11183 0cc0 11184 1c1 11185 + caddc 11187 < clt 11324 ≤ cle 11325 − cmin 11520 / cdiv 11947 ℕcn 12293 2c2 12348 ↑cexp 14112 √csqrt 15282 MetOpencmopn 21377 ⇝_𝑡clm 23255 NrmCVeccnv 30616 BaseSetcba 30618 −_𝑣 cnsb 30621 norm_CVcnmcv 30622 IndMetcims 30623 SubSpcss 30753 CPreHil_OLDccphlo 30844 CBanccbn 30894

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-inf2 9710 ax-cc 10504 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262 ax-addf 11263 ax-mulf 11264

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-map 8886 df-pm 8887 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-fi 9480 df-sup 9511 df-inf 9512 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-n0 12554 df-z 12640 df-uz 12904 df-q 13014 df-rp 13058 df-xneg 13175 df-xadd 13176 df-xmul 13177 df-ico 13413 df-icc 13414 df-fl 13843 df-seq 14053 df-exp 14113 df-cj 15148 df-re 15149 df-im 15150 df-sqrt 15284 df-abs 15285 df-rest 17482 df-topgen 17503 df-psmet 21379 df-xmet 21380 df-met 21381 df-bl 21382 df-mopn 21383 df-fbas 21384 df-fg 21385 df-top 22921 df-topon 22938 df-bases 22974 df-cld 23048 df-ntr 23049 df-cls 23050 df-nei 23127 df-lm 23258 df-haus 23344 df-fil 23875 df-fm 23967 df-flim 23968 df-flf 23969 df-cfil 25308 df-cau 25309 df-cmet 25310 df-grpo 30525 df-gid 30526 df-ginv 30527 df-gdiv 30528 df-ablo 30577 df-vc 30591 df-nv 30624 df-va 30627 df-ba 30628 df-sm 30629 df-0v 30630 df-vs 30631 df-nmcv 30632 df-ims 30633 df-ssp 30754 df-ph 30845 df-cbn 30895

This theorem is referenced by: minvecolem7 30915

W3C validator