Theorem: PropagateStruc.eval_ls (Lean4bits/lemmas.lean)

State before:
α β α' β' : Type
γ : β → Type
arity : Type
p : PropagateStruc arity
x : Unit → ℕ → Bool
⊢ eval ls x = lsSeq (x ())
Tactic:
ext n
State after:
case h
α β α' β' : Type
γ : β → Type
arity : Type
p : PropagateStruc arity
x : Unit → ℕ → Bool
n : ℕ
⊢ eval ls x n = lsSeq (x ()) n

State before:
case h
α β α' β' : Type
γ : β → Type
arity : Type
p : PropagateStruc arity
x : Unit → ℕ → Bool
n : ℕ
⊢ eval ls x n = lsSeq (x ()) n
Tactic:
cases n <;> simp [ls, lsSeq, eval, propagate_succ2]
State after:
no goals