reserve x,y,z, X,Y,Z for set,
  n for Element of NAT;
reserve A for set,
  D for non empty set,
  a,b,c,l,r for Element of D,
  o,o9 for BinOp of D,
  f,g,h for Function of A,D;
reserve G for non empty multMagma;
reserve A for non empty set,
  a for Element of A,
  p for FinSequence of A,
  m1,m2 for Multiset of A;

theorem Th33:
  chi a is Element of finite-MultiSet_over A
proof
  (chi a)"(NAT\{0}) c= {a}
  proof
    let x be object;
    assume
A1: x in (chi a)"(NAT\{0});
    then x in dom chi a by FUNCT_1:def 7;
    then reconsider y = x as Element of A by Th28;
    (chi a).x in NAT\{0} by A1,FUNCT_1:def 7;
    then not (chi a).y in {0} by XBOOLE_0:def 5;
    then (chi a).y <> 0 by TARSKI:def 1;
    then y = a by Th31;
    hence thesis by TARSKI:def 1;
  end;
  hence thesis by Def6;
end;
