reserve x for Int_position,
  n,p0 for Nat;
reserve P,Q,V for Instruction-Sequence of SCMPDS;

theorem
  for p0,n being Nat st p0 >= 7 holds QuickSort(n,p0) is
  parahalting
proof
  let p0,n be Nat;
  assume
A1:  p0 >= 7;
  for s be State of SCMPDS,P
   holds QuickSort(n,p0) is_halting_on s,P
   proof let s be State of SCMPDS,P;
    QuickSort(n,p0) is_halting_on Initialize s,P by A1,Lm28;
    hence thesis by SCMPDS_6:126;
   end;
  hence thesis by SCMPDS_6:21;
end;
