proposition: Corollary exist_irrel' : forall A (P : A -> Prop) (x1: sig P) (x2: sig P), (forall x (pf1' pf2' : P x), pf1' = pf2') -> `x1 = `x2 -> x1 = x2.
proof: Proof. destruct x1, x2; eauto using exist_irrel. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat CertifiedExtraction.Extraction.BinEncoders.Basics Coq.Lists.List Bedrock.Word Program