1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 (* This file was automatically generated: do not edit *********************)
19 (*#***********************************************************************)
21 (* v * The Coq Proof Assistant / The Coq Development Team *)
23 (* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
25 (* \VV/ **************************************************************)
27 (* // * This file is distributed under the terms of the *)
29 (* * GNU Lesser General Public License Version 2.1 *)
31 (*#***********************************************************************)
33 (*i $Id: Disjoint_Union.v,v 1.9.2.1 2004/07/16 19:31:19 herbelin Exp $ i*)
35 (*#* Author: Cristina Cornes
36 From : Constructing Recursion Operators in Type Theory
37 L. Paulson JSC (1986) 2, 325-355 *)
39 include "Relations/Relation_Operators.ma".
42 Section Wf_Disjoint_Union
46 cic:/Coq/Wellfounded/Disjoint_Union/Wf_Disjoint_Union/A.var
50 cic:/Coq/Wellfounded/Disjoint_Union/Wf_Disjoint_Union/B.var
54 cic:/Coq/Wellfounded/Disjoint_Union/Wf_Disjoint_Union/leA.var
58 cic:/Coq/Wellfounded/Disjoint_Union/Wf_Disjoint_Union/leB.var
62 Notation Le_AsB := (le_AsB A B leA leB).
65 inline procedural "cic:/Coq/Wellfounded/Disjoint_Union/acc_A_sum.con" as lemma.
67 inline procedural "cic:/Coq/Wellfounded/Disjoint_Union/acc_B_sum.con" as lemma.
69 inline procedural "cic:/Coq/Wellfounded/Disjoint_Union/wf_disjoint_sum.con" as lemma.