proposition: Lemma below_max_in_nids: forall (n: NId), n < MaxNId <-> In n nids.
proof: Proof. intros. unfold nids. destruct (bnats MaxNId) as [nids B N]. unfold below_in in B. apply B. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)