reserve i,j,n,k,m for Nat,
     a,b,x,y,z for object,
     F,G for FinSequence-yielding FinSequence,
     f,g,p,q for FinSequence,
     X,Y for set,
     D for non empty set;
reserve
  B,A,M for BinOp of D,
  F,G for D* -valued FinSequence,
  f for FinSequence of D,
  d,d1,d2 for Element of D;
reserve
  F,G for non-empty non empty FinSequence of D*,
  f for non empty FinSequence of D;
reserve f,g for FinSequence of D,
        a,b,c for set,
        F,F1,F2 for finite set;

theorem Th78:
 for E be Enumeration of {X} holds SignGenOp(f,B,{X}) * E= <* SignGen(f,B,X) *>
proof
  let E be Enumeration of {X};
A1: X in {X}=dom SignGenOp(f,B,{X}) & E = <*X*>
    by Th77,FUNCT_2:def 1,TARSKI:def 1;
  then SignGenOp(f,B,{X}) * E = <*SignGenOp(f,B,{X}).X*> by FINSEQ_2:34;
  hence thesis by A1,Def12;
end;
