let P be Instruction-Sequence of SCMPDS; :: thesis:
let s be 0 -started State of SCMPDS; :: thesis:
let I be halt-free shiftable Program of SCMPDS; :: thesis:
let a be Int_position ; :: thesis:
let i, c be Integer; :: thesis:
let X, Y be set ; :: thesis:
let f be Function of (product the Object-Kind of SCMPDS),NAT; :: thesis:
set b = DataLoc ((s . a),i);
set WHL = while>0 (a,i,I);
set pWHL = stop (while>0 (a,i,I));
set pI = stop I;
set i1 = (a,i) <=0_goto ((card I) + 2);
set i2 = goto (- ((card I) + 1));
defpred S₁[ Element of NAT ] means for t being 0 -started State of SCMPDS
for Q being Instruction-Sequence of SCMPDS st f . t <= $1 & ( for x being Int_position st x in X holds
t . x >= c + (t . (DataLoc ((s . a),i))) ) & ( for x being Int_position st x in Y holds
t . x = s . x ) & t . a = s . a holds
( while>0 (a,i,I) is_closed_on t,Q & while>0 (a,i,I) is_halting_on t,Q );
assume A2: for t being 0 -started State of SCMPDS st f . t = 0 holds
t . (DataLoc ((s . a),i)) <= 0 ; :: thesis:
assume A3: for x being Int_position st x in X holds
s . x >= c + (s . (DataLoc ((s . a),i))) ; :: thesis:
assume A4: for t being 0 -started State of SCMPDS
for Q being Instruction-Sequence of SCMPDS st ( for x being Int_position st x in X holds
t . x >= c + (t . (DataLoc ((s . a),i))) ) & ( for x being Int_position st x in Y holds
t . x = s . x ) & t . a = s . a & t . (DataLoc ((s . a),i)) > 0 holds
( (IExec (I,Q,t)) . a = t . a & I is_closed_on t,Q & I is_halting_on t,Q & f . (Initialize (IExec (I,Q,t))) < f . t & ( for x being Int_position st x in X holds
(IExec (I,Q,t)) . x >= c + ((IExec (I,Q,t)) . (DataLoc ((s . a),i))) ) & ( for x being Int_position st x in Y holds
(IExec (I,Q,t)) . x = t . x ) ) ; :: thesis:
A5: for k being Element of NAT st S₁[k] holds
S₁[k + 1]

proof

let k be Element of NAT ; :: thesis:
assume A6: S₁[k] ; :: thesis:

now

let t be 0 -started State of SCMPDS; :: thesis:
let Q be Instruction-Sequence of SCMPDS; :: thesis:
T: Initialize t = t by MEMSTR_0:44;
assume A7: f . t <= k + 1 ; :: thesis:
assume A8: for x being Int_position st x in X holds
t . x >= c + (t . (DataLoc ((s . a),i))) ; :: thesis:
assume A9: for x being Int_position st x in Y holds
t . x = s . x ; :: thesis:
assume A10: t . a = s . a ; :: thesis:

per cases ;

suppose t . (DataLoc ((s . a),i)) <= 0 ; :: thesis:

hence ( while>0 (a,i,I) is_closed_on t,Q & while>0 (a,i,I) is_halting_on t,Q ) by A10, Th20; :: thesis:

end;

suppose A11: t . (DataLoc ((s . a),i)) > 0 ; :: thesis:

