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

Jump to page: Contents + 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-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10682

Color key:    Metamath Proof Explorer  Metamath Proof Explorer (1-8757)   Hilbert Space Explorer  Hilbert Space Explorer (8758-10682)  

Statement List for Metamath Proof Explorer - 7901-8000 - Page 80 of 107
TypeLabelDescription
Statement
 
Theoremiscauf 7901 Express the property "F is a Cauchy sequence of metric D " presupposing F is a function.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>` N)   =>   |- ((D e. Met /\ F:Z-->X) -> (F e. (Cau` D) <-> A.x e. RR (0 < x -> E.j e. Z A.k e. Z (j <_ k -> ((F` j)D(F` k)) < x))))
 
Theoremiscau5 7902 Express the property "F is a Cauchy sequence of metric D."
|- X = dom dom D   =>   |- ((D e. Met /\ F:NN-->X) -> (F e. (Cau` D) <-> A.x e. RR+ E.j e. NN A.k e. NN (j <_ k -> ((F` j)D(F` k)) < x)))
 
Theoremlmcvgnns 7903 Convergence property of a converging sequence.
|- X = dom dom D   &   |- (k e. NN -> A = (F` k))   =>   |- (((D e. Met /\ P e. B) /\ (F(~~>m` D)P /\ R e. RR+)) -> E.j e. NN A.k e. NN (j <_ k -> (ADP) < R))
 
Theoremcaun0 7904 A metric with a Cauchy sequence cannot be empty.
|- X = dom dom D   =>   |- ((D e. Met /\ F e. (Cau` D)) -> X =/= (/))
 
Theoremiscms 7905 The property "D is a complete metric," meaning all Cauchy sequences converge to a point in the space. Part of Definition 1.4-3 of [Kreyszig] p. 28.
|- X = dom dom D   =>   |- (D e. CMet <-> (D e. Met /\ A.f e. (Cau` D)E.x e. X f(~~>m` D)x))
 
Theoremcmscvg 7906 The convergence of a Cauchy sequence in a complete metric space.
|- X = dom dom D   =>   |- ((D e. CMet /\ F e. (Cau` D)) -> E.x e. X F(~~>m` D)x)
 
Theoremlmfss 7907 Inclusion of a function having a limit (used to ensure the limit relation is a set, under our definition).
|- X = dom dom D   =>   |- ((D e. Met /\ P e. A /\ F(~~>m` D)P) -> F (_ (CC X. X))
 
Theoremlmcl 7908 Closure of a limit.
|- X = dom dom D   =>   |- ((D e. Met /\ P e. A /\ F(~~>m` D)P) -> P e. X)
 
Theoremcaufss 7909 Inclusion of a Cauchy sequence, under our definition.
|- X = dom dom D   =>   |- ((D e. Met /\ F e. (Cau` D)) -> F (_ (CC X. X))
 
Theoremlmuni 7910 A sequence converges to at most one limit. Part of Lemma 1.4-2(a) of [Kreyszig] p. 26.
|- A e. V   &   |- B e. V   =>   |- ((D e. Met /\ F(~~>m` D)A /\ F(~~>m` D)B) -> A = B)
 
Theoremlmsslem 7911 Lemma for lmss 7912 and causs 7914.
 
Theoremlmss 7912 Limit on a metric subspace.
|- ((D e. Met /\ P e. Y /\ F:NN-->Y) -> (F(~~>m` D)P <-> F(~~>m` (D |` (Y X. Y)))P))
 
Theoremcaussi 7913 Cauchy sequence on a metric subspace.
|- ((D e. Met /\ F e. (Cau` (D |` (Y X. Y)))) -> F e. (Cau` D))
 
Theoremcauss 7914 Cauchy sequence on a metric subspace.
|- ((D e. Met /\ F:NN-->Y) -> (F e. (Cau` D) <-> F e. (Cau` (D |` (Y X. Y)))))
 
Theoremlmfexlem1 7915 Lemma for lmfex 7918. G is a function constructed from an arbitrary sequence F, from NN to the metric space base set.
 
Theoremlmfexlem2 7916 Lemma for lmfex 7918. When the value of F exists, it equals the value of G.
 
Theoremlmfexlem3 7917 Lemma for lmfex 7918. If F converges, so does the function G constructed from it.
 
Theoremlmfex 7918 If F (not necessarily a function) converges, there is a function g that converges to the same point.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>` N)   =>   |- ((D e. Met /\ P e. A /\ F(~~>m` D)P) -> E.g(g:Z-->X /\ g(~~>m` D)P))
 
Theoremlmle 7919 If the distance from each member of a converging sequence to a given point is less than or equal to a given amount, so is the convergence value. Warning: The HTML proof page is 0.5MB in size.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>` N)   =>   |- (((D e. Met /\ P e. A /\ F(~~>m` D)P) /\ (Q e. X /\ R e. RR /\ A.k e. Z ((F` k)DQ) <_ R)) -> (PDQ) <_ R)
 
Theoremcmsmet 7920 A complete metric space is a metric space.
|- (D e. CMet -> D e. Met)
 
Theoremcmsmeti 7921 A complete metric space is a metric space.
|- D e. CMet   =>   |- D e. Met
 
