
theorem
  for n being Element of NAT for X being finite non empty set for f
being Function of n-tuples_on X, X, p being FinSeqLen of n for s being State of
  1GateCircuit(p,f) holds (Following s).Output 1GateCircStr(p,f) = f.(s*p)
proof
  let n be Element of NAT;
  let X be finite non empty set;
  let f be Function of n-tuples_on X, X, p be FinSeqLen of n;
  let s be State of 1GateCircuit(p,f);
  Output 1GateCircStr(p,f) = [p,f] by Th15;
  hence thesis by CIRCCOMB:56;
end;
