reserve n,i,j,k for Nat;
reserve T for TuringStr,
  s for All-State of T;

theorem Th17:
  for T being TuringStr, t be Tape of T, s,n be Element of NAT st
t storeData <*s,n *> holds t.s=0 & t.(s+n+2)=0 & for i be Integer st s < i & i
  < s+n+2 holds t.i=1
proof
  let T be TuringStr, t be Tape of T, s,n be Element of NAT;
  assume t storeData <*s,n*>;
  then
A1: t is_1_between s,s+n+2 by Th15;
  hence t.s=0 & t.(s+n+2)=0;
  thus thesis by A1;
end;
