consider t being State of ;
let l be Instruction-Location of SCM+FSA ; :: thesis: for i being Instruction of st ( for s being State of st IC s = l & s . l = i holds
(Exec i,s) . (IC SCM+FSA ) = Next (IC s) ) holds
NIC i,l = {(Next l)}
let i be Instruction of ; :: thesis: ( ( for s being State of st IC s = l & s . l = i holds
(Exec i,s) . (IC SCM+FSA ) = Next (IC s) ) implies NIC i,l = {(Next l)} )
reconsider I = i as Element of ObjectKind l by AMI_1:def 14;
assume A1: for s being State of st IC s = l & s . l = i holds
(Exec i,s) . (IC SCM+FSA ) = Next (IC s) ; :: thesis: NIC i,l = {(Next l)}

hereby :: according to TARSKI:def 3,XBOOLE_0:def 10 :: thesis: {(Next l)} c= NIC i,l

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

end;

l in NAT by AMI_1:def 4;
then reconsider il1 = l as Element of ObjectKind (IC SCM+FSA ) by AMI_1:def 11;
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in {(Next l)} or x in NIC i,l )
set u = t +* ((IC SCM+FSA ),l --> il1,I);
A2: (t +* ((IC SCM+FSA ),l --> il1,I)) . l = i by AMI_1:129;
assume x in {(Next l)} ; :: thesis: x in NIC i,l
then A3: x = Next l by TARSKI:def 1;
A4: IC (t +* ((IC SCM+FSA ),l --> il1,I)) = l by AMI_1:129;
then IC (Following (t +* ((IC SCM+FSA ),l --> il1,I))) = Next l by A1, A2;
hence x in NIC i,l by A3, A4, A2; :: thesis: verum