proposition: Theorem finite_discernable_discriminable_type : discriminable_type.
proof: Proof. Proof using H1 H2. destruct H1 as (l & Hl). destruct discernable_discriminable_list with l as (D & D1 & D2 & f & Hf). exists D, D1, D2, f; intros; eauto. Qed.
imports: List Bool Undecidability.Shared.Libs.DLW.Utils(utils_list finite fin_quotient fin_dec utils_decidable) Undecidability.FOL.TRAKHTENBROT(notations utils decidable)