reserve L for satisfying_Sh_1 non empty ShefferStr;

theorem Th6:
  for x being Element of L holds (x | ((x | x) | x )) | (x | x) = x
proof
  let x be Element of L;
  x | ((x | x) | x) = x | x by Th5;
  hence thesis by Def1;
end;
