proposition: Lemma count_one : forall P x, count P (x::nil) = If P x then 1 else 0.
proof: Proof. Proof using. gowith LibList.count_one. Qed.
imports: TLC(LibTactics LibLogic LibOperation LibReflect LibProd LibNat LibInt LibOption LibWf) TLC(LibInt)