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

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

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