proposition: Lemma forall_enumerable_by_beq_correct_reachable (H : is_true (P x)) : forall_enumerable_by_beq = f x.
proof: Proof. rewrite forall_enumerable_by_beq_correct, H; reflexivity. Qed.
imports: Fiat.Common Fiat.Common.Enumerable Fiat.Common.Equality