let ins be Instruction of SCM; :: thesis: ( InsCode ins = 0 implies ins = halt SCM )
assume A1: InsCode ins = 0 ; :: thesis: ins = halt SCM

A2: now

assume ins in { [J,<*a*>,{}] where J is Element of Segm 9, a is Element of NAT : J = 6 } ; :: thesis: contradiction
then ex J being Element of Segm 9 ex a being Element of NAT st
( ins = [J,<*a*>,{}] & J = 6 ) ;
hence contradiction by A1, RECDEF_2:def 1; :: thesis: verum

end;

now

assume ins in { [I,{},<*b,c*>] where I is Element of Segm 9, b, c is Element of Data-Locations : I in {1,2,3,4,5} } ; :: thesis: contradiction
then ex I being Element of Segm 9 ex b, c being Element of Data-Locations st
( ins = [I,{},<*b,c*>] & I in {1,2,3,4,5} ) ;
hence contradiction by A1, RECDEF_2:def 1; :: thesis: verum

end;

then A3: ins in ({[SCM-Halt,{},{}]} \/ { [J,<*a*>,{}] where J is Element of Segm 9, a is Element of NAT : J = 6 } ) \/ { [K,<*a1*>,<*b1*>] where K is Element of Segm 9, a1 is Element of NAT , b1 is Element of Data-Locations : K in {7,8} } by AMI_3:27, XBOOLE_0:def 3;

now

assume ins in { [K,<*a1*>,<*b1*>] where K is Element of Segm 9, a1 is Element of NAT , b1 is Element of Data-Locations : K in {7,8} } ; :: thesis: contradiction
then ex K being Element of Segm 9 ex a1 being Element of NAT ex b1 being Element of Data-Locations st
( ins = [K,<*a1*>,<*b1*>] & K in {7,8} ) ;
hence contradiction by A1, RECDEF_2:def 1; :: thesis: verum

end;

then ins in {[SCM-Halt,{},{}]} \/ { [J,<*a*>,{}] where J is Element of Segm 9, a is Element of NAT : J = 6 } by A3, XBOOLE_0:def 3;
then ins in {[SCM-Halt,{},{}]} by A2, XBOOLE_0:def 3;
hence ins = halt SCM by AMI_3:26, TARSKI:def 1; :: thesis: verum