proposition: Lemma solution_right_let@{i j|} : forall {A : Type@{i}} {B : A -> Type@{j}} (b t : A), (t = b -> B t) -> (let x := b in t = x -> B x).
proof: Proof. intros A B b t H x eq. subst x. destruct eq. apply H. reflexivity. Defined.
imports: Coq.Program.Tactics Equations.Init Equations.Signature Equations.CoreTactics Equations.Type.Logic Equations.Type.Classes Equations.Type.EqDec