Theoremlmclim 7922 Relate a limit on the metric space of complex numbers to our complex number limit notation.
|- D = (abs o. - )   =>   |- (P e. A -> (F(~~>m` D)P <-> (F (_ (CC X. CC) /\ F ~~> P)))
 
Theoremlmclimnn 7923 Relate a limit on the metric space of complex numbers to our complex number limit notation.
|- D = (abs o. - )   =>   |- ((P e. A /\ F:NN-->CC) -> (F(~~>m` D)P <-> F ~~> P))
 
Theoremmetelcls 7924 A point belongs to the closure of a subset iff there is a sequence in the subset converging to it. Theorem 1.4-6(a) of [Kreyszig] p. 30. Warning: The HTML proof page is 0.5MB in size.
|- X = dom dom D   &   |- J = (Open` D)   &   |- P e. V   =>   |- ((D e. Met /\ M (_ X) -> (P e. ((cls` J)` M) <-> E.f(f:NN-->M /\ f(~~>m` D)P)))
 
Theoremmetcld 7925 A subset of a metric space is closed iff every convergent sequence on it converges to a point in the subset. Theorem 1.4-6(b) of [Kreyszig] p. 30.
|- X = dom dom D   &   |- J = (Open` D)   =>   |- ((D e. Met /\ M (_ X) -> (M e. (Clsd` J) <-> A.xA.f((f:NN-->M /\ f(~~>m` D)x) -> x e. M)))
 
Theoremmetcnp4lem1 7926 Lemma for metcnp4 7928.
 
Theoremmetcnp4lem2 7927 Lemma for metcnp4 7928.
 
Theoremmetcnp4 7928 Two ways to say a mapping from metric C to metric D is continuous at point P. Theorem 14-4.3 of [Gleason] p. 240.
|- X = dom dom C   &   |- Y = dom dom D   &   |- J = (Open` C)   &   |- K = (Open` D)   &   |- G = {<.j, y>. | (j e. NN /\ y = (F` (f` j)))}   =>   |- ((C e. Met /\ D e. Met /\ P e. X) -> (F e. ((J CnP K)` P) <-> (F:X-->Y /\ A.f((f:NN-->X /\ f(~~>m` C)P) -> G(~~>m` D)(F` P)))))
 
Theoremmetcn4 7929 Two ways to say a mapping from metric C to metric D is continuous. Theorem 10.3 of [Munkres] p. 128.
|- X = dom dom C   &   |- Y = dom dom D   &   |- J = (Open` C)   &   |- K = (Open` D)   &   |- G = {<.j, y>. | (j e. NN /\ y = (F` (f` j)))}   =>   |- ((C e. Met /\ D e. Met /\ F:X-->Y) -> (F e. (J Cn K) <-> A.f(f:NN-->X -> A.x e. X (f(~~>m` C)x -> G(~~>m` D)(F` x)))))
 
Theoremmetcn4i 7930 Convergence carries through a continuous mapping.
|- X = dom dom C   &   |- J = (Open` C)   &   |- K = (Open` D)   &   |- H = {<.j, y>. | (j e. NN /\ y = (F` (G` j)))}   &   |- P e. V   =>   |- (((C e. Met /\ D e. Met /\ F e. (J Cn K)) /\ (G:NN-->X /\ G(~~>m` C)P)) -> H(~~>m` D)(F` P))
 
Theoremxplmi 7931 Two sequences converge if the sequence of their ordered pairs converges. One direction of Proposition 14-2.6 of [Gleason] p. 230. Warning: The HTML proof page is 0.5MB in size.
|- R e. V   &   |- S e. V   &   |- X = dom dom B   &   |- Y = dom dom C   &   |- B e. Met   &   |- C e. Met   &   |- D = {<.<.x, y>., z>. | ((x e. (X X. Y) /\ y e. (X X. Y)) /\ z = sup({((1st` x)B(1st`
 y)), ((2nd`
 x)C(2nd` y))}, RR, < ))}   &   |- F = {<.k, w>. | (k e. NN /\ w = (1st` (H` k)))}   &   |- G = {<.k, w>. | (k e. NN /\ w = (2nd` (H` k)))}   =>   |- ((H:NN-->(X X. Y) /\ H(~~>m` D)<.R, S>.) -> ((F:NN-->X /\ F(~~>m` B)R) /\ (G:NN-->Y /\ G(~~>m` C)S)))
 
Theoremxplmi2 7932 Two sequences converge if the sequence of their ordered pairs converges. Part of Proposition 14-2.6 of [Gleason] p. 230. Note: The hypothesis S e. V is redundant but is kept for convenience.
|- R e. V   &   |- S e. V   &   |- X = dom dom B   &   |- Y = dom dom C   &   |- B e. Met   &   |- C e. Met   &   |- D = {<.<.x, y>., z>. | ((x e. (X X. Y) /\ y e. (X X. Y)) /\ z = sup({((1st` x)B(1st`
 y)), ((2nd`
 x)C(2nd` y))}, RR, < ))}   &   |- F = {<.k, w>. | (k e. NN /\ w = (1st` (H` k)))}   &   |- G = {<.k, w>. | (k e. NN /\ w = (2nd` (H` k)))}   =>   |- ((H:NN-->(X X. Y) /\ H(~~>m` D)R) -> ((F:NN-->X /\ F(