A15: 0 in dom (stop (while>0 (a,i,I))) by COMPOS_1:36;
A18: while>0 (a,i,I) = ((a,i) <=0_goto ((card I) + 2)) ';' (I ';' (goto (- ((card I) + 1)))) by SCMPDS_4:15;
set Q2 = Q +* (stop I);
set Q3 = Q +* (stop (while>0 (a,i,I)));
set t4 = Comput ((Q +* (stop (while>0 (a,i,I)))),t,1);
set Q4 = Q +* (stop (while>0 (a,i,I)));
A21: stop I c= Q +* (stop I) by FUNCT_4:25;
A22: Comput ((Q +* (stop (while>0 (a,i,I)))),t,(0 + 1)) = Following ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,0))) by EXTPRO_1:3
.= Following ((Q +* (stop (while>0 (a,i,I)))),t) by EXTPRO_1:2
.= Exec (((a,i) <=0_goto ((card I) + 2)),t) by A18, SCMPDS_6:11, T ;
for a being Int_position holds t . a = (Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)) . a by A22, SCMPDS_2:56;
then A24: DataPart t = DataPart (Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)) by SCMPDS_4:8;
XX: while>0 (a,i,I) c= stop (while>0 (a,i,I)) by AFINSQ_1:74;
stop (while>0 (a,i,I)) c= Q +* (stop (while>0 (a,i,I))) by FUNCT_4:25;
then A25: while>0 (a,i,I) c= Q +* (stop (while>0 (a,i,I))) by XX, XBOOLE_1:1;
Shift (I,1) c= while>0 (a,i,I) by Lm4;
then A26: Shift (I,1) c= Q +* (stop (while>0 (a,i,I))) by A25, XBOOLE_1:1;
A27: IExec (I,Q,t) = Result ((Q +* (stop I)),t) by SCMPDS_4:def 5;
set m2 = LifeSpan ((Q +* (stop I)),t);
set t5 = Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),(LifeSpan ((Q +* (stop I)),t)));
set Q5 = Q +* (stop (while>0 (a,i,I)));
set l1 = (card I) + 1;
A28: IC t = 0 by MEMSTR_0:def 8;
set m3 = (LifeSpan ((Q +* (stop I)),t)) + 1;
set t6 = Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1));
set Q6 = Q +* (stop (while>0 (a,i,I)));
set t7 = Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1));
set Q7 = Q +* (stop (while>0 (a,i,I)));
(card I) + 1 < (card I) + 2 by XREAL_1:6;
then A29: (card I) + 1 in dom (while>0 (a,i,I)) by Th18;
A30: I is_closed_on t,Q by A4, A8, A9, A10, A11;
A31: I is_closed_on t,Q +* (stop I) by A4, A8, A9, A10, A11;
I is_halting_on t,Q by A4, A8, A9, A10, A11;
then A32: Q +* (stop I) halts_on t by SCMPDS_6:def 3, T;
(Q +* (stop I)) +* (stop I) halts_on t by A32, FUNCT_4:25, FUNCT_4:98;
then A34: I is_halting_on t,Q +* (stop I) by SCMPDS_6:def 3, T;
A35: IC (Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)) = succ (IC t) by A11, A22, SCMPDS_2:56, A10
.= 0 + 1 by A28 ;
then A36: IC (Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),(LifeSpan ((Q +* (stop I)),t)))) = (card I) + 1 by A21, A34, A31, A24, A26, SCMPDS_7:18;
A37: (Q +* (stop (while>0 (a,i,I)))) /. (IC (Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1)))) = (Q +* (stop (while>0 (a,i,I)))) . (IC (Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1)))) by PBOOLE:143;
A38: Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1)) = Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),(LifeSpan ((Q +* (stop I)),t))) by EXTPRO_1:4;
then A39: CurInstr ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1)))) = (Q +* (stop (while>0 (a,i,I)))) . ((card I) + 1) by A21, A34, A31, A35, A24, A26, A37, SCMPDS_7:18
.= (while>0 (a,i,I)) . ((card I) + 1) by A29, A25, GRFUNC_1:2
.= goto (- ((card I) + 1)) by Th19 ;
A41: Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1)) = Following ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1)))) by EXTPRO_1:3
.= Exec ((goto (- ((card I) + 1))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1)))) by A39 ;
then IC (Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) = ICplusConst ((Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1))),(0 - ((card I) + 1))) by SCMPDS_2:54
.= 0 by A36, A38, SCMPDS_7:1 ;
then A42: Initialize (Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) = Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1)) by MEMSTR_0:46;
A43: DataPart (Comput ((Q +* (stop I)),t,(LifeSpan ((Q +* (stop I)),t)))) = DataPart (Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),(LifeSpan ((Q +* (stop I)),t)))) by A21, A34, A31, A35, A24, A26, SCMPDS_7:18;
then A44: DataPart (Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),(LifeSpan ((Q +* (stop I)),t)))) = DataPart (Result ((Q +* (stop I)),t)) by A32, EXTPRO_1:23
.= DataPart (IExec (I,Q,t)) by SCMPDS_4:def 5 ;

