:: UNIFORM1 semantic presentation
theorem Th1: :: UNIFORM1:1
canceled;
theorem Th2: :: UNIFORM1:2
for
b1 being
Real st
b1 > 0 holds
ex
b2 being
Nat st
(
b2 > 0 & 1
/ b2 < b1 )
:: 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
Lemma8:
Closed-Interval-TSpace 0,1 = TopSpaceMetr (Closed-Interval-MSpace 0,1)
by TOPMETR:def 8;
Lemma9:
I[01] = TopSpaceMetr (Closed-Interval-MSpace 0,1)
by TOPMETR:27, TOPMETR:def 8;
Lemma10:
the carrier of I[01] = the carrier of (Closed-Interval-MSpace 0,1)
by Lemma8, TOPMETR:16, TOPMETR:27;
theorem Th9: :: UNIFORM1:9
theorem Th10: :: UNIFORM1:10
theorem Th11: :: UNIFORM1:11
Lemma13:
for b1 being set
for b2 being FinSequence holds
( len (b2 ^ <*b1*>) = (len b2) + 1 & len (<*b1*> ^ b2) = (len b2) + 1 & (b2 ^ <*b1*>) . ((len b2) + 1) = b1 & (<*b1*> ^ b2) . 1 = b1 )
Lemma14:
for b1 being set
for b2 being FinSequence st 1 <= len b2 holds
( (b2 ^ <*b1*>) . 1 = b2 . 1 & (<*b1*> ^ b2) . ((len b2) + 1) = b2 . (len b2) )
theorem Th12: :: UNIFORM1:12
canceled;
theorem Th13: :: UNIFORM1:13
Lemma16:
for b1, b2, b3 being Real holds
( b1 in [.b2,b3.] iff ( b2 <= b1 & b1 <= b3 ) )
theorem Th14: :: UNIFORM1:14
:: deftheorem Def2 defines decreasing UNIFORM1:def 2 :
Lemma19:
for b1 being FinSequence of REAL st ( for b2 being Nat st 1 <= b2 & b2 < len b1 holds
b1 /. b2 < b1 /. (b2 + 1) ) holds
b1 is increasing
Lemma20:
for b1 being FinSequence of REAL st ( for b2 being Nat st 1 <= b2 & b2 < len b1 holds
b1 /. b2 > b1 /. (b2 + 1) ) holds
b1 is decreasing
theorem Th15: :: UNIFORM1:15
theorem Th16: :: UNIFORM1:16