Invert abs multi App st
Cslib.LambdaCalculus.LocallyNameless.Untyped.Term.invert_abs_multiApp_st
Plain-language statement
If a term (λ M) N P_1 ... P_n reduces in a single step to Q, then Q must be one of the following forms: Q = (λ M') N P₁ ... Pₙ where M ⭢βᶠ M' or Q = (λ M) N' P₁ ... Pₙ where N ⭢βᶠ N' or Q = (λ M) N P₁' ... Pₙ' where P_i ⭢βᶠ P_i' for some i or Q = (M ^ N) P₁ ... Pₙ
Source project: Lean Computer Science Library
Person-level attribution pending.