theorem
  M,v |= 'not'(p 'or' q) => 'not' p '&' 'not' q & M |= 'not'(p 'or' q)
  => 'not' p '&' 'not' q
proof
  now
    let v;
    now
      assume M,v |= 'not'(p 'or' q);
      then
A1:   not M,v |= p 'or' q by ZF_MODEL:14;
      then not M,v |= q by ZF_MODEL:17;
      then
A2:   M,v |= 'not' q by ZF_MODEL:14;
      not M,v |= p by A1,ZF_MODEL:17;
      then M,v |= 'not' p by ZF_MODEL:14;
      hence M,v |= 'not' p '&' 'not' q by A2,ZF_MODEL:15;
    end;
    hence M,v |= 'not'(p 'or' q) => 'not' p '&' 'not' q by ZF_MODEL:18;
  end;
  hence thesis;
end;
