:: UNIFORM1 semantic presentation
theorem Th1: :: UNIFORM1:1
canceled;
theorem Th2: :: UNIFORM1:2
:: deftheorem Def1 defines uniformly_continuous UNIFORM1:def 1 :
theorem Th3: :: UNIFORM1:3
theorem Th4: :: UNIFORM1:4
theorem Th5: :: UNIFORM1:5
theorem Th6: :: UNIFORM1:6
theorem Th7: :: UNIFORM1:7
theorem Th8: :: UNIFORM1:8
Lemma142:
Closed-Interval-TSpace 0,1 = TopSpaceMetr (Closed-Interval-MSpace 0,1)
by TOPMETR:def 8;
Lemma143:
I[01] = TopSpaceMetr (Closed-Interval-MSpace 0,1)
by TOPMETR:27, TOPMETR:def 8;
Lemma144:
the carrier of I[01] = the carrier of (Closed-Interval-MSpace 0,1)
by , TOPMETR:16, TOPMETR:27;
theorem Th9: :: UNIFORM1:9
theorem Th10: :: UNIFORM1:10
theorem Th11: :: UNIFORM1:11
Lemma147:
for x being set
for f being FinSequence holds
( len (f ^ <*x*>) = (len f) + 1 & len (<*x*> ^ f) = (len f) + 1 & (f ^ <*x*>) . ((len f) + 1) = x & (<*x*> ^ f) . 1 = x )
Lemma148:
for x being set
for f being FinSequence st 1 <= len f holds
( (f ^ <*x*>) . 1 = f . 1 & (<*x*> ^ f) . ((len f) + 1) = f . (len f) )
theorem Th12: :: UNIFORM1:12
canceled;
theorem Th13: :: UNIFORM1:13
Lemma150:
for r, s1, s2 being Real holds
( r in [.s1,s2.] iff ( s1 <= r & r <= s2 ) )
theorem Th14: :: UNIFORM1:14
:: deftheorem Def2 defines decreasing UNIFORM1:def 2 :
Lemma154:
for f being FinSequence of REAL st ( for k being Element of NAT st 1 <= k & k < len f holds
f /. k < f /. (k + 1) ) holds
f is increasing
Lemma156:
for f being FinSequence of REAL st ( for k being Element of NAT st 1 <= k & k < len f holds
f /. k > f /. (k + 1) ) holds
f is decreasing
theorem Th15: :: UNIFORM1:15
theorem Th16: :: UNIFORM1:16