A45: now

let x be Int_position ; :: thesis:
assume A46: x in Y ; :: thesis:
thus (Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) . x = (Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),(LifeSpan ((Q +* (stop I)),t)))) . x by A38, A41, SCMPDS_2:54
.= (IExec (I,Q,t)) . x by A44, SCMPDS_3:3
.= t . x by A4, A8, A9, A10, A11, A46
.= s . x by A9, A46 ; :: thesis:

end;

InsCode (goto (- ((card I) + 1))) = 0 by SCMPDS_2:12;
then InsCode (goto (- ((card I) + 1))) in {0,4,5,6} by ENUMSET1:def 2;
then A47: Initialize (Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) = Initialize (Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1))) by A41, Th3
.= Initialize (IExec (I,Q,t)) by A44, A38, MEMSTR_0:80 ;

A48: now

f . (Initialize (IExec (I,Q,t))) < f . (Initialize t) by A4, A8, A9, A10, A11, T;
then A49: f . (Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) < k + 1 by A7, A47, XXREAL_0:2, A42, T;
assume f . (Initialize (Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1)))) > k ; :: thesis:
hence contradiction by A49, INT_1:7, A42; :: thesis:

end;

A50: (Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) . (DataLoc ((s . a),i)) = (Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),(LifeSpan ((Q +* (stop I)),t)))) . (DataLoc ((s . a),i)) by A38, A41, SCMPDS_2:54
.= (IExec (I,Q,t)) . (DataLoc ((s . a),i)) by A44, SCMPDS_3:3 ;

A51: now

let x be Int_position ; :: thesis:
assume A52: x in X ; :: thesis:
(Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) . x = (Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),(LifeSpan ((Q +* (stop I)),t)))) . x by A38, A41, SCMPDS_2:54
.= (IExec (I,Q,t)) . x by A44, SCMPDS_3:3 ;
hence (Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) . x >= c + ((Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) . (DataLoc ((s . a),i))) by A4, A8, A9, A10, A11, A50, A52; :: thesis:

end;

A53: (Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),(LifeSpan ((Q +* (stop I)),t)))) . a = (Comput ((Q +* (stop I)),t,(LifeSpan ((Q +* (stop I)),t)))) . a by A43, SCMPDS_4:8
.= (Result ((Q +* (stop I)),t)) . a by A32, EXTPRO_1:23
.= s . a by A10, A4, A8, A9, A11, A27 ;
A55: (Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))) . a = (Comput ((Q +* (stop (while>0 (a,i,I)))),t,((LifeSpan ((Q +* (stop I)),t)) + 1))) . a by A41, SCMPDS_2:54
.= s . a by A53, EXTPRO_1:4 ;
then A56: while>0 (a,i,I) is_closed_on Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1)),Q +* (stop (while>0 (a,i,I))) by A6, A51, A45, A48, A42;

now

let k be Element of NAT ; :: thesis:

per cases ;

suppose k < ((LifeSpan ((Q +* (stop I)),t)) + 1) + 1 ; :: thesis:

then A57: k <= (LifeSpan ((Q +* (stop I)),t)) + 1 by INT_1:7;

hereby :: thesis:

per cases by A57, NAT_1:8;

suppose A58: k <= LifeSpan ((Q +* (stop I)),t) ; :: thesis:

hereby :: thesis:

per cases ;

suppose k = 0 ; :: thesis:

hence IC (Comput ((Q +* (stop (while>0 (a,i,I)))),t,k)) in dom (stop (while>0 (a,i,I))) by A15, A28, EXTPRO_1:2; :: thesis:

end;

suppose k <> 0 ; :: thesis:

