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-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12229

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-9062)
  Hilbert Space Explorer  Hilbert Space Explorer
(9063-10650)
  Users' Mathboxes  Users' Mathboxes
(10651-12229)
 

Statement List for Metamath Proof Explorer - 8101-8200 - Page 82 of 123
TypeLabelDescription
Statement
 
Theoremmetcnpi 8101 Epsilon-delta property of a continuous metric space function, with function arguments as in metcnp 8098.
|- X = dom dom C   &   |- J = (Open` C)   &   |- Y = dom dom D   &   |- K = (Open` D)   =>   |- (((C e. Met /\ D e. Met /\ P e. X) /\ (F e. ((J CnP K)` P) /\ A e. RR /\ 0 < A)) -> E.x e. RR (0 < x /\ A.y e. X ((PCy) < x -> ((F` P)D(F` y)) < A)))
 
Theoremmetcnpi2 8102 Epsilon-delta property of a continuous metric space function, with swapped distance function arguments as in metcnp2 8099.
|- X = dom dom C   &   |- J = (Open` C)   &   |- Y = dom dom D   &   |- K = (Open` D)   =>   |- (((C e. Met /\ D e. Met /\ P e. X) /\ (F e. ((J CnP K)` P) /\ A e. RR /\ 0 < A)) -> E.x e. RR (0 < x /\ A.y e. X ((yCP) < x -> ((F` y)D(F` P)) < A)))
 
Theoremmetcnpi3 8103 Epsilon-delta property of a metric space function continuous at P. A variation of metcnpi2 8102 with non-strict ordering.
|- X = dom dom C   &   |- J = (Open` C)   &   |- Y = dom dom D   &   |- K = (Open` D)   =>   |- (((C e. Met /\ D e. Met /\ P e. X) /\ (F e. ((J CnP K)` P) /\ A e. RR /\ 0 < A)) -> E.x e. RR (0 < x /\ A.y e. X ((yCP) <_ x -> ((F` y)D(F` P)) <_ A)))
 
Theoremmetcnpi4 8104 Epsilon-delta property of a metric space function continuous at P. A variation of metcnpi 8101 with non-strict ordering.
|- X = dom dom C   &   |- J = (Open` C)   &   |- Y = dom dom D   &   |- K = (Open` D)   =>   |- (((C e. Met /\ D e. Met /\ P e. X) /\ (F e. ((J CnP K)` P) /\ A e. RR /\ 0 < A)) -> E.x e. RR (0 < x /\ A.y e. X ((PCy) <_ x -> ((F` P)D(F` y)) <_ A)))
 
Theoremmetcni 8105 Epsilon-delta property of a continuous metric space function.
|- X = dom dom C   &   |- J = (Open` C)   &   |- Y = dom dom D   &   |- K = (Open` D)   =>   |- (((C e. Met /\ D e. Met /\ F e. (J Cn K)) /\ (P e. X /\ A e. RR /\ 0 < A)) -> E.x e. RR (0 < x /\ A.y e. X ((PCy) < x -> ((F` P)D(F` y)) < A)))
 
Theoremmetcni2 8106 Epsilon-delta property of a continuous metric space function.
|- X = dom dom C   &   |- J = (Open` C)   &   |- Y = dom dom D   &   |- K = (Open` D)   =>   |- (((C e. Met /\ D e. Met /\ F e. (J Cn K)) /\ (P e. X /\ A e. RR /\ 0 < A)) -> E.x e. RR (0 < x /\ A.y e. X ((PCy) <_ x -> ((F` P)D(F` y)) <_ A)))
 
Theoremmetcnp3 8107 Two ways to express that F is continuous at P for metric spaces. Proposition 14-4.2 of [Gleason] p. 240.
|- X = dom dom C   &   |- J = (Open` C)   &   |- Y = dom dom D   &   |- K = (Open` D)   =>   |- ((C e. Met /\ D e. Met /\ P e. X) -> (F e. ((J CnP K)` P) <-> (F:X-->Y /\ A.y e. RR (0 < y -> E.z e. RR (0 < z /\ (F"(P( ball ` C)z)) (_ ((F` P)( ball ` D)y))))))
 
Theoremmetcnco 8108 Composition of two continuous functions (metric space version of cnco 7978).
|- J = (Open` B)   &   |- K = (Open` C)   &   |- L = (Open` D)   =>   |- (((B e. Met /\ C e. Met /\ D e. Met) /\ (F e. (J Cn K) /\ G e. (K Cn L))) -> (G o. F) e. (J Cn L))
 
Theoremmetcnss 8109 Subset relationship for continuity of metric spaces.
|- J = (Open` B)   &   |- K = (Open` C)   &   |- L = (Open` D)   =>   |- (((B e. Met /\ C e. Met /\ D e. Met) /\ C (_ D) -> (J Cn K) (_ (J Cn L))
 
Theoremmetcnss2 8110 Subset relationship for continuity of metric spaces.
|- X = dom dom B   &   |- J = (Open` B)   &   |- K = (Open` C)   &   |- L = (Open` D)   =>   |- (((B e. Met /\ C e. Met /\ D e. Met) /\ (B (_ C /\ F e. (K Cn L))) -> (F |` X) e. (J Cn L))
 
Theoremmetidcn 8111 The identity function is continuous (metric space version of idcn 7976).
|- X = dom dom C   &   |- J = (Open` C)   &   |- K = (Open` D)   =>   |- ((C e. Met /\ D e. Met /\ C (_ D) -> (I |` X) e. (J Cn K))
 
Theoremmetdnsconst 8112 If a continuous mapping to a metric space is constant on a dense subset, it is constant on the entire space (metric space version of dnsconst 7998).
|- X = dom dom C   &   |- Y = dom dom D   &   |- J = (Open` C)   &   |- K = (Open` D)   =>   |- (((C e. Met /\ D e. Met /\ F e. (J Cn K)) /\ (P e. Y /\ A (_ (`'F"{P}) /\ ((cls` J)` A) = X)) -> F:X-->{P})
 
Examples of metric spaces
 
Theoremcnmetdval 8113 Value of the distance function of the metric space of complex numbers.
|- D = (abs o. - )   =>   |- ((A e. CC /\ B e. CC) -> (ADB) = (abs` (A - B)))
 
Theoremcnmetba 8114 The base set of the metric for complex numbers.
|- D = (abs o. - )   =>   |- CC = dom dom D
 
Theoremcnmet 8115 The absolute value metric determines a metric space on the complex numbers. This theorem provides a link between complex numbers and metrics spaces, making metric space theorems available for use with complex numbers. (Contributed by FL, 9-Oct-2006.)
|- D = (abs o. - )   =>   |- D e. Met
 
Theoremcncfmet 8116 Relate complex function continuity to metric space continuity. (Contributed by Paul Chapman, 26-Nov-2007.)
|- C = ((abs o. - ) |` (A X. A))   &   |- D = ((abs o. - ) |` (B X. B))   &   |- J = (Open` C)   &   |- K = (Open` D)   =>   |- ((A (_ CC /\ B (_ CC) -> (A-cn->B) = (J Cn K))
 
Theoremcncfmet1 8117 Relate complex function continuity to metric space continuity. (Contributed by Paul Chapman, 28-Nov-2007.)
|- D = (abs o. - )   &   |- J = (Open` D)   =>   |- (CC-cn->CC) = (J Cn J)
 
Theoremcn2met 8118 The standard metric space on CC X. CC.
|- C = (abs o. - )   &   |- D = {<.<.x, y>., z>. | ((x e. (CC X. CC) /\ y e. (CC X. CC)) /\ z = sup({((1st`
 x)C(1st` y)), ((2nd` x)C(2nd`
 y))}, RR, < ))}   =>   |- D e. Met
 
Theoremremetdval 8119 Value of the distance function of the metric space of real numbers.
|- D = ((abs o. - ) |` (RR X. RR))   =>   |- ((A e. RR /\ B e. RR) -> (ADB) = (abs` (A - B)))
 
Theoremremetba 8120 The base set for the metric for real numbers.
|- D = ((abs o. - ) |` (RR X. RR))   =>   |- RR = dom dom D
 
Theoremremet 8121 The absolute value metric determines a metric space on the reals.
|- D = ((abs o. - ) |` (RR X. RR))   =>   |- D e. Met
 
Theorembl2ioo 8122 A ball in terms of an open interval of reals.
|- D = ((abs o. - ) |` (RR X. RR))   =>   |- ((A e. RR /\ B e. RR /\ 0 < B) -> (A( ball ` D)B) = ((A - B)(,)(A + B)))
 
Theoremioo2bl 8123 An open interval of reals in terms of a ball.
|- D = ((abs o. - ) |` (RR X. RR))   =>   |- ((A e. RR /\ B e. RR /\ A < B) -> (A(,)B) = (((A + B) / 2)( ball ` D)((B - A) / 2)))
 
