Prove that {→} is not a complete set

92 Views Asked by At

I have an idea on how to prove a set with 2 connectives but I've never done any example with a set of one element. Assuming {$\land, \lor, \lnot$} is a complete set, how can I show that {→} is not a complete set? Can i use truth table to disprove it?