Express the propositional form ie. using only the NAND operator. Recall that the NAND operator(denoted by "|") is equivalent to AND followed by negation; that is, for any two propositions a and b, the propositional form (a|b) is logically equivalent to (a∧b). Express the propositional form c∧(a→b) using only the NAND operator.

You can rewrite c∧(a→b) as c∧((a)∨b). Use de Morgan's law to find that

(1) c∧((a)∨b) = c∧((a∧(b))) = c∧(a|(b)).

Now, observe that since

(2) d = d|d,

can be expressed in terms of the NAND operator. Therefore, ∧ can also be expressed in terms of the NAND operator since

(3) e∧f = (e|f).

Substituting the identities (2) and (3) into (1) as required will give an expression for c∧(a→b) which uses only NAND.