let a be Int-Location ; :: thesis: for f being FinSeq-Location
for p being preProgram of SCM+FSA st ( a :=len f in rng p or f :=<0,...,0> a in rng p ) holds
First*NotUsed p <> f
let f be FinSeq-Location ; :: thesis: for p being preProgram of SCM+FSA st ( a :=len f in rng p or f :=<0,...,0> a in rng p ) holds
First*NotUsed p <> f
let p be preProgram of SCM+FSA ; :: thesis: ( ( a :=len f in rng p or f :=<0,...,0> a in rng p ) implies First*NotUsed p <> f )
assume ( a :=len f in rng p or f :=<0,...,0> a in rng p ) ; :: thesis: First*NotUsed p <> f
then consider i being Instruction of SCM+FSA such that
A1: ( i in rng p & ( i = a :=len f or i = f :=<0,...,0> a ) ) ;
UsedInt*Loc i = {f} by A1, Th38;
then ( {f} c= UsedInt*Loc p & not First*NotUsed p in UsedInt*Loc p ) by A1, Th39, Th61;
hence First*NotUsed p <> f by ZFMISC_1:37; :: thesis: verum