(* This file was automatically generated: do not edit *********************)
-set "baseuri" "cic:/matita/LAMBDA-TYPES/Base-1/ext/tactics".
-
include "preamble.ma".
theorem insert_eq:
\forall (S: Set).(\forall (x: S).(\forall (P: ((S \to Prop))).(\forall (G:
-Prop).(((\forall (y: S).((P y) \to ((eq S y x) \to G)))) \to ((P x) \to G)))))
+((S \to Prop))).(((\forall (y: S).((P y) \to ((eq S y x) \to (G y))))) \to
+((P x) \to (G x))))))
\def
\lambda (S: Set).(\lambda (x: S).(\lambda (P: ((S \to Prop))).(\lambda (G:
-Prop).(\lambda (H: ((\forall (y: S).((P y) \to ((eq S y x) \to
-G))))).(\lambda (H0: (P x)).(H x H0 (refl_equal S x))))))).
+((S \to Prop))).(\lambda (H: ((\forall (y: S).((P y) \to ((eq S y x) \to (G
+y)))))).(\lambda (H0: (P x)).(H x H0 (refl_equal S x))))))).
theorem unintro:
\forall (A: Set).(\forall (a: A).(\forall (P: ((A \to Prop))).(((\forall (x: