:: LIMFUNC3 semantic presentation
:: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm1:
for X, Y, Z being set st X c= Y \ Z holds
X c= Y
Lm2:
for g, r, r1 being real number st 0 < g & r <= r1 holds
( r - g < r1 & r < r1 + g )
Lm3:
for seq being Real_Sequence
for f1, f2 being PartFunc of REAL , REAL
for X being set st rng seq c= (dom (f1 (#) f2)) \ X holds
( rng seq c= dom (f1 (#) f2) & dom (f1 (#) f2) = (dom f1) /\ (dom f2) & rng seq c= dom f1 & rng seq c= dom f2 & rng seq c= (dom f1) \ X & rng seq c= (dom f2) \ X )
Lm4:
for r being Real
for n being Nat holds
( r - (1 / (n + 1)) < r & r < r + (1 / (n + 1)) )
Lm5:
for n being Nat holds 0 < 1 / (n + 1)
by XREAL_1:141;
Lm6:
for seq being Real_Sequence
for f1, f2 being PartFunc of REAL , REAL
for X being set st rng seq c= (dom (f1 + f2)) \ X holds
( rng seq c= dom (f1 + f2) & dom (f1 + f2) = (dom f1) /\ (dom f2) & rng seq c= dom f1 & rng seq c= dom f2 & rng seq c= (dom f1) \ X & rng seq c= (dom f2) \ X )
theorem Th1: :: LIMFUNC3:1
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th2: :: LIMFUNC3:2
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th3: :: LIMFUNC3:3
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th4: :: LIMFUNC3:4
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th5: :: LIMFUNC3:5
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th6: :: LIMFUNC3:6
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th7: :: LIMFUNC3:7
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th8: :: LIMFUNC3:8
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
x0 being
Real for
f being
PartFunc of
REAL ,
REAL holds
( ( for
r1,
r2 being
Real st
r1 < x0 &
x0 < r2 holds
ex
g1,
g2 being
Real st
(
r1 < g1 &
g1 < x0 &
g1 in dom f &
g2 < r2 &
x0 < g2 &
g2 in dom f ) ) iff ( ( for
r being
Real st
r < x0 holds
ex
g being
Real st
(
r < g &
g < x0 &
g in dom f ) ) & ( for
r being
Real st
x0 < r holds
ex
g being
Real st
(
g < r &
x0 < g &
g in dom f ) ) ) )
:: deftheorem Def1 defines is_convergent_in LIMFUNC3:def 1 :
:: deftheorem Def2 defines is_divergent_to+infty_in LIMFUNC3:def 2 :
:: deftheorem Def3 defines is_divergent_to-infty_in LIMFUNC3:def 3 :
theorem :: LIMFUNC3:9
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem :: LIMFUNC3:10
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem :: LIMFUNC3:11
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem :: LIMFUNC3:12
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:13
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:14
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th15: :: LIMFUNC3:15
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th16: :: LIMFUNC3:16
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:17
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:18
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:19
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:20
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:21
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:22
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th23: :: LIMFUNC3:23
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:24
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th25: :: LIMFUNC3:25
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:26
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th27: :: LIMFUNC3:27
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
x0 being
Real for
f1,
f being
PartFunc of
REAL ,
REAL st
f1 is_divergent_to+infty_in x0 & ( for
r1,
r2 being
Real st
r1 < x0 &
x0 < r2 holds
ex
g1,
g2 being
Real st
(
r1 < g1 &
g1 < x0 &
g1 in dom f &
g2 < r2 &
x0 < g2 &
g2 in dom f ) ) & ex
r being
Real st
( 0
< r &
(dom f) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) c= (dom f1) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) & ( for
g being
Real st
g in (dom f) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) holds
f1 . g <= f . g ) ) holds
f is_divergent_to+infty_in x0
theorem Th28: :: LIMFUNC3:28
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
x0 being
Real for
f1,
f being
PartFunc of
REAL ,
REAL st
f1 is_divergent_to-infty_in x0 & ( for
r1,
r2 being
Real st
r1 < x0 &
x0 < r2 holds
ex
g1,
g2 being
Real st
(
r1 < g1 &
g1 < x0 &
g1 in dom f &
g2 < r2 &
x0 < g2 &
g2 in dom f ) ) & ex
r being
Real st
( 0
< r &
(dom f) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) c= (dom f1) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) & ( for
g being
Real st
g in (dom f) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) holds
f . g <= f1 . g ) ) holds
f is_divergent_to-infty_in x0
theorem :: LIMFUNC3:29
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:30
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
:: deftheorem Def4 defines lim LIMFUNC3:def 4 :
theorem :: LIMFUNC3:31
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem :: LIMFUNC3:32
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th33: :: LIMFUNC3:33
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:34
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th35: :: LIMFUNC3:35
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th36: :: LIMFUNC3:36
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th37: :: LIMFUNC3:37
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:38
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:39
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:40
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th41: :: LIMFUNC3:41
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th42: :: LIMFUNC3:42
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:43
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:44
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th45: :: LIMFUNC3:45
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
x0 being
Real for
f1,
f2,
f being
PartFunc of
REAL ,
REAL st
f1 is_convergent_in x0 &
f2 is_convergent_in x0 &
lim f1,
x0 = lim f2,
x0 & ( for
r1,
r2 being
Real st
r1 < x0 &
x0 < r2 holds
ex
g1,
g2 being
Real st
(
r1 < g1 &
g1 < x0 &
g1 in dom f &
g2 < r2 &
x0 < g2 &
g2 in dom f ) ) & ex
r being
Real st
( 0
< r & ( for
g being
Real st
g in (dom f) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) holds
(
f1 . g <= f . g &
f . g <= f2 . g ) ) & ( (
(dom f1) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) c= (dom f2) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) &
(dom f) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) c= (dom f1) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) ) or (
(dom f2) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) c= (dom f1) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) &
(dom f) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) c= (dom f2) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) ) ) ) holds
(
f is_convergent_in x0 &
lim f,
x0 = lim f1,
x0 )
theorem :: LIMFUNC3:46
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
x0 being
Real for
f1,
f2,
f being
PartFunc of
REAL ,
REAL st
f1 is_convergent_in x0 &
f2 is_convergent_in x0 &
lim f1,
x0 = lim f2,
x0 & ex
r being
Real st
( 0
< r &
].(x0 - r),x0.[ \/ ].x0,(x0 + r).[ c= ((dom f1) /\ (dom f2)) /\ (dom f) & ( for
g being
Real st
g in ].(x0 - r),x0.[ \/ ].x0,(x0 + r).[ holds
(
f1 . g <= f . g &
f . g <= f2 . g ) ) ) holds
(
f is_convergent_in x0 &
lim f,
x0 = lim f1,
x0 )
theorem :: LIMFUNC3:47
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
x0 being
Real for
f1,
f2 being
PartFunc of
REAL ,
REAL st
f1 is_convergent_in x0 &
f2 is_convergent_in x0 & ex
r being
Real st
( 0
< r & ( (
(dom f1) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) c= (dom f2) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) & ( for
g being
Real st
g in (dom f1) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) holds
f1 . g <= f2 . g ) ) or (
(dom f2) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) c= (dom f1) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) & ( for
g being
Real st
g in (dom f2) /\ (].(x0 - r),x0.[ \/ ].x0,(x0 + r).[) holds
f1 . g <= f2 . g ) ) ) ) holds
lim f1,
x0 <= lim f2,
x0
theorem :: LIMFUNC3:48
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:49
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:50
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:51
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: LIMFUNC3:52
:: Showing IDV graph ... (Click the Palm Tree again to close it) 