Theoremblssioo 8124 The balls of the standard real metric space are included in the open real intervals.
|- D = ((abs o. - ) |` (RR X. RR))   =>   |- ran ( ball ` D) (_ ran (,)
 
Theoremtgioolem 8125 Lemma for tgioo 8126. An open interval includes a ball around any of its points. Warning: The HTML proof page is 0.6MB in size.
 
Theoremtgioo 8126 The topology generated by open intervals of reals is the same as the open sets of the standard metric space on the reals.
|- D = ((abs o. - ) |` (RR X. RR))   &   |- J = (Open` D)   =>   |- (topGen` ran (,)) = J
 
Theoremqdensere2 8127 QQ is dense in RR.
|- D = ((abs o. - ) |` (RR X. RR))   &   |- J = (Open` D)   =>   |- ((cls` J)` QQ) = RR
 
Theoremrehaus 8128 The standard topology on the reals is Hausdorff.
|- (topGen` ran (,)) e. Haus
 
Theoremdscmet 8129 The discrete metric on any set X. Definition 1.1-8 of [Kreyszig] p. 8. (Contributed by FL, 12-Oct-2006.)
|- X e. V   &   |- D = {<.<.x, y>., z>. | ((x e. X /\ y e. X) /\ z = if(x = y, 0, 1))}   =>   |- D e. Met
 
Convergence and completeness
 
Syntaxclm 8130 Extend class notation with a function on metric spaces whose value is the convergence relation for limit sequences in the space.
class ~~>m
 
Syntaxcca 8131 Extend class notation with a function on metric spaces whose value is the set of all Cauchy sequences of the space.
class Cau
 
Syntaxcms 8132 Extend class notation with class of complete metric spaces.
class CMet
 
Definitiondf-lm 8133 Define a function on metric spaces whose value is the convergence relation for the space. Although f is typically a function from upper integers to the metric space, it doesn't have to be. Unfortunately, the expression after "w =" must exist to use fvopab4 3891, and we use the otherwise unnecessary conjunct f (_ (CC X. dom dom z) to ensure that. This could be changed to the more liberal (but more complex) f (_ (CC X. (dom dom z u. {(/)})) if we want to allow for functions with undefined values.
|- ~~>m = {<.z, w>. | (z e. Met /\ w = {<.f, y>. | (f (_ (CC X. dom dom z) /\ y e. dom dom z /\ A.x e. RR (0 < x -> E.j e. ZZ A.k e. ZZ (j <_ k -> ((f` k) e. dom dom z /\ ((f` k)Dy) < x))))})}
 
Definitiondf-cau 8134 Define a function on metric spaces whose value is the set of Cauchy sequences of the space.
|- Cau = {<.z, w>. | (z e. Met /\ w = {f | (f (_ (CC X. dom dom z) /\ A.x e. RR (0 < x -> E.j e. ZZ A.k e. ZZ A.m e. ZZ ((j <_ k /\ j <_ m) -> ((f` k) e. dom dom z /\ (f` m) e. dom dom z /\ ((f` k)D(f` m)) < x))))})}
 
Definitiondf-cmet 8135 Define the class of complete metrics.
|- CMet = {x e. Met | A.f e. (Cau` x)E.y e. dom dom x f(~~>m` x)y}
 
Theoremlmfval 8136 The relation "sequence f converges to point y" in a metric space.
|- X = dom dom D   =>   |- (D e. Met -> (~~>m` D) = {<.f, y>. | (f (_ (CC X. X) /\ y e. X /\ A.x e. RR (0 < x -> E.j e. ZZ A.k e. ZZ (j <_ k -> ((f` k) e. X /\ ((f` k)Dy) < x))))})
 
Theoremcaufval 8137 The set of Cauchy sequences on a metric space.
|- X = dom dom D   =>   |- (D e. Met -> (Cau` D) = {f | (f (_ (CC X. X) /\ A.x e. RR (0 < x -> E.j e. ZZ A.k e. ZZ A.m e. ZZ ((j <_ k /\ j <_ m) -> ((f` k) e. X /\ (f` m) e. X /\ ((f` k)D(f` m)) < x))))})
 
Theoremlmrel 8138 The metric space convergence relation is a relation.
|- (D e. Met -> Rel (~~>m` D))
 
Theoremlmbr 8139 Express the binary relation "sequence F converges to point P " in a metric space. Definition 1.4-1 of [Kreyszig] p. 25. The condition F (_ (CC X. X) allows us to use objects more general than sequences when convenient; see the comment in df-lm 8133.
|- X = dom dom D   =>   |- ((D e. Met /\ P e. A) -> (F(~~>m` D)P <-> (F (_ (CC X. X) /\ P e. X /\ A.x e. RR (0 < x -> E.j e. ZZ A.k e. ZZ (j <_ k -> ((F` k) e. X /\ ((F` k)DP) < x))))))
 
Theoremlmbr2 8140 Express the binary relation "sequence F converges to point P " in a metric space using an abitrary set of upper integers.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>=` N)   =>   |- ((D e. Met /\ P e. A) -> (F(~~>m` D)P <-> (F (_ (CC X. X) /\ P e. X /\ A.x e. RR (0 < x -> E.j e. Z A.k e. Z (j <_ k -> ((F` k) e. X /\ ((F` k)DP) < x))))))
 
