HomeHome Metamath Proof Explorer < Previous   Next >
Browser slow? Try the
Unicode version.

Jump to page: 1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5787

Color key:    Metamath Proof
Explorer  Metamath Proof Explorer (1-4957)   Hilbert Space Explorer  Hilbert Space Explorer (4958-5787)  

Statement List for Metamath Proof Explorer - 5201-5300 - Page 53 of 58
TypeLabelDescription
Statement
 
Theoremprojlem9 5201 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Real closure of the infimum of norms. Used by projlem11 5203 projlem12 5204 projlem13 5205 projlem15 5207.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   =>   |- sup(S, RR, < ) e. RR
 
Theoremprojlem10 5202 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). A member of the infimum set. Used by projlem12 5204.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   =>   |- (B e. H -> -u(norm` (B -v A)) e. S)
 
Theoremprojlem11 5203 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). R is the infimum of the set of norms. Show it is real. Used by projlem12 5204 projlem13 5205 projlem14 5206 projlem15 5207 projlem18 5210 projlem19 5211 projlem26 5218 projlem28 5220 projlem31 5223.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   =>   |- R e. RR
 
Theoremprojlem12 5204 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). The infimum is less than any norm in the set of norms. Used by projlem14 5206 projlem18 5210 projlem31 5223.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   =>   |- (B e. H -> R <_ (norm` (B -v A)))
 
Theoremprojlem13 5205 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). The infimum of the set of norms is nonnegative. Used by projlem18 5210 projlem19 5211 projlem28 5220.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   =>   |- 0 <_ R
 
Theoremprojlem14 5206 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Used by projlem16 5208.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   &   |- C e. NN   &   |- B e. H   =>   |- (R - (1 / C)) < (norm` (B -v A))
 
Theoremprojlem15 5207 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Used by projlem16 5208.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   &   |- C e. NN   =>   |- E.z e. H (norm` (z -v A)) < (R + (1 / C))
 
Theoremprojlem16 5208 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). Existence of a vector sequence member, used to show (via Axiom of Choice) the vector sequence existence. Used by projlem17 5209.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   &   |- C e. NN   =>   |- E.z e. H ((R - (1 / C)) < (norm` (z -v A)) /\ (norm` (z -v A)) < (R + (1 / C)))
 
Theoremprojlem17 5209 Part of Lemma 3.6 of [Beran] p. 100 (lemma for projection theorem). This uses the Axiom of Choice to show the existence of a vector sequence satisfying the assumption of Lemma 3.6 of [Beran] p. 100: "Let {yn } be a sequence of W such that i0 - 1/n < ||x0 - yn || < i0 + 1/n." Here, H corresponds to "W"; f:NN-->H to "{yn }"; w to "n"; R to "i0 "; and (norm` (A -v (f` w))) to "||x0 - yn ||". Used by projlem 5224.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   =>   |- E.f(f:NN-->H /\ A.w e. NN ((R - (1 / w)) < (norm` ((f` w) -v A)) /\ (norm` ((f` w) -v A)) < (R + (1 / w))))
 
