let i1, i2 be Integer; :: thesis: for s being State-consisting of 0 , 0 , 0 ,<*(AddTo (dl. 0 ),(dl. 1))*> ^ <*(halt SCM )*>,<*i1*> ^ <*i2*> holds
( s is halting & LifeSpan s = 1 & (Result s) . (dl. 0 ) = i1 + i2 & ( for d being Data-Location st d <> dl. 0 holds
(Result s) . d = s . d ) )
let s be State-consisting of 0 , 0 , 0 ,<*(AddTo (dl. 0 ),(dl. 1))*> ^ <*(halt SCM )*>,<*i1*> ^ <*i2*>; :: thesis: ( s is halting & LifeSpan s = 1 & (Result s) . (dl. 0 ) = i1 + i2 & ( for d being Data-Location st d <> dl. 0 holds
(Result s) . d = s . d ) )
A1: ( IC s = il. 0 & s . (il. 0 ) = AddTo (dl. 0 ),(dl. 1) & s . (il. 1) = halt SCM & s . (dl. 0 ) = i1 & s . (dl. 1) = i2 ) by Th15;
set s0 = Computation s,0 ;
set s1 = Computation s,(0 + 1);
A2: s = Computation s,0 by AMI_1:13;
then A3: IC (Computation s,(0 + 1)) = il. (0 + 1) by A1, Th19;
A4: (Computation s,(0 + 1)) . (dl. 0 ) = ((Computation s,0 ) . (dl. 0 )) + ((Computation s,0 ) . (dl. 1)) by A1, A2, Th19;
thus s is halting by A1, A3, Th3; :: thesis: ( LifeSpan s = 1 & (Result s) . (dl. 0 ) = i1 + i2 & ( for d being Data-Location st d <> dl. 0 holds
(Result s) . d = s . d ) )
thus LifeSpan s = 1 by A1, A2, A3, Th17; :: thesis: ( (Result s) . (dl. 0 ) = i1 + i2 & ( for d being Data-Location st d <> dl. 0 holds
(Result s) . d = s . d ) )
thus (Result s) . (dl. 0 ) = i1 + i2 by A1, A2, A3, A4, Th4; :: thesis: for d being Data-Location st d <> dl. 0 holds
(Result s) . d = s . d
let d be Data-Location ; :: thesis: ( d <> dl. 0 implies (Result s) . d = s . d )
assume A5: d <> dl. 0 ; :: thesis: (Result s) . d = s . d
thus (Result s) . d = (Computation s,(0 + 1)) . d by A1, A3, Th4
.= s . d by A1, A2, A5, Th19 ; :: thesis: verum