Theoremlmbrf 8141 Express the binary relation "sequence F converges to point P " in a metric space using an abitrary set of upper integers. This version of lmbr2 8140 presupposes that F is a function.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>=` N)   =>   |- ((D e. Met /\ P e. A /\ F:Z-->X) -> (F(~~>m` D)P <-> (P e. X /\ A.x e. RR (0 < x -> E.j e. Z A.k e. Z (j <_ k -> ((F` k)DP) < x)))))
 
Theoremlmbrf2 8142 Express the binary relation "sequence F converges to point P " in a metric space using an abitrary set of upper integers. This version of lmbrf 8141 presupposes that the convergence point is in the metric space.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>=` N)   =>   |- ((D e. Met /\ P e. X /\ F:Z-->X) -> (F(~~>m` D)P <-> A.x e. RR (0 < x -> E.j e. Z A.k e. Z (j <_ k -> ((F` k)DP) < x))))
 
Theoremlmcvg 8143 Convergence property of a converging sequence.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>=` N)   =>   |- (((D e. Met /\ P e. A /\ F(~~>m` D)P) /\ (R e. RR /\ 0 < R)) -> E.j e. Z A.k e. Z (j <_ k -> ((F` k) e. X /\ ((F` k)DP) < R)))
 
Theoremlmcvg2 8144 Convergence property of a converging sequence.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>=` N)   =>   |- (((D e. Met /\ P e. A /\ F(~~>m` D)P) /\ (R e. RR /\ 0 < R)) -> E.j e. Z A.k e. Z (j <_ k -> ((F` k)DP) < R))
 
Theoremlmconst 8145 A constant sequence converges to its value.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>=` N)   =>   |- ((D e. Met /\ P e. X) -> (Z X. {P})(~~>m` D)P)
 
Theoremlmnn 8146 A condition that implies convergence.
|- X = dom dom D   =>   |- (((D e. Met /\ P e. X) /\ (F:NN-->X /\ A.k e. NN ((F` k)DP) < (1 / k))) -> F(~~>m` D)P)
 
Theoremiscau 8147 Express the property "F is a Cauchy sequence of metric D." Part of Definition 1.4-3 of [Kreyszig] p. 28. The condition F (_ (CC X. X) allows us to use objects more general than sequences when convenient; see the comment in df-lm 8133.
|- X = dom dom D   =>   |- (D e. Met -> (F e. (Cau` D) <-> (F (_ (CC X. X) /\ A.x e. RR (0 < x -> E.j e. ZZ A.k e. ZZ A.m e. ZZ ((j <_ k /\ j <_ m) -> ((F` k) e. X /\ (F` m) e. X /\ ((F` k)D(F` m)) < x))))))
 
Theoremiscau2 8148 Express the property "F is a Cauchy sequence of metric D," using an abitrary set of upper integers.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>=` N)   =>   |- (D e. Met -> (F e. (Cau` D) <-> (F (_ (CC X. X) /\ A.x e. RR (0 < x -> E.j e. Z A.k e. Z A.m e. Z ((j <_ k /\ j <_ m) -> ((F` k) e. X /\ (F` m) e. X /\ ((F` k)D(F` m)) < x))))))
 
