cicInspect: now we can choose not to count the Cic.Implicit constructors

[helm.git] / helm / software / matita / contribs / LAMBDA-TYPES / Base-1 / blt / props.ma

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Base-1/blt/props.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Base-1/blt/props.ma
index c7952ebd20beb6df6fa93426d1c0784f4e0d6255..751dcee9c59db4727038f5315f0b7f4269985b49 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Base-1/blt/props.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Base-1/blt/props.ma
@@ -14,9 +14,7 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-set "baseuri" "cic:/matita/LAMBDA-TYPES/Base-1/blt/props".
-
-include "blt/defs.ma".
+include "Base-1/blt/defs.ma".
 
 theorem lt_blt:
  \forall (x: nat).(\forall (y: nat).((lt y x) \to (eq bool (blt y x) true)))
@@ -78,8 +76,8 @@ true)).(let H0 \def (match H in eq return (\lambda (b: bool).(\lambda (_: (eq
 n0 (S n)))) (\lambda (_: (eq bool true true)).(le_S_n (S O) (S n) (le_n_S (S 
 O) (S n) (le_n_S O n (le_O_n n))))) (\lambda (n0: nat).(\lambda (_: (((eq 
 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_le_S (S n0) 
-(S n) (lt_n_S n0 n (H n0 H1)))))) y)))) x).
+\to (lt n0 (S n))))).(\lambda (H1: (eq bool (blt n0 n) true)).(lt_n_S n0 n (H 
+n0 H1))))) y)))) x).
 
 theorem bge_le:
  \forall (x: nat).(\forall (y: nat).((eq bool (blt y x) false) \to (le x y)))