let p, q, r be boolean object ; :: thesis: p 'nand' (q => r) = (p => q) '&' (p => ('not' r))
( p = FALSE or p = TRUE ) by Def3;
hence p 'nand' (q => r) = (p => q) '&' (p => ('not' r)) ; :: thesis: verum