Theoremiscau3 8149 Express the property "F is a Cauchy sequence of metric D " with one less quantifier.
|- X = dom dom D   &   |- N e. ZZ   &   |- Z = (ZZ>=` N)   =>   |- (D e. Met -> (F e. (Cau` D) <-> (F (_ (CC X. X) /\ A.x e. RR (0 < x -> E.j e. Z A.k e. Z (j <_ k -> ((F` j) e. X /\ (F` k) e. X /\ ((F` j)D(F` k)) < x))))))
 
Theoremiscauf 8150 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))))
 
Theoremiscau4 8151 Express the property "F is a Cauchy sequence of metric D."
|- X = dom dom D   =>   |- (D e. Met -> (F e. (Cau` D) <-> (F (_ (CC X. X) /\ A.x e. RR (0 < x -> E.j e. ZZ A.k e. ZZ (j <_ k -> ((F` j) e. X /\ (F` k) e. X /\ ((F` j)D(F` k)) < x))))))
 
Theoremiscau5 8152 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)))
 
Theoremlmbrnns 8153 Express the binary relation "sequence F converges to point P " in a metric space."
|- X = dom dom D   &   |- (k e. NN -> A = (F` k))   =>   |- ((D e. Met /\ P e. X /\ F:NN-->X) -> (F(~~>m` D)P <-> A.x e. RR+ E.j e. NN A.k e. NN (j <_ k -> (ADP) < x)))
 
Theoremlmcvgnns 8154 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))
 
Theoremiscaunns 8155 Express the property "F is a Cauchy sequence of metric D."
|- X = dom dom D   &   |- (k e. NN -> A = (F` k))   =>   |- ((D e. Met /\ F:NN-->X) -> (F e. (Cau` D) <-> A.x e. RR+ E.j e. NN A.k e. NN (j <_ k -> ([_j / k]_ADA) < x)))
 
Theoremcaun0 8156 A metric with a Cauchy sequence cannot be empty.
|- X = dom dom D   =>   |- ((D e. Met /\ F e. (Cau` D)) -> X =/= (/))
 
Theoremiscms 8157 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 8158 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 8159 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 8160 Closure of a limit.
|- X = dom dom D   =>   |- ((D e. Met /\ P e. A /\ F(~~>m` D)P) -> P e. X)
 
Theoremcaufss 8161 Inclusion of a Cauchy sequence, under our definition.
|- X = dom dom D   =>   |- ((D e. Met /\ F e. (Cau` D)) -> F (_ (CC X. X))
 
Theoremlmuni 8162 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 8163 Lemma for lmss 8164 and causs 8166.
 
Theoremlmss 8164 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 8165 Cauchy sequence on a metric subspace.
|- ((D e. Met /\ F e. (Cau` (D |` (Y X. Y)))) -> F e. (Cau` D))
 
Theoremcauss 8166 Cauchy sequence on a metric subspace.
|- ((D e. Met /\ F:NN-->Y) -> (F e. (Cau` D) <-> F e. (Cau` (D |` (Y X. Y)))))
 
Theoremlmfexlem1 8167 Lemma for lmfex 8170. G is a function constructed from an arbitrary sequence F, from NN to the metric space base set.
 
Theoremlmfexlem2 8168 Lemma for lmfex 8170. When the value of F exists, it equals the value of G.
 
Theoremlmfexlem3 8169 Lemma for lmfex 8170. If F converges, so does the function G constructed from it.
 
Theoremlmfex 8170 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 8171 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 8172 A complete metric space is a metric space.
|- (D e. CMet -> D e. Met)
 
Theoremcmsmeti 8173 A complete metric space is a metric space.
|- D e. CMet   =>   |- D e. Met
 
Theoremlmclim 8174 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 8175 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 8176 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)))
 
Theoremmetcls 8177 The closure of a subset of a metric space is equal to its points of convergence. Theorem 1.4-6(a) of [Kreyszig] p. 30.
|- X = dom dom D   &   |- J = (Open` D)   =>   |- ((D e. Met /\ M (_ X) -> ((cls` J)` M) = {x | E.f(f:NN-->M /\ f(~~>m` D)x)})
 
Theoremmetcld 8178 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 8179 Lemma for metcnp4 8181.
 
