
theorem Th56:
  for G being _finite _Graph holds MCS:CSeq(G) is iterative
proof
  let G be _finite _Graph;
  set CS = MCS:CSeq(G);
  let k,n be Nat;
  CS.(k+1) = MCS:Step(CS.k) by Def25;
  hence thesis by Def25;
end;
