reserve i,j,k,l for natural Number;
reserve A for set, a,b,x,x1,x2,x3 for object;
reserve D,D9,E for non empty set;
reserve d,d1,d2,d3 for Element of D;
reserve d9,d19,d29,d39 for Element of D9;
reserve p,q,r for FinSequence;
reserve s for Element of D*;

theorem
  for D being set holds 0-tuples_on D = { <*>D }
proof
  let D be set;
  now
    let z be object;
    thus z in 0-tuples_on D implies z = <*>D
    proof
      assume z in 0-tuples_on D;
      then ex s being Element of D* st z = s & len s = 0;
      hence thesis;
    end;
    <*>D is Element of D* & len <*>D = 0 by FINSEQ_1:def 11;
    hence z = <*>D implies z in 0-tuples_on D;
  end;
  hence thesis by TARSKI:def 1;
end;
