:: UNIFORM1 semantic presentation
:: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem :: UNIFORM1:1
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem Th2: :: UNIFORM1:2
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
r being
Real st
r > 0 holds
ex
n being
Nat st
(
n > 0 & 1
/ n < r )
:: deftheorem Def1 defines uniformly_continuous UNIFORM1:def 1 :
theorem Th3: :: UNIFORM1:3
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th4: :: UNIFORM1:4
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th5: :: UNIFORM1:5
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: UNIFORM1:6
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th7: :: UNIFORM1:7
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th8: :: UNIFORM1:8
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm1:
Closed-Interval-TSpace 0,1 = TopSpaceMetr (Closed-Interval-MSpace 0,1)
by TOPMETR:def 8;
Lm2:
I[01] = TopSpaceMetr (Closed-Interval-MSpace 0,1)
by TOPMETR:27, TOPMETR:def 8;
Lm3:
the carrier of I[01] = the carrier of (Closed-Interval-MSpace 0,1)
by Lm1, TOPMETR:16, TOPMETR:27;
theorem Th9: :: UNIFORM1:9
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: UNIFORM1:10
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th11: :: UNIFORM1:11
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm4:
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 )
Lm5:
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 :: UNIFORM1:12
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem Th13: :: UNIFORM1:13
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm6:
for r, s1, s2 being Real holds
( r in [.s1,s2.] iff ( s1 <= r & r <= s2 ) )
theorem Th14: :: UNIFORM1:14
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
:: deftheorem Def2 defines decreasing UNIFORM1:def 2 :
Lm7:
for f being FinSequence of REAL st ( for k being Nat st 1 <= k & k < len f holds
f /. k < f /. (k + 1) ) holds
f is increasing
Lm8:
for f being FinSequence of REAL st ( for k being Nat st 1 <= k & k < len f holds
f /. k > f /. (k + 1) ) holds
f is decreasing
theorem :: UNIFORM1:15
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: UNIFORM1:16
:: Showing IDV graph ... (Click the Palm Tree again to close it) 