
theorem
  for x,b being non pair set holds InnerVertices BitCompStr(x,b) is Relation
proof
  let x,b be non pair set;
  set S1 = CompStr(x,b);
  set S2 = IncrementStr(x,b);
  InnerVertices S1 is Relation & InnerVertices S2 is Relation by FACIRC_1:38;
  hence thesis by FACIRC_1:3;
end;