Theoremprojlem18 5210 Part of Lemma 3.6 of [Beran] p. 101, top. Used by projlem19 5211.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   &   |- B e. H   &   |- C e. H   =>   |- (4 x. (R^2)) <_ ((norm` ((B +v C) -v (2 .s A)))^2)
 
Theoremprojlem19 5211 Part of Lemma 3.6 of [Beran] p. 101. Used by projlem20 5212.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   &   |- B e. H   &   |- C e. H   &   |- D e. NN   &   |- G e. NN   &   |- N e. NN   =>   |- (((norm` (B -v A)) < (R + (1 / D)) /\ (norm` (C -v A)) < (R + (1 / G))) -> ((N <_ D /\ N <_ G) -> (norm` (B -v C)) < (sqr` ((4 x. ((2 x. R) + 1)) / N))))
 
Theoremprojlem20 5212 Part of Lemma 3.6 of [Beran] p. 101. Used by projlem27 5219.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   &   |- N e. NN   =>   |- (((B e. H /\ C e. H) /\ (D e. NN /\ G e. NN)) -> (((norm` (B -v A)) < (R + (1 / D)) /\ (norm` (C -v A)) < (R + (1 / G))) -> ((N <_ D /\ N <_ G) -> (norm` (B -v C)) < (sqr` ((4 x. ((2 x. R) + 1)) / N)))))
 
Theoremprojlem21 5213 Part of Lemma 3.6 of [Beran] p. 100. The hypothesis lets us work with our postulated vector sequence (whose existence was shown by projlem17 5209). Here we just show the sequence value belongs to the closed subspace H. Used by projlem27 5219 projlem28 5220.
|- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (norm` ((F` w) -v A)) /\ (norm` ((F` w) -v A)) < (R + (1 / w)))))   =>   |- (ph -> (D e. NN -> (F` D) e. H))
 
Theoremprojlem22 5214 Part of Lemma 3.6 of [Beran] p. 100. Here we show a member of the vector sequence is bounded. Used by projlem27 5219.
|- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (norm` ((F` w) -v A)) /\ (norm` ((F` w) -v A)) < (R + (1 / w)))))   =>   |- (ph -> (D e. NN -> (norm` ((F` D) -v A)) < (R + (1 / D))))
 
Theoremprojlem23 5215 Part of Lemma 3.6 of [Beran] p. 101. The hypothesis lets us work with the sequence G which corresponds to Beran's "{||yn-x0||}". Used by projlem25 5217 projlem26 5218.
|- G = {<.x, y>. | (x e. NN /\ y = (norm` ((F` x) -v A)))}   =>   |- (D e. NN -> (G` D) = (norm` ((F` D) -v A)))
 
Theoremprojlem24 5216 Part of Lemma 3.6 of [Beran] p. 101. Here we show our vector sequence implies the real numbers sequence G corresponding to Beran's "{||yn-x0||}". Used by projlem25 5217 projlem26 5218.
|- G = {<.x, y>. | (x e. NN /\ y = (norm` ((F` x) -v A)))}   &   |- A e. H~   =>   |- (F:NN-->H~ -> G:NN-->CC)
 
Theoremprojlem25 5217 Part of Lemma 3.6 of [Beran] p. 101. "The sequence {||yn-x0||} of real numbers converges to the number ||y0-x0||" (here, "y0" is A and "x0" is z). Used by projlem31 5223.
|- G = {<.x, y>. | (x e. NN /\ y = (norm` ((F` x) -v A)))}   &   |- A e. H~   &   |- F e. V   =>   |- (F ~~>v z -> G ~~> (norm` (z -v A)))
 
Theoremprojlem26 5218 Part of Lemma 3.6 of [Beran] p. 101. The real sequence G (Beran's "{||yn-x0||}") converges to the infimum of norms. Used by projlem31 5223.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   &   |- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (norm` ((F` w) -v A)) /\ (norm` ((F` w) -v A)) < (R + (1 / w)))))   &   |- G = {<.x, y>. | (x e. NN /\ y = (norm` ((F` x) -v A)))}   =>   |- (ph -> G ~~> R)
 
Theoremprojlem27 5219 Part of Lemma 3.6 of [Beran] p. 101. Boundedness to show F is a Cauchy sequence. Used by projlem28 5220.
|- A e. H~   &   |- H e. CH   &   |- S = {u e. RR | E.v e. H u = -u(norm` (v -v A))}   &   |- R = -usup(S, RR, < )   &   |- (ph <-> (F:NN-->H /\ A.w e. NN ((R - (1 / w)) < (norm` ((F` w) -v A)) /\ (norm` ((F` w) -v A)) < (R + (1 / w)))))   &   |- N e. NN   =>   |- ((ph /\ (D e. NN /\ G e. NN)) -> ((N <_ D /\ N <_ G) -> (norm` ((F` D) -v (F` G))) < (sqr` ((4 x. ((2 x. R) + 1)) / N