
theorem Th67:
  for G being _finite _Graph, m,n being Nat st G.order() <= m & m
  <= n holds (MCS:CSeq(G)).m = (MCS:CSeq(G)).n
proof
  let G be _finite _Graph, m,n be Nat such that
A1: G.order() <= m and
A2: m <= n;
  (MCS:CSeq(G)).m = (MCS:CSeq(G)).(G.order()) by A1,Th66;
  hence thesis by A1,A2,Th66,XXREAL_0:2;
end;