Theoremmetcnp4lem2 8180 Lemma for metcnp4 8181.
 
Theoremmetcnp4 8181 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 8182 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 8183 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 8184 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 8185 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(~~>m` B)(1st` R)) /\ (G:NN-->Y /\ G(~~>m` C)(2nd` R))))
 
Theoremxplm 8186 Two sequences converge iff the sequence of their ordered pairs converges. 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:NN-->X   &   |- G:NN-->Y   &   |- H = {<.k, w>. | (k e. NN /\ w = <.(F` k), (G` k)>.)}   =>   |- ((F(~~>m` B)R /\ G(~~>m` C)S) <-> H(~~>m` D)<.R, S>.)
 
Theoremxpcn 8187 Construct a continuous function to the product of the codomains of two continuous functions on a common metric space. Warning: The HTML proof page is 0.5MB in size.
|- X = dom dom A   &   |- Y = dom dom B   &   |- Z = dom dom C   &   |- A e. Met   &   |- B e. Met   &   |- C e. Met   &   |- D = {<.<.x, y>., z>. | ((x e. (Y X. Z) /\ y e. (Y X. Z)) /\ z = sup({((1st` x)B(1st`
 y)), ((2nd`
 x)C(2nd` y))}, RR, < ))}   &   |- J = (Open` A)   &   |- K = (Open` B)   &   |- L = (Open` C)   &   |- M = (Open` D)   &   |- H = {<.w, v>. | (w e. X /\ v = <.(F` w), (G` w)>.)}   =>   |- ((F e. (J Cn K) /\ G e. (J Cn L)) -> H e. (J Cn M))
 
Theoremoprcn 8188 Construct a continuous function H built from two functions F and G (on a common metric space A) applied to an operation O. This can be used to show, e.g., that x^2 + x is continuous if we know that x^2, x, and + are.
|- X = dom dom A   &   |- Y = dom dom B   &   |- Z = dom dom C   &   |- A e. Met   &   |- B e. Met   &   |- C e. Met   &   |- J e. Met   &   |- K = (Open` A)   &   |- L = (Open` B)   &   |- M = (Open` C)   &   |- N = (Open` D)   &   |- Q = (Open` J)   &   |- D = {<.<.x, y>., z>. | ((x e. (Y X. Z) /\ y e. (Y X. Z)) /\ z = sup({((1st` x)B(1st`
 y)), ((2nd`
 x)C(2nd` y))}, RR, < ))}   &   |- O e. (N Cn Q)   &   |- H = {<.w, v>. | (w e. X /\ v = ((F` w)O(G` w)))}   =>   |- ((F e. (K Cn L) /\ G e. (K Cn M)) -> H e. (K Cn Q))
 
Theoremopr1cn 8189 Construct a continuous function H built from a function F and a constant applied to an operation O.
|- X = dom dom A   &   |- Y = dom dom B   &   |- Z = dom dom C   &   |- A e. Met   &   |- B e. Met   &   |- C e. Met   &   |- J e. Met   &   |- K = (Open` A)   &   |- L = (Open` B)   &   |- M = (Open` C)   &   |- N = (Open` D)   &   |- Q = (Open` J)   &   |- D = {<.<.x, y>., z>. | ((x e. (Y X. Z) /\ y e. (Y X. Z)) /\ z = sup({((1st` x)B(1st`
 y)), ((2nd`
 x)C(2nd` y))}, RR, < ))}   &   |- O e. (N Cn Q)   &   |- H = {<.w, v>. | (w e. X /\ v = ((F` w)OP))}   =>   |- ((F e. (K Cn L) /\ P e. Z) -> H e. (K Cn Q))
 
Theoremopr2cn 8190 Construct a continuous function H built from a function G and a constant applied to an operation O.
|- X = dom dom A   &   |- Y = dom dom B   &   |- Z = dom dom C   &   |- A e. Met   &   |- B e. Met   &   |- C e. Met   &   |- J e. Met   &   |- K = (Open` A)   &   |- L = (Open` B)   &   |- M = (Open` C)   &   |- N = (Open` D)   &   |- Q = (Open` J)   &   |- D = {<.<.x, y>., z>. | ((x e. (Y X. Z) /\ y e. (Y X. Z)) /\ z = sup({((1st` x)B(1st`
 y)), ((2nd`
 x)C(2nd` y))}, RR, < ))}   &   |- O e. (N Cn Q)   &   |- H = {<.w, v>. | (w e. X /\ v = (PO(G` w)))}   =>   |- ((P e. Y /\ G e. (K Cn M)) -> H e. (K Cn Q))
 
