proposition: Theorem lia_fail1 : 0 = 1.
proof: Proof. Fail lia. Abort. Theorem lia_fail2 : forall (n : nat), n >= 1 -> 2 ^ n = 2 * 2 ^ (n - 1). Proof. Fail lia. Abort. Theorem eq_example1 : forall (A B C : Type) (f : A -> B) (g : B -> C) (x : A) (y : B), y = f x -> g y = g (f x). Proof. intros. rewrite H. reflexivity. Qed.
imports: Coq(Arith List) LF(IndProp) Coq(Lia)