(* This file was automatically generated: do not edit *********************)
-include "Base-1/blt/defs.ma".
+include "Ground-1/blt/defs.ma".
theorem lt_blt:
\forall (x: nat).(\forall (y: nat).((lt y x) \to (eq bool (blt y x) true)))
\to (eq bool (match n0 with [O \Rightarrow true | (S m) \Rightarrow (blt m
n)]) true)))).(\lambda (H1: (lt (S n0) (S n))).(H n0 (le_S_n (S n0) n H1)))))
y)))) x).
+(* COMMENTS
+Initial nodes: 291
+END *)
theorem le_bge:
\forall (x: nat).(\forall (y: nat).((le x y) \to (eq bool (blt y x) false)))
nat).(\lambda (_: (((le (S n) n0) \to (eq bool (blt n0 (S n))
false)))).(\lambda (H1: (le (S n) (S n0))).(H n0 (le_S_n n n0 H1))))) y))))
x).
+(* COMMENTS
+Initial nodes: 293
+END *)
theorem blt_lt:
\forall (x: nat).(\forall (y: nat).((eq bool (blt y x) true) \to (lt y x)))
bool (match n0 with [O \Rightarrow true | (S m) \Rightarrow (blt m n)]) true)
\to (lt n0 (S n))))).(\lambda (H1: (eq bool (blt n0 n) true)).(lt_n_S n0 n (H
n0 H1))))) y)))) x).
+(* COMMENTS
+Initial nodes: 252
+END *)
theorem bge_le:
\forall (x: nat).(\forall (y: nat).((eq bool (blt y x) false) \to (le x y)))
(S n)) false) \to (le (S n) n0)))).(\lambda (H1: (eq bool (blt (S n0) (S n))
false)).(le_S_n (S n) (S n0) (le_n_S (S n) (S n0) (le_n_S n n0 (H n0
H1))))))) y)))) x).
+(* COMMENTS
+Initial nodes: 262
+END *)