reserve G for Go-board,
  i,j,k,m,n for Nat;

theorem Th2:
  for f being non trivial FinSequence holds 1 < len f
proof
  let f be non trivial FinSequence;
  1+1 <= len f by NAT_D:60;
  hence thesis by NAT_1:13;
end;
