LEFT_LIST_PBETA

PairRules.LEFT_LIST_PBETA : (thm -> thm)

Iteratively beta-reduces a top-level paired beta-redex on the left-hand side of an equation.

When applied to an equational theorem, LEFT_LIST_PBETA applies paired beta-reduction over a top-level chain of beta-redexes to the left-hand side (only). Variables are renamed if necessary to avoid free variable capture.

    A |- (\p1...pn. t) q1 ... qn = s
   ----------------------------------  LEFT_LIST_BETA
       A |- t[q1/p1]...[qn/pn] = s

Failure

Fails unless the theorem is equational, with its left-hand side being a top-level paired beta-redex.

See also

Drule.RIGHT_LIST_BETA, PairRules.PBETA_CONV, PairRules.PBETA_RULE, PairRules.PBETA_TAC, PairRules.LIST_PBETA_CONV, PairRules.LEFT_PBETA, PairRules.RIGHT_PBETA, PairRules.RIGHT_LIST_PBETA