
theorem Th19:
  for S being one-gate ManySortedSign for A being one-gate Circuit
  of S for s being State of A holds Following s is stable
proof
  let S be one-gate ManySortedSign;
  let A be one-gate Circuit of S;
  let s be State of A;
  ex X being non empty finite set, n being Element of NAT, p being
FinSeqLen of n, f being Function of n-tuples_on X,X st S = 1GateCircStr(p,f) &
  A = 1GateCircuit(p,f) by Def7;
  hence thesis by CIRCCMB2:2;
end;
