proposition: Lemma simplification_sigma2_uip_refl@{i j|} : forall {A : Type@{i}} {uip:UIP A} {P : A -> Type@{i}} {B : Type@{j}} (p : A) (x : P p) (G : x = x -> B), @simplification_sigma2_uip A uip P B p x x G 1 = G 1.
proof: Proof. intros. unfold simplification_sigma2_uip. now rewrite pr2_uip_refl. Defined.
imports: Coq.Program.Tactics Equations.Init Equations.Signature Equations.CoreTactics Equations.Type.Logic Equations.Type.Classes Equations.Type.EqDec