Playground Documentation Challenges Full Docs
← All Challenges

#10. Excluded Middle

Easy if <…> contradict

Prove that or(a, not(a)) evaluates to true for any boolean a. This is the law of excluded middle — every proposition is either true or false.

Hint

Assume or(a, not(a)) -> false. Then assume a -> false: not(a) becomes true, so or(false, true) -> true — contradiction. After that flip, a -> true, and or(true, not(true)) = or(true, false) -> true — another contradiction.

Your Solution
Output