Right! I guess you are confused as to what the problem is. Refer to slide 17/146 in propositional logic. There it is shown how the operators ! (negation), | (disjunction) and & (conjunction) are formulated using the entities in the set {(=>|), true, false} (i.e if-then-else operator (=>|) and boolean constants true and false). This proves that the set is a complete base (i.e. capable of formulating any boolean function).

Similarly you have to construct ! (negation), | (disjunction) and & (conjunction) using the set F = {<->, false, |}, thus proving that F is a complete base too.

Note that negation, disjunction and conjunction (denoted by ¬, v and ^ in slides) are denoted respectively by !, | and & in the exercise.