proposition: Lemma apply_equiv_dom {A B} (P : A -> Type) (e : Equiv A B) : (forall x : B, P (inv_equiv e x)) -> forall x : A, P x.
proof: Proof. intros. specialize (X (equiv e x)). rewrite equiv_inv_equiv in X. exact X. Defined.
imports: Equations(Equations DepElimDec HSets) Utf8