Playground Documentation Challenges Full Docs
← All Challenges

#18. De Morgan's Law (Conjunction)

Medium if <…> contradict

Prove that equivalent(not(and(a,b)), or(not(a),not(b))) evaluates to true for all boolean values of a and b.

Hint

Case analysis: consider all combinations of a and b being true or false. Use if to assume a value, then a proof <…> and contradict.

Your Solution
Output