Playground Documentation Challenges Full Docs
← All Challenges

#16. OR Commutativity

Easy if <…> contradict

Prove that equivalent(or(a,b), or(b,a)) evaluates to true for all booleans a and b.

Hint

Same structure as AND Commutativity: assume the opposite, then nested case analysis on a and b.

Your Solution
Output