Theorem: Cpdt.Chapter2.TInstr.denote_inConst (Cpdt/Chapter2/Typed.lean)

State before:
n : Nat
a✝ : TStack
s : VStack a✝
⊢ denote (inConst n) s = (n, s)
Tactic:
rfl
State after:
no goals