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

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

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