proposition: Lemma unrecognizable_to_undecidable: forall L, ~ Recognizable L -> ~ Decidable L.
proof: Proof. intros. intros N. apply decidable_to_recognizable in N. contradiction. Qed.
imports: Coq.Setoids.Setoid Coq.Bool.Bool Coq.Logic.Classical_Prop