then consider kn being Nat such that
A59: k = kn + 1 by NAT_1:6;
reconsider kn = kn as Element of NAT by ORDINAL1:def 12;
reconsider lm = IC (Comput ((Q +* (stop I)),t,kn)) as Element of NAT ;
kn < k by A59, XREAL_1:29;
then kn < LifeSpan ((Q +* (stop I)),t) by A58, XXREAL_0:2;
then (IC (Comput ((Q +* (stop I)),t,kn))) + 1 = IC (Comput ((Q +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,1)),kn)) by A21, A34, A31, A35, A24, A26, SCMPDS_7:16;
then A61: IC (Comput ((Q +* (stop (while>0 (a,i,I)))),t,k)) = lm + 1 by A59, EXTPRO_1:4;
IC (Comput ((Q +* (stop I)),t,kn)) in dom (stop I) by A30, SCMPDS_6:def 2, T;
then lm < card (stop I) by AFINSQ_1:66;
then lm < (card I) + 1 by COMPOS_1:55;
then A62: lm + 1 <= (card I) + 1 by INT_1:7;
(card I) + 1 < (card I) + 3 by XREAL_1:6;
then lm + 1 < (card I) + 3 by A62, XXREAL_0:2;
then lm + 1 < card (stop (while>0 (a,i,I))) by Lm3;
hence IC (Comput ((Q +* (stop (while>0 (a,i,I)))),t,k)) in dom (stop (while>0 (a,i,I))) by A61, AFINSQ_1:66; :: thesis:

end;

suppose A63: k = (LifeSpan ((Q +* (stop I)),t)) + 1 ; :: thesis:

(card I) + 1 in dom (stop (while>0 (a,i,I))) by A29, COMPOS_1:62;
hence IC (Comput ((Q +* (stop (while>0 (a,i,I)))),t,k)) in dom (stop (while>0 (a,i,I))) by A21, A34, A31, A35, A24, A26, A38, A63, SCMPDS_7:18; :: thesis:

end;

suppose k >= ((LifeSpan ((Q +* (stop I)),t)) + 1) + 1 ; :: thesis:

then consider nn being Nat such that
A64: k = (((LifeSpan ((Q +* (stop I)),t)) + 1) + 1) + nn by NAT_1:10;
A66: nn in NAT by ORDINAL1:def 12;
Q +* (stop (while>0 (a,i,I))) = (Q +* (stop (while>0 (a,i,I)))) +* (stop (while>0 (a,i,I))) by FUNCT_4:93;
then Comput ((Q +* (stop (while>0 (a,i,I)))),t,k) = Comput (((Q +* (stop (while>0 (a,i,I)))) +* (stop (while>0 (a,i,I)))),(Comput ((Q +* (stop (while>0 (a,i,I)))),t,(((LifeSpan ((Q +* (stop I)),t)) + 1) + 1))),nn) by A64, A66, EXTPRO_1:4;
hence IC (Comput ((Q +* (stop (while>0 (a,i,I)))),t,k)) in dom (stop (while>0 (a,i,I))) by A56, A66, SCMPDS_6:def 2, A42; :: thesis:

end;

end;

hence S₁[k + 1] ; :: thesis:

end;

set n = f . s;
A67: for x being Int_position st x in Y holds
s . x = s . x ;
A68: S₁[ 0 ]

proof

let t be 0 -started State of SCMPDS; :: thesis:
let Q be Instruction-Sequence of SCMPDS; :: thesis:
assume f . t <= 0 ; :: thesis:
then f . t = 0 ;
then A69: t . (DataLoc ((s . a),i)) <= 0 by A2;
assume for x being Int_position st x in X holds
t . x >= c + (t . (DataLoc ((s . a),i))) ; :: thesis:
assume for x being Int_position st x in Y holds
t . x = s . x ; :: thesis:
assume t . a = s . a ; :: thesis:
hence ( while>0 (a,i,I) is_closed_on t,Q & while>0 (a,i,I) is_halting_on t,Q ) by A69, Th20; :: thesis:

end;

for k being Element of NAT holds S₁[k] from NAT_1:sch 1(A68, A5);
then S₁[f . s] ;
hence ( while>0 (a,i,I) is_closed_on s,P & while>0 (a,i,I) is_halting_on s,P ) by A3, A67; :: thesis: