reserve i, x, I for set,
  A, B, M for ManySortedSet of I,
  f, f1 for Function;
reserve SF, SG for SubsetFamily of M;
reserve E, T for Element of Bool M;

theorem
  dom |.{f,f1}.| = dom f /\ dom f1
proof
  consider A being non empty functional set such that
A1: A = {f,f1} and
A2: dom |.{f,f1}.| = meet the set of all  dom x where x is Element of A  and
  for i st i in dom |.{f,f1}.| holds |.{f,f1}.|.i = the set of all
 x.i where x is
  Element of A  by Def2;
  set m = the set of all  dom x where x is Element of A ;
  m = {dom f, dom f1}
  proof
    thus m c= {dom f, dom f1}
    proof
      let q be object;
      assume q in m;
      then consider x being Element of A such that
A3:   q = dom x;
      x = f or x = f1 by A1,TARSKI:def 2;
      hence thesis by A3,TARSKI:def 2;
    end;
    let q be object;
    assume q in {dom f, dom f1};
    then
A4: q = dom f or q = dom f1 by TARSKI:def 2;
    f is Element of A & f1 is Element of A by A1,TARSKI:def 2;
    hence thesis by A4;
  end;
  hence thesis by A2,SETFAM_1:11;
end;
