:: HEINE semantic presentation  Show TPTP formulae Show IDV graph for whole article:: Showing IDV graph ... (Click the Palm Trees again to close it)

theorem Th1: :: HEINE:1  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x, y being real number
for A being SubSpace of RealSpace
for p, q being Point of A st x = p & y = q holds
dist p,q = abs (x - y)
proof end;

theorem Th2: :: HEINE:2  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x, y, z being real number st x <= y & y <= z holds
[.x,y.] \/ [.y,z.] = [.x,z.]
proof end;

Lm1: for x, a, b being real number st x >= 0 & a + x <= b holds
a <= b
by XREAL_1:42;

Lm2: for x, a, b being real number st x >= 0 & a - x >= b holds
a >= b
by XREAL_1:53;

theorem :: HEINE:3  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem :: HEINE:4  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem Th5: :: HEINE:5  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x being real number
for k being Nat st x > 0 holds
x |^ k > 0
proof end;

theorem Th6: :: HEINE:6  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for n being Nat
for seq being Real_Sequence st seq is increasing & rng seq c= NAT holds
n <= seq . n
proof end;

definition
let seq be Real_Sequence;
let k be Nat;
func k to_power seq -> Real_Sequence means :Def1: :: HEINE:def 1
for n being Nat holds it . n = k to_power (seq . n);
existence
ex b1 being Real_Sequence st
for n being Nat holds b1 . n = k to_power (seq . n)
proof end;
uniqueness
for b1, b2 being Real_Sequence st ( for n being Nat holds b1 . n = k to_power (seq . n) ) & ( for n being Nat holds b2 . n = k to_power (seq . n) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def1 defines to_power HEINE:def 1 :
for seq being Real_Sequence
for k being Nat
for b3 being Real_Sequence holds
( b3 = k to_power seq iff for n being Nat holds b3 . n = k to_power (seq . n) );

defpred S1[ Nat] means 2 |^ $1 >= $1 + 1;

Lm3: S1[0]
by NEWTON:9;

Lm4: for n being Nat st S1[n] holds
S1[n + 1]
proof end;

theorem Th7: :: HEINE:7  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for n being Nat holds 2 |^ n >= n + 1
proof end;

theorem Th8: :: HEINE:8  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for n being Nat holds 2 |^ n > n
proof end;

theorem Th9: :: HEINE:9  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for seq being Real_Sequence st seq is divergent_to+infty holds
2 to_power seq is divergent_to+infty
proof end;

theorem Th10: :: HEINE:10  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for T being TopSpace st the carrier of T is finite holds
T is compact
proof end;

theorem :: HEINE:11  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for a, b being real number st a <= b holds
Closed-Interval-TSpace a,b is compact
proof end;