let x be FinPartState of SCM; :: thesis: ( x in dom F1() implies Initialize x is IterativeAlgorithm F2() -halted )
assume x in dom F1() ; :: thesis: Initialize x is IterativeAlgorithm F2() -halted
then consider n being Nat such that
A3: x = ((dl. 0),(dl. 1),(dl. 2)) --> (1,n,F3(n)) by A2;
let s be State of SCM; :: according to EXTPRO_1:def 11 :: thesis: ( not Initialize x c= s or for b1 being set holds
( not IterativeAlgorithm F2() c= b1 or b1 halts_on s ) )

assume A4: Initialize x c= s ; :: thesis: for b1 being set holds
( not IterativeAlgorithm F2() c= b1 or b1 halts_on s )

set q = IterativeAlgorithm F2();
let P be Instruction-Sequence of SCM; :: thesis: ( not IterativeAlgorithm F2() c= P or P halts_on s )
assume A5: IterativeAlgorithm F2() c= P ; :: thesis: P halts_on s
A6: s is 0 -started by A4, MEMSTR_0:17;
s is State-consisting of <%1,n,F3(n)%> by A3, A4, Th15;
hence P halts_on s by A1, A5, A6, Th29; :: thesis: verum