theorem Th1:
  'not' ( p '&' 'not' p ) in TAUT(A)
proof
  p => p in TAUT(A) by LUKASI_1:4;
  hence thesis by QC_LANG2:def 2;
end;
