set S = SCM+FSA ;

now

let s be State of SCM+FSA; :: thesis: for o being Object of SCM+FSA
for I being Instruction of SCM+FSA st InsCode I = InsCode (goto i1) & o in Data-Locations SCM+FSA holds
(Exec (b₅,b₃)) . b₄ = b₃ . b₄
let o be Object of SCM+FSA; :: thesis: for I being Instruction of SCM+FSA st InsCode I = InsCode (goto i1) & o in Data-Locations SCM+FSA holds
(Exec (b₄,b₂)) . b₃ = b₂ . b₃
let I be Instruction of SCM+FSA; :: thesis: ( InsCode I = InsCode (goto i1) & o in Data-Locations SCM+FSA implies (Exec (b₃,b₁)) . b₂ = b₁ . b₂ )
assume that
A1: InsCode I = InsCode (goto i1) and
A2: o in Data-Locations SCM+FSA ; :: thesis: (Exec (b₃,b₁)) . b₂ = b₁ . b₂
A3: ex i2 being Element of NAT st I = goto i2 by A1, SCMFSA_2:47, SCMFSA_2:59;

per cases ( o is Int-Location or o is FinSeq-Location ) by A2, Th7;

suppose o is Int-Location ; :: thesis: (Exec (b₃,b₁)) . b₂ = b₁ . b₂

hence (Exec (I,s)) . o = s . o by A3, SCMFSA_2:95; :: thesis: verum

end;

suppose o is FinSeq-Location ; :: thesis: (Exec (b₃,b₁)) . b₂ = b₁ . b₂

hence (Exec (I,s)) . o = s . o by A3, SCMFSA_2:95; :: thesis: verum

end;

end;

end;

hence for b₁ being InsType of SCM+FSA st b₁ = InsCode (goto i1) holds
b₁ is jump-only by AMISTD_1:def 3; :: thesis: verum