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

State before:
α β α' β' : Type
γ : β → Type
arity : Type
p : PropagateStruc arity
x : Bool → ℕ → Bool
⊢ eval and x = andSeq (x true) (x false)
Tactic:
ext n
State after:
case h
α β α' β' : Type
γ : β → Type
arity : Type
p : PropagateStruc arity
x : Bool → ℕ → Bool
n : ℕ
⊢ eval and x n = andSeq (x true) (x false) n

State before:
case h
α β α' β' : Type
γ : β → Type
arity : Type
p : PropagateStruc arity
x : Bool → ℕ → Bool
n : ℕ
⊢ eval and x n = andSeq (x true) (x false) n
Tactic:
cases n <;> simp [and, andSeq, eval, propagate_succ]
State after:
no goals