proposition: Lemma add_list_empty_neutral_n_r: forall (a: list bool) n, (n >= (length a))%nat -> (add_list a (mk_list_false n)) = a.
proof: Proof. intros a. unfold add_list. apply (@add_list_carry_empty_neutral_n_r a). Qed.
imports: List Bool NArith Psatz Int63 Nnat ZArith Misc ProofIrrelevance