set I = [0,{},{}];
let W be Instruction of SCM+FSA; ( W is halting implies W = [0,{},{}] )
assume A1:
W is halting
; W = [0,{},{}]
assume A2:
[0,{},{}] <> W
; contradiction
per cases
( W = [0,{},{}] or ex a, b being Int-Location st W = a := b or ex a, b being Int-Location st W = AddTo (a,b) or ex a, b being Int-Location st W = SubFrom (a,b) or ex a, b being Int-Location st W = MultBy (a,b) or ex a, b being Int-Location st W = Divide (a,b) or ex la being Nat st W = goto la or ex lb being Nat ex da being Int-Location st W = da =0_goto lb or ex lb being Nat ex da being Int-Location st W = da >0_goto lb or ex b, a being Int-Location ex fa being FinSeq-Location st W = a := (fa,b) or ex a, b being Int-Location ex fa being FinSeq-Location st W = (fa,a) := b or ex a being Int-Location ex f being FinSeq-Location st W = a :=len f or ex a being Int-Location ex f being FinSeq-Location st W = f :=<0,...,0> a )
by Th86;
suppose
ex
la being
Nat st
W = goto la
;
contradictionhence
contradiction
by A1;
verum end; end;