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 include "logic/equality.ma".
17 inductive Or (A,B:CProp) : CProp ≝
21 interpretation "constructive or" 'or x y =
22 (cic:/matita/dama/cprop_connectives/Or.ind#xpointer(1/1) x y).
24 inductive And (A,B:CProp) : CProp ≝
25 | Conj : A → B → And A B.
27 interpretation "constructive and" 'and x y =
28 (cic:/matita/dama/cprop_connectives/And.ind#xpointer(1/1) x y).
30 inductive exT (A:Type) (P:A→CProp) : CProp ≝
31 ex_introT: ∀w:A. P w → exT A P.
33 inductive ex (A:Type) (P:A→Prop) : Type ≝ (* ??? *)
34 ex_intro: ∀w:A. P w → ex A P.
36 interpretation "constructive exists" 'exists \eta.x =
37 (cic:/matita/dama/cprop_connectives/ex.ind#xpointer(1/1) _ x).
39 interpretation "constructive exists (Type)" 'exists \eta.x =
40 (cic:/matita/dama/cprop_connectives/exT.ind#xpointer(1/1) _ x).
42 inductive False : CProp ≝ .
44 definition Not ≝ λx:CProp.x → False.
46 interpretation "constructive not" 'not x =
47 (cic:/matita/dama/cprop_connectives/Not.con x).
49 definition cotransitive ≝
50 λC:Type.λlt:C→C→CProp.∀x,y,z:C. lt x y → lt x z ∨ lt z y.
52 definition coreflexive ≝ λC:Type.λlt:C→C→CProp. ∀x:C. ¬ (lt x x).
54 definition symmetric ≝ λC:Type.λlt:C→C→CProp. ∀x,y:C.lt x y → lt y x.
56 definition antisymmetric ≝ λA:Type.λR:A→A→CProp.λeq:A→A→CProp.∀x:A.∀y:A.R x y→R y x→eq x y.
58 definition reflexive ≝ λA:Type.λR:A→A→CProp.∀x:A.R x x.
60 definition transitive ≝ λA:Type.λR:A→A→CProp.∀x,y,z:A.R x y → R y z → R x z.