proposition: Lemma simplify_ind_pack_inv@{i j|} {A : Type@{i}} {uip : UIP A} (B : A -> Type@{i}) (x : A) (p : B x) (G : p = p -> Type@{j}) : G 1 -> opaque_ind_pack_inv G 1.
proof: Proof. intros H. unfold opaque_ind_pack_inv. destruct (pr2_uip_refl B x p). exact H. Defined.
imports: Coq.Program.Tactics Equations.Init Equations.Signature Equations.CoreTactics Equations.Type.Logic Equations.Type.Classes Equations.Type.EqDec