
theorem
  for f being set, p being nonpair-yielding FinSequence holds
  InputVertices 1GateCircStr(p,f) is without_pairs
proof
  let f be set, p be nonpair-yielding FinSequence;
  InputVertices 1GateCircStr(p,f) = rng p by CIRCCOMB:42;
  hence thesis;
end;
