Playground Documentation Challenges Full Docs
← All Challenges

#17. Implication Reflexivity

Easy if <…> contradict

Prove that implies(p, p) evaluates to true for any boolean p. Every proposition implies itself.

Hint

Assume implies(p, p) -> false. Then split on p: when p -> false, implies(false, false) is true — contradiction. When p -> true, implies(true, true) is true — contradiction again.

Your Solution
Output