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

State before:
α β α' β' : Type
γ : β → Type
arity : Type
p : PropagateStruc arity
x : Fin 0 → ℕ → Bool
⊢ eval negOne x = negOneSeq
Tactic:
ext n
State after:
case h
α β α' β' : Type
γ : β → Type
arity : Type
p : PropagateStruc arity
x : Fin 0 → ℕ → Bool
n : ℕ
⊢ eval negOne x n = negOneSeq n

State before:
case h
α β α' β' : Type
γ : β → Type
arity : Type
p : PropagateStruc arity
x : Fin 0 → ℕ → Bool
n : ℕ
⊢ eval negOne x n = negOneSeq n
Tactic:
cases n <;> simp [negOne, negOneSeq, eval, propagate_succ2]
State after:
no goals