I present a tactic, BasicElim, for Type Theory based proof systems to apply elimination rules in a reenement setting. Applicable rules are parametric in their conclusion, expressing the leverage hypotheses ~ x yield on any ~ x we choose. represents the motive for an elimination: BasicElim's job is to construct a suited to the goal at hand. If these ~ x inhabit an instance of 's domain, I adopt ...