reserve A for set,
  C for non empty set,
  B for Subset of A,
  x for Element of A,
  f,g for Function of A,C;
reserve B for Element of Fin A;
reserve L for non empty LattStr,
  a,b,c for Element of L;
reserve L for Lattice;
reserve a,b,c,u,v for Element of L;
reserve A for non empty set,
  x for Element of A,
  B for Element of Fin A,
  f,g for Function of A, the carrier of L;

theorem
  B <> {} & f|B = g|B implies FinMeet(B,f) = FinMeet(B,g)
proof
  reconsider f9 = f, g9 = g as Function of A, the carrier of L.:;
A1: FinMeet(B,f) = FinJoin(B,f9) & FinMeet(B,g) = FinJoin(B,g9);
  assume B <> {} & f|B = g|B;
  hence thesis by A1,Th34;
end;
