let N be with_non-empty_elements set ; :: thesis: for S being non empty stored-program IC-Ins-separated definite realistic AMI-Struct of N
for il being Instruction-Location of S
for i being Instruction of st i is halting holds
NIC i,il = {il}
let S be non empty stored-program IC-Ins-separated definite realistic AMI-Struct of N; :: thesis: for il being Instruction-Location of S
for i being Instruction of st i is halting holds
NIC i,il = {il}
let il be Instruction-Location of S; :: thesis: for i being Instruction of st i is halting holds
NIC i,il = {il}
let i be Instruction of ; :: thesis: ( i is halting implies NIC i,il = {il} )
assume A1: for s being State of holds Exec i,s = s ; :: according to AMI_1:def 8 :: thesis: NIC i,il = {il}

hereby :: according to TARSKI:def 3,XBOOLE_0:def 10 :: thesis: {il} c= NIC i,il

let n be set ; :: thesis: ( n in NIC i,il implies n in {il} )
assume n in NIC i,il ; :: thesis: n in {il}
then ex s being State of st
( n = IC (Following s) & IC s = il & s . il = i ) ;
then n = il by A1;
hence n in {il} by TARSKI:def 1; :: thesis: verum

end;

A2: ObjectKind il = the Instructions of S by AMI_1:def 14;
( il in NAT & ObjectKind (IC S) = NAT ) by AMI_1:def 4, AMI_1:def 11;
then reconsider f = (IC S),il --> il,i as FinPartState of by A2, AMI_1:58;
consider s being State of ;
let n be set ; :: according to TARSKI:def 3 :: thesis: ( not n in {il} or n in NIC i,il )
assume A3: n in {il} ; :: thesis: n in NIC i,il
set a = s +* f;
A4: dom f = {(IC S),il} by FUNCT_4:65;
then IC S in dom f by TARSKI:def 2;
then A5: (s +* f) . (IC S) = f . (IC S) by FUNCT_4:14
.= il by AMI_1:48, FUNCT_4:66 ;
il in dom f by A4, TARSKI:def 2;
then (s +* f) . (IC (s +* f)) = f . il by A5, FUNCT_4:14
.= i by FUNCT_4:66 ;
then IC (Following (s +* f)) = (s +* f) . (IC S) by A1
.= n by A3, A5, TARSKI:def 1 ;
hence n in NIC i,il by Lm2; :: thesis: verum