Theoremopr1scn 8191 Construct a continuous function G from a continuous operation O with the second argument held constant.
|- X = dom dom A   &   |- Y = dom dom B   &   |- A e. Met   &   |- B e. Met   &   |- C e. Met   &   |- D = {<.<.x, y>., z>. | ((x e. (X X. Y) /\ y e. (X X. Y)) /\ z = sup({((1st` x)A(1st`
 y)), ((2nd`
 x)B(2nd` y))}, RR, < ))}   &   |- J = (Open` A)   &   |- K = (Open` C)   &   |- L = (Open` D)   &   |- O e. (L Cn K)   &   |- G = {<.w, v>. | (w e. X /\ v = (wOP))}   =>   |- (P e. Y -> G e. (J Cn K))
 
Theorembopcnlem1 8192 Lemma for bopcn 8196.
 
Theorembopcnlem2 8193 Lemma for bopcn 8196.
 
Theorembopcnlem3 8194 Lemma for bopcn 8196.
 
Theorembopcnlem4 8195 Lemma for bopcn 8196.
 
Theorembopcn 8196 Conditions for a binary operation O on CC to be continuous.
|- C = (abs o. - )   &   |- D = {<.<.w, v>., u>. | ((w e. (CC X. CC) /\ v e. (CC X. CC)) /\ u = sup({((1st`
 w)C(1st` v)), ((2nd` w)C(2nd`
 v))}, RR, < ))}   &   |- J = (Open` C)   &   |- K = (Open` D)   &   |- O:(CC X. CC)-->CC   &   |- F = {<.k, r>. | (k e. NN /\ r = (1st` (h` k)))}   &   |- G = {<.k, r>. | (k e. NN /\ r = (2nd` (h` k)))}   &   |- (((1st` (h` k)) e. CC /\ (2nd` (h` k)) e. CC) -> ((1st` (h` k))O(2nd` (h` k))) e. CC)   &   |- (((F ~~> (1st` q) /\ G ~~> (2nd` q)) /\ (1 e. ZZ /\ A.m e. (ZZ>=` 1)((F` m) e. CC /\ (G` m) e. CC /\ (H` m) = ((F` m)O(G` m))))) -> H ~~> ((1st` q)O(2nd` q)))   &   |- H = {<.k, r>. | (k e. NN /\ r = (O` (h` k)))}   =>   |- O e. (K Cn J)
 
Theoremaddcn 8197 Complex number addition is a continuous function. Part of Proposition 14-4.16 of [Gleason] p. 243.
|- C = (abs o. - )   &   |- D = {<.<.w, v>., u>. | ((w e. (CC X. CC) /\ v e. (CC X. CC)) /\ u = sup({((1st`
 w)C(1st` v)), ((2nd` w)C(2nd`
 v))}, RR, < ))}   &   |- J = (Open` C)   &   |- K = (Open` D)   =>   |- + e. (K Cn J)
 
Theoremsubcn 8198 Complex number subtraction is a continuous function. Part of Proposition 14-4.16 of [Gleason] p. 243.
|- C = (abs o. - )   &   |- D = {<.<.w, v>., u>. | ((w e. (CC X. CC) /\ v e. (CC X. CC)) /\ u = sup({((1st`
 w)C(1st` v)), ((2nd` w)C(2nd`
 v))}, RR, < ))}   &   |- J = (Open` C)   &   |- K = (Open` D)   =>   |- - e. (K Cn J)
 
Theoremmulcn 8199 Complex number multiplication is a continuous function. Part of Proposition 14-4.16 of [Gleason] p. 243.
|- C = (abs o. - )   &   |- D = {<.<.w, v>., u>. | ((w e. (CC X. CC) /\ v e. (CC X. CC)) /\ u = sup({((1st`
 w)C(1st` v)), ((2nd` w)C(2nd`
 v))}, RR, < ))}   &   |- J = (Open` C)   &   |- K = (Open` D)   =>   |- x. e. (K Cn J)
 
Theoremfsumcnlem 8200 Lemma for fsumcn 8201. Warning: The HTML proof page is 0.4MB in size.

MPE Home   Contents Copyright terms: Public domain < Previous  Next >