reserve x,y,y1,y2 for set,
  D for non empty set,
  d,d1,d2,d3 for Element of D,
  F,G,H,H1,H2 for FinSequence of D,
  f,f1,f2 for sequence of D,
  g for BinOp of D,
  k,n,i,l for Nat,
  P for Permutation of dom F;

theorem
  g "**" (2 |-> d) = g.(d,d)
proof
  thus g "**" (2 |-> d) = g "**" <* d,d *> by FINSEQ_2:61
    .= g.(d,d) by Th12;
end;
