Playground Documentation Challenges Full Docs
← All Challenges

#9. Self-Equivalence

Easy if <…> contradict

Prove that equivalent(a, a) evaluates to true for an arbitrary boolean a. This is your first proof by contradiction: assume the opposite, derive a contradiction, and the system flips the assumption.

Hint

Assume equivalent(a,a) -> false. Then assume a -> false: equivalent(false,false) -> true, which contradicts the outer assumption. Call contradict[| <…>]. After the flip, a -> true: same argument with equivalent(true,true) -> true.

Your Solution
Output