theorem
  ('not' 'not' p) <=> p is tautology
  proof
    let M;
    thus (SAT M).(('not' 'not' p) <=> p) =
    (SAT M).('not' 'not' p) <=> (SAT M).p by semequ2
    .= ('not' (SAT M).('not' p)) <=> (SAT M).p by semnot2
    .= ('not' 'not' (SAT M).p) <=> (SAT M).p by semnot2
    .=1 by th2;
  end;
