reserve S for 1-sorted,
  i for Element of NAT,
  p for FinSequence,
  X for set;

theorem
  for f being Element of bspace(X) st (ex x being set st x in X & f = {x
  }) holds f in singletons(X);
