let P be IterativeAlgorithm (AddTo ((dl. 2),(dl. 1))) -extending Instruction-Sequence of SCM; :: thesis: for s being 0 -started State-consisting of <%1,F2(),F1()%> holds
( ( for k being Nat st k < F2() holds
( (Comput (P,s,((4 * k) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * k) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * k) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * k) + 3))) . (dl. 2) = (Comput (P,s,((4 * k) + 2))) . (dl. 2) & (Comput (P,s,((4 * k) + 4))) . (dl. 2) = (Comput (P,s,((4 * k) + 3))) . (dl. 2) ) ) & ( for k, j being Nat st k >= F2() holds
(Comput (P,s,(((4 * k) + 1) + j))) . (dl. 2) = F3(F2()) ) & (Result (P,s)) . (dl. 2) = F3(F2()) )

A3: IterativeAlgorithm (AddTo ((dl. 2),(dl. 1))) c= P by PROOFS_1:def 12;
let s be 0 -started State-consisting of <%1,F2(),F1()%>; :: thesis: ( ( for k being Nat st k < F2() holds
( (Comput (P,s,((4 * k) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * k) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * k) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * k) + 3))) . (dl. 2) = (Comput (P,s,((4 * k) + 2))) . (dl. 2) & (Comput (P,s,((4 * k) + 4))) . (dl. 2) = (Comput (P,s,((4 * k) + 3))) . (dl. 2) ) ) & ( for k, j being Nat st k >= F2() holds
(Comput (P,s,(((4 * k) + 1) + j))) . (dl. 2) = F3(F2()) ) & (Result (P,s)) . (dl. 2) = F3(F2()) )

A4: P . 1 = halt SCM by A3, Th8;
set s0 = Comput (P,s,0);
set s1 = Comput (P,s,(0 + 1));
set s2 = Comput (P,s,(1 + 1));
set s3 = Comput (P,s,(2 + 1));
set s4 = Comput (P,s,(3 + 1));
set s5 = Comput (P,s,(4 + 1));
A5: IC (Comput (P,s,0)) = 0 by MEMSTR_0:def 12;
A6: (Comput (P,s,0)) . (dl. 1) = F2() by Th14;
A7: (Comput (P,s,0)) . (dl. 2) = F1() by Th14;
A8: (Comput (P,s,(0 + 1))) . (dl. 1) = (Comput (P,s,0)) . (dl. 1) by A3, A5, Th16;
A9: (Comput (P,s,(0 + 1))) . (dl. 2) = (Comput (P,s,0)) . (dl. 2) by A3, A5, Th16;
per cases ( F2() = 0 or ex K being Nat st F2() = K + 1 ) by NAT_1:6;
suppose A10: F2() = 0 ; :: thesis: ( ( for k being Nat st k < F2() holds
( (Comput (P,s,((4 * k) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * k) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * k) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * k) + 3))) . (dl. 2) = (Comput (P,s,((4 * k) + 2))) . (dl. 2) & (Comput (P,s,((4 * k) + 4))) . (dl. 2) = (Comput (P,s,((4 * k) + 3))) . (dl. 2) ) ) & ( for k, j being Nat st k >= F2() holds
(Comput (P,s,(((4 * k) + 1) + j))) . (dl. 2) = F3(F2()) ) & (Result (P,s)) . (dl. 2) = F3(F2()) )

then A11: P . (IC (Comput (P,s,(0 + 1)))) = halt SCM by A4, A3, A5, A6, Th16;
thus for k being Nat st k < F2() holds
( (Comput (P,s,((4 * k) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * k) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * k) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * k) + 3))) . (dl. 2) = (Comput (P,s,((4 * k) + 2))) . (dl. 2) & (Comput (P,s,((4 * k) + 4))) . (dl. 2) = (Comput (P,s,((4 * k) + 3))) . (dl. 2) ) by A10; :: thesis: ( ( for k, j being Nat st k >= F2() holds
(Comput (P,s,(((4 * k) + 1) + j))) . (dl. 2) = F3(F2()) ) & (Result (P,s)) . (dl. 2) = F3(F2()) )

defpred S1[ Nat] means for j being Nat st $1 >= F2() holds
(Comput (P,s,(((4 * $1) + 1) + j))) . (dl. 2) = F3(F2());
A12: S1[ 0 ]
proof
let j be Nat; :: thesis: ( 0 >= F2() implies (Comput (P,s,(((4 * 0) + 1) + j))) . (dl. 2) = F3(F2()) )
assume A13: 0 >= F2() ; :: thesis: (Comput (P,s,(((4 * 0) + 1) + j))) . (dl. 2) = F3(F2())
A14: F2() = 0 by A13;
defpred S2[ Nat] means (Comput (P,s,(((4 * 0) + 1) + $1))) . (dl. 2) = F3(F2());
A15: S2[ 0 ] by A1, A7, A9, A13;
A16: for h being Nat st S2[h] holds
S2[h + 1]
proof
let h be Nat; :: thesis: ( S2[h] implies S2[h + 1] )
assume A17: S2[h] ; :: thesis: S2[h + 1]
1 <= h + 1 by NAT_1:11;
then IC (Comput (P,s,(h + 1))) = 1 by A3, A14, Th27;
hence (Comput (P,s,(((4 * 0) + 1) + (h + 1)))) . (dl. 2) = F3(F2()) by A3, A17, Th18; :: thesis: verum
end;
for h being Nat holds S2[h] from NAT_1:sch 2(A15, A16);
hence (Comput (P,s,(((4 * 0) + 1) + j))) . (dl. 2) = F3(F2()) ; :: thesis: verum
end;
A18: for z being Nat st S1[z] holds
S1[z + 1]
proof
let z be Nat; :: thesis: ( S1[z] implies S1[z + 1] )
assume A19: S1[z] ; :: thesis: S1[z + 1]
let j be Nat; :: thesis: ( z + 1 >= F2() implies (Comput (P,s,(((4 * (z + 1)) + 1) + j))) . (dl. 2) = F3(F2()) )
assume z + 1 >= F2() ; :: thesis: (Comput (P,s,(((4 * (z + 1)) + 1) + j))) . (dl. 2) = F3(F2())
(Comput (P,s,(((4 * z) + 1) + (j + 4)))) . (dl. 2) = F3(F2()) by A10, A19;
hence (Comput (P,s,(((4 * (z + 1)) + 1) + j))) . (dl. 2) = F3(F2()) ; :: thesis: verum
end;
for z being Nat holds S1[z] from NAT_1:sch 2(A12, A18);
hence for k, j being Nat st k >= F2() holds
(Comput (P,s,(((4 * k) + 1) + j))) . (dl. 2) = F3(F2()) ; :: thesis: (Result (P,s)) . (dl. 2) = F3(F2())
thus (Result (P,s)) . (dl. 2) = F3(F2()) by A1, A7, A9, A10, A11, EXTPRO_1:7; :: thesis: verum
end;
suppose ex K being Nat st F2() = K + 1 ; :: thesis: ( ( for k being Nat st k < F2() holds
( (Comput (P,s,((4 * k) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * k) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * k) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * k) + 3))) . (dl. 2) = (Comput (P,s,((4 * k) + 2))) . (dl. 2) & (Comput (P,s,((4 * k) + 4))) . (dl. 2) = (Comput (P,s,((4 * k) + 3))) . (dl. 2) ) ) & ( for k, j being Nat st k >= F2() holds
(Comput (P,s,(((4 * k) + 1) + j))) . (dl. 2) = F3(F2()) ) & (Result (P,s)) . (dl. 2) = F3(F2()) )

then consider K being Nat such that
A20: F2() = K + 1 ;
A21: IC (Comput (P,s,(0 + 1))) = 2 by A3, A5, A6, A20, Th16;
A22: IC (Comput (P,s,(1 + 1))) = 3 by A3, A21, Th19;
A23: (Comput (P,s,(1 + 1))) . (dl. 2) = ((Comput (P,s,(0 + 1))) . (dl. 2)) + ((Comput (P,s,(0 + 1))) . (dl. 1)) by A3, A21, Th19;
A24: IC (Comput (P,s,(2 + 1))) = 4 by A3, A22, Th22;
A25: (Comput (P,s,(2 + 1))) . (dl. 2) = (Comput (P,s,(1 + 1))) . (dl. 2) by A3, A22, Th22;
A26: (Comput (P,s,(3 + 1))) . (dl. 2) = (Comput (P,s,(2 + 1))) . (dl. 2) by A3, A24, Th23;
defpred S1[ Nat] means ( ( $1 < F2() implies ( (Comput (P,s,((4 * $1) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * $1) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * $1) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * $1) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * $1) + 3))) . (dl. 2) = (Comput (P,s,((4 * $1) + 2))) . (dl. 2) & (Comput (P,s,((4 * $1) + 4))) . (dl. 2) = (Comput (P,s,((4 * $1) + 3))) . (dl. 2) ) ) & ( for j being Nat st $1 >= F2() holds
(Comput (P,s,(((4 * $1) + 1) + j))) . (dl. 2) = F3(F2()) ) );
A27: S1[ 0 ]
proof
hereby :: thesis: for j being Nat st 0 >= F2() holds
(Comput (P,s,(((4 * 0) + 1) + j))) . (dl. 2) = F3(F2())
assume 0 < F2() ; :: thesis: ( (Comput (P,s,((4 * 0) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * 0) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * 0) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * 0) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * 0) + 3))) . (dl. 2) = (Comput (P,s,((4 * 0) + 2))) . (dl. 2) & (Comput (P,s,((4 * 0) + 4))) . (dl. 2) = (Comput (P,s,((4 * 0) + 3))) . (dl. 2) )
then consider k being Nat such that
A28: F2() = k + 1 by NAT_1:6;
A29: F3((k + 1)) = (k + 1) + F3(k) by A2;
thus (Comput (P,s,((4 * 0) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * 0) + 1))) . (dl. 1)))) by A6, A7, A8, A9; :: thesis: ( (Comput (P,s,((4 * 0) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * 0) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * 0) + 3))) . (dl. 2) = (Comput (P,s,((4 * 0) + 2))) . (dl. 2) & (Comput (P,s,((4 * 0) + 4))) . (dl. 2) = (Comput (P,s,((4 * 0) + 3))) . (dl. 2) )
A30: (Comput (P,s,((4 * 0) + 2))) . (dl. 1) = F2() - 0 by A3, A28, Th29;
then 0 + 1 <= (Comput (P,s,((4 * 0) + 2))) . (dl. 1) by A28, NAT_1:13;
then ((Comput (P,s,((4 * 0) + 2))) . (dl. 1)) -' 1 = ((Comput (P,s,((4 * 0) + 2))) . (dl. 1)) - 1 by XREAL_1:233;
hence (Comput (P,s,((4 * 0) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * 0) + 2))) . (dl. 1)) -' 1))) by A6, A7, A28, A8, A9, A23, A29, A30; :: thesis: ( (Comput (P,s,((4 * 0) + 3))) . (dl. 2) = (Comput (P,s,((4 * 0) + 2))) . (dl. 2) & (Comput (P,s,((4 * 0) + 4))) . (dl. 2) = (Comput (P,s,((4 * 0) + 3))) . (dl. 2) )
thus (Comput (P,s,((4 * 0) + 3))) . (dl. 2) = (Comput (P,s,((4 * 0) + 2))) . (dl. 2) by A25; :: thesis: (Comput (P,s,((4 * 0) + 4))) . (dl. 2) = (Comput (P,s,((4 * 0) + 3))) . (dl. 2)
thus (Comput (P,s,((4 * 0) + 4))) . (dl. 2) = (Comput (P,s,((4 * 0) + 3))) . (dl. 2) by A26; :: thesis: verum
end;
thus for j being Nat st 0 >= F2() holds
(Comput (P,s,(((4 * 0) + 1) + j))) . (dl. 2) = F3(F2()) by A20; :: thesis: verum
end;
A31: for k being Nat st S1[k] holds
S1[k + 1]
proof
let k be Nat; :: thesis: ( S1[k] implies S1[k + 1] )
assume A32: ( ( k < F2() implies ( (Comput (P,s,((4 * k) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * k) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * k) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * k) + 3))) . (dl. 2) = (Comput (P,s,((4 * k) + 2))) . (dl. 2) & (Comput (P,s,((4 * k) + 4))) . (dl. 2) = (Comput (P,s,((4 * k) + 3))) . (dl. 2) ) ) & ( for j being Nat st k >= F2() holds
(Comput (P,s,(((4 * k) + 1) + j))) . (dl. 2) = F3(F2()) ) ) ; :: thesis: S1[k + 1]
set t = Comput (P,s,((4 * k) + 2));
set S = (4 * k) + 3;
set s3 = Comput (P,s,((4 * k) + 3));
set s4 = Comput (P,s,(((4 * k) + 3) + 1));
set s5 = Comput (P,s,((((4 * k) + 3) + 1) + 1));
set s6 = Comput (P,s,((((4 * k) + 3) + 2) + 1));
set s7 = Comput (P,s,((((4 * k) + 3) + 3) + 1));
set s8 = Comput (P,s,((((4 * k) + 3) + 4) + 1));
hereby :: thesis: for j being Nat st k + 1 >= F2() holds
(Comput (P,s,(((4 * (k + 1)) + 1) + j))) . (dl. 2) = F3(F2())
assume A33: k + 1 < F2() ; :: thesis: ( (Comput (P,s,((4 * (k + 1)) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * (k + 1)) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * (k + 1)) + 3))) . (dl. 2) = (Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 2) & (Comput (P,s,((4 * (k + 1)) + 4))) . (dl. 2) = (Comput (P,s,((4 * (k + 1)) + 3))) . (dl. 2) )
then A34: k < F2() by XXREAL_0:2, NAT_1:16;
A35: F2() - (k + 1) > (k + 1) - (k + 1) by A33, XREAL_1:9;
A36: IC (Comput (P,s,((4 * k) + 3))) = 4 by A3, A34, Th29;
A37: (Comput (P,s,((4 * k) + 3))) . (dl. 1) = (F2() - k) - 1 by A3, A34, Th29;
then A38: IC (Comput (P,s,(((4 * k) + 3) + 1))) = 5 by A3, A35, A36, Th23;
then A39: IC (Comput (P,s,((((4 * k) + 3) + 1) + 1))) = 2 by A3, Th24;
A40: (Comput (P,s,(((4 * k) + 3) + 1))) . (dl. 1) = (Comput (P,s,((4 * k) + 3))) . (dl. 1) by A3, A36, Th23;
A41: (Comput (P,s,((((4 * k) + 3) + 1) + 1))) . (dl. 1) = (Comput (P,s,(((4 * k) + 3) + 1))) . (dl. 1) by A3, A38, Th24;
A42: IC (Comput (P,s,((((4 * k) + 3) + 2) + 1))) = 3 by A3, A39, Th19;
A43: (Comput (P,s,((4 * k) + 3))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1))) by A32, A34;
A44: (Comput (P,s,(((4 * k) + 3) + 1))) . (dl. 2) = (Comput (P,s,((4 * k) + 3))) . (dl. 2) by A3, A36, Th23;
A45: (Comput (P,s,((((4 * k) + 3) + 1) + 1))) . (dl. 2) = (Comput (P,s,(((4 * k) + 3) + 1))) . (dl. 2) by A3, A38, Th24;
A46: (Comput (P,s,((((4 * k) + 3) + 2) + 1))) . (dl. 2) = ((Comput (P,s,((((4 * k) + 3) + 1) + 1))) . (dl. 2)) + ((Comput (P,s,((((4 * k) + 3) + 1) + 1))) . (dl. 1)) by A3, A39, Th19;
A47: (Comput (P,s,((((4 * k) + 3) + 3) + 1))) . (dl. 2) = (Comput (P,s,((((4 * k) + 3) + 2) + 1))) . (dl. 2) by A3, A42, Th22;
A48: ((F2() - k) - 1) - 1 >= 0 by A35, INT_1:52;
then reconsider W = (F2() - k) - 2 as Element of NAT by INT_1:3;
A49: F3((W + 1)) = (W + 1) + F3(W) by A2;
A50: ((F2() - k) - 1) -' 1 = ((F2() - k) - 1) - 1 by A48, XREAL_0:def 2;
A51: (Comput (P,s,((4 * k) + 2))) . (dl. 1) = F2() - k by A3, A34, Th29;
then 0 + 1 <= (Comput (P,s,((4 * k) + 2))) . (dl. 1) by A34, NAT_1:13, XREAL_1:50;
then A52: ((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1 = ((Comput (P,s,((4 * k) + 2))) . (dl. 1)) - 1 by XREAL_1:233;
thus (Comput (P,s,((4 * (k + 1)) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * (k + 1)) + 1))) . (dl. 1)))) by A40, A41, A37, A32, A34, A45, A51, A52; :: thesis: ( (Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * (k + 1)) + 3))) . (dl. 2) = (Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 2) & (Comput (P,s,((4 * (k + 1)) + 4))) . (dl. 2) = (Comput (P,s,((4 * (k + 1)) + 3))) . (dl. 2) )
A53: (Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 1) = F2() - (k + 1) by A3, A33, Th29;
thus (Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 1)) -' 1))) by A37, A43, A40, A41, A44, A45, A46, A53, A50, A52, A49, A51; :: thesis: ( (Comput (P,s,((4 * (k + 1)) + 3))) . (dl. 2) = (Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 2) & (Comput (P,s,((4 * (k + 1)) + 4))) . (dl. 2) = (Comput (P,s,((4 * (k + 1)) + 3))) . (dl. 2) )
thus (Comput (P,s,((4 * (k + 1)) + 3))) . (dl. 2) = (Comput (P,s,((4 * (k + 1)) + 2))) . (dl. 2) by A47; :: thesis: (Comput (P,s,((4 * (k + 1)) + 4))) . (dl. 2) = (Comput (P,s,((4 * (k + 1)) + 3))) . (dl. 2)
A54: ((4 * (k + 1)) + 3) + 1 = (4 * (k + 1)) + 4 ;
IC (Comput (P,s,((4 * (k + 1)) + 3))) = 4 by A3, A33, Th29;
hence (Comput (P,s,((4 * (k + 1)) + 4))) . (dl. 2) = (Comput (P,s,((4 * (k + 1)) + 3))) . (dl. 2) by A3, A54, Th23; :: thesis: verum
end;
let j be Nat; :: thesis: ( k + 1 >= F2() implies (Comput (P,s,(((4 * (k + 1)) + 1) + j))) . (dl. 2) = F3(F2()) )
assume k + 1 >= F2() ; :: thesis: (Comput (P,s,(((4 * (k + 1)) + 1) + j))) . (dl. 2) = F3(F2())
per cases then ( k + 1 = F2() or k + 1 > F2() ) by XXREAL_0:1;
suppose A55: k + 1 = F2() ; :: thesis: (Comput (P,s,(((4 * (k + 1)) + 1) + j))) . (dl. 2) = F3(F2())
A56: k < k + 1 by NAT_1:16;
then A57: (Comput (P,s,((4 * k) + 2))) . (dl. 1) = F2() - k by A3, A55, Th29
.= 1 by A55 ;
then ((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1 = ((Comput (P,s,((4 * k) + 2))) . (dl. 1)) - 1 by XREAL_1:233;
then A58: (Comput (P,s,((4 * k) + 3))) . (dl. 2) = F3(F2()) by A1, A32, A55, A56, A57;
A59: IC (Comput (P,s,((4 * k) + 3))) = 4 by A3, A55, A56, Th29;
(Comput (P,s,((4 * k) + 3))) . (dl. 1) = (F2() - k) - 1 by A3, A55, A56, Th29
.= 0 by A55 ;
then IC (Comput (P,s,(((4 * k) + 3) + 1))) = 1 by A3, A59, Th23;
then Comput (P,s,(((4 * k) + 4) + (j + 1))) = Comput (P,s,(((4 * k) + 3) + 1)) by A3, Th18;
hence (Comput (P,s,(((4 * (k + 1)) + 1) + j))) . (dl. 2) = F3(F2()) by A58, A3, A59, Th23; :: thesis: verum
end;
suppose k + 1 > F2() ; :: thesis: (Comput (P,s,(((4 * (k + 1)) + 1) + j))) . (dl. 2) = F3(F2())
then (Comput (P,s,(((4 * k) + 1) + (j + 4)))) . (dl. 2) = F3(F2()) by A32, NAT_1:13;
hence (Comput (P,s,(((4 * (k + 1)) + 1) + j))) . (dl. 2) = F3(F2()) ; :: thesis: verum
end;
end;
end;
A60: for k being Nat holds S1[k] from NAT_1:sch 2(A27, A31);
set t2 = Comput (P,s,((4 * K) + 2));
set t3 = Comput (P,s,((4 * K) + 3));
set t4 = Comput (P,s,(((4 * K) + 3) + 1));
A61: K < F2() by A20, NAT_1:13;
then A62: IC (Comput (P,s,((4 * K) + 3))) = 4 by A3, Th29;
(Comput (P,s,((4 * K) + 3))) . (dl. 1) = (F2() - K) - 1 by A3, A61, Th29
.= 0 by A20 ;
then A63: IC (Comput (P,s,(((4 * K) + 3) + 1))) = 1 by A3, A62, Th23;
A64: (Comput (P,s,((4 * K) + 2))) . (dl. 1) = F2() - K by A3, A61, Th29;
then A65: ((Comput (P,s,((4 * K) + 2))) . (dl. 1)) -' 1 = ((Comput (P,s,((4 * K) + 2))) . (dl. 1)) - 1 by A20, XREAL_1:233;
A66: (Comput (P,s,((4 * K) + 3))) . (dl. 2) = (Comput (P,s,((4 * K) + 2))) . (dl. 2) by A60, A61
.= F1() + (F3(F2()) - F3((((Comput (P,s,((4 * K) + 2))) . (dl. 1)) -' 1))) by A60, A61
.= F3((K + 1)) by A1, A20, A64, A65 ;
A67: P . (IC (Comput (P,s,(((4 * K) + 3) + 1)))) = halt SCM by A4, A63;
thus for k being Nat st k < F2() holds
( (Comput (P,s,((4 * k) + 1))) . (dl. 2) = F1() + (F3(F2()) - F3(((Comput (P,s,((4 * k) + 1))) . (dl. 1)))) & (Comput (P,s,((4 * k) + 2))) . (dl. 2) = F1() + (F3(F2()) - F3((((Comput (P,s,((4 * k) + 2))) . (dl. 1)) -' 1))) & (Comput (P,s,((4 * k) + 3))) . (dl. 2) = (Comput (P,s,((4 * k) + 2))) . (dl. 2) & (Comput (P,s,((4 * k) + 4))) . (dl. 2) = (Comput (P,s,((4 * k) + 3))) . (dl. 2) ) by A60; :: thesis: ( ( for k, j being Nat st k >= F2() holds
(Comput (P,s,(((4 * k) + 1) + j))) . (dl. 2) = F3(F2()) ) & (Result (P,s)) . (dl. 2) = F3(F2()) )

thus for k, j being Nat st k >= F2() holds
(Comput (P,s,(((4 * k) + 1) + j))) . (dl. 2) = F3(F2()) by A60; :: thesis: (Result (P,s)) . (dl. 2) = F3(F2())
(Comput (P,s,(((4 * K) + 3) + 1))) . (dl. 2) = (Comput (P,s,((4 * K) + 3))) . (dl. 2) by A3, A62, Th23;
hence (Result (P,s)) . (dl. 2) = F3(F2()) by A20, A66, A67, EXTPRO_1:7; :: thesis: verum
end;
end;