let i be Element of NAT ; :: thesis: for s being State of SCM+FSA
for w being FinSequence of INT st (Initialized Insert-Sort-Algorithm) +* ((fsloc 0) .--> w) c= s holds
IC (Comput ((ProgramPart s),s,i)) in dom Insert-Sort-Algorithm
let s be State of SCM+FSA; :: thesis: for w being FinSequence of INT st (Initialized Insert-Sort-Algorithm) +* ((fsloc 0) .--> w) c= s holds
IC (Comput ((ProgramPart s),s,i)) in dom Insert-Sort-Algorithm
let w be FinSequence of INT ; :: thesis: ( (Initialized Insert-Sort-Algorithm) +* ((fsloc 0) .--> w) c= s implies IC (Comput ((ProgramPart s),s,i)) in dom Insert-Sort-Algorithm )
set IS = Insert-Sort-Algorithm ;
set Ii = Initialized Insert-Sort-Algorithm;
set x = (fsloc 0) .--> w;
dom (Initialized Insert-Sort-Algorithm) misses dom ((fsloc 0) .--> w) by SCMBSORT:46;
then A1: Initialized Insert-Sort-Algorithm c= (Initialized Insert-Sort-Algorithm) +* ((fsloc 0) .--> w) by FUNCT_4:33;
assume (Initialized Insert-Sort-Algorithm) +* ((fsloc 0) .--> w) c= s ; :: thesis: IC (Comput ((ProgramPart s),s,i)) in dom Insert-Sort-Algorithm
hence IC (Comput ((ProgramPart s),s,i)) in dom Insert-Sort-Algorithm by Lm12, A1, SCM_HALT:def 1, XBOOLE_1:1; :: thesis: verum