proposition: Lemma foo' : forall n, 0 <=? n = true.
proof: Proof. intros. destruct n; simpl; reflexivity. Qed.
imports: Coq(Bool.Bool) Coq(Init.Nat) Coq(Arith.Arith) Coq(Arith.EqNat) Coq(Lia) Coq(Lists.List) Coq(Strings.String) LF(Maps)