Prove a match statement
问题 Trying to solve an exercise, I have the following definition that represents the integers : Inductive bin : Type := | Zero : bin | Twice : bin -> bin | TwiceOne : bin -> bin. The idea is that : Twice x is 2*x . TwiceOne x is 2*x +1 . However, this representation has a problem: there are several representations of the number 0 . Therefore, I need to implement a function that normalize a number writing in bin . To do this I have declared the following function : Fixpoint normalize_bin (b:bin) :