Prove the universal statement forall_b({a:bool|or(a,not(a))}) evaluates to true. Every boolean value either holds or its negation holds — this is the universal law of excluded middle.
Hint
Inside for(a: bool), prove or(a, not(a)) -> true by assuming it is false and splitting on a. Label the result A of contradict inside the if block, then call the axiom of the quantifier, Aforall_bGeneralize[| A], outside the if but still inside the for.