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/connectives.ma".
17 inductive Or (A,B:CProp) : CProp ≝
21 interpretation "constructive or" 'or x y = (Or x y).
23 inductive Or3 (A,B,C:CProp) : CProp ≝
24 | Left3 : A → Or3 A B C
25 | Middle3 : B → Or3 A B C
26 | Right3 : C → Or3 A B C.
28 interpretation "constructive ternary or" 'or3 x y z= (Or3 x y z).
30 notation < "hvbox(a break ∨ b break ∨ c)" with precedence 35 for @{'or3 $a $b $c}.
32 inductive Or4 (A,B,C,D:CProp) : CProp ≝
33 | Left3 : A → Or4 A B C D
34 | Middle3 : B → Or4 A B C D
35 | Right3 : C → Or4 A B C D
36 | Extra3: D → Or4 A B C D.
38 interpretation "constructive ternary or" 'or4 x y z t = (Or4 x y z t).
40 notation < "hvbox(a break ∨ b break ∨ c break ∨ d)" with precedence 35 for @{'or4 $a $b $c $d}.
42 inductive And (A,B:CProp) : CProp ≝
43 | Conj : A → B → And A B.
45 interpretation "constructive and" 'and x y = (And x y).
47 inductive And3 (A,B,C:CProp) : CProp ≝
48 | Conj3 : A → B → C → And3 A B C.
50 notation < "hvbox(a break ∧ b break ∧ c)" with precedence 35 for @{'and3 $a $b $c}.
52 interpretation "constructive ternary and" 'and3 x y z = (And3 x y z).
54 inductive And4 (A,B,C,D:CProp) : CProp ≝
55 | Conj4 : A → B → C → D → And4 A B C D.
57 notation < "hvbox(a break ∧ b break ∧ c break ∧ d)" with precedence 35 for @{'and4 $a $b $c $d}.
59 interpretation "constructive quaternary and" 'and4 x y z t = (And4 x y z t).
61 inductive exT (A:Type) (P:A→CProp) : CProp ≝
62 ex_introT: ∀w:A. P w → exT A P.
64 notation "\ll term 19 a, break term 19 b \gg"
65 with precedence 90 for @{'dependent_pair $a $b}.
66 interpretation "dependent pair" 'dependent_pair a b =
69 interpretation "CProp exists" 'exists \eta.x = (exT _ x).
71 notation "\ll term 19 a, break term 19 b \gg"
72 with precedence 90 for @{'dependent_pair $a $b}.
73 interpretation "dependent pair" 'dependent_pair a b =
77 definition pi1exT ≝ λA,P.λx:exT A P.match x with [ex_introT x _ ⇒ x].
79 λA,P.λx:exT A P.match x return λx.P (pi1exT ?? x) with [ex_introT _ p ⇒ p].
81 interpretation "exT \fst" 'pi1 = (pi1exT _ _).
82 interpretation "exT \fst" 'pi1a x = (pi1exT _ _ x).
83 interpretation "exT \fst" 'pi1b x y = (pi1exT _ _ x y).
84 interpretation "exT \snd" 'pi2 = (pi2exT _ _).
85 interpretation "exT \snd" 'pi2a x = (pi2exT _ _ x).
86 interpretation "exT \snd" 'pi2b x y = (pi2exT _ _ x y).
88 inductive exT23 (A:Type) (P:A→CProp) (Q:A→CProp) (R:A→A→CProp) : CProp ≝
89 ex_introT23: ∀w,p:A. P w → Q p → R w p → exT23 A P Q R.
92 λA,P,Q,R.λx:exT23 A P Q R.match x with [ex_introT23 x _ _ _ _ ⇒ x].
94 λA,P,Q,R.λx:exT23 A P Q R.match x with [ex_introT23 _ x _ _ _ ⇒ x].
96 interpretation "exT2 \fst" 'pi1 = (pi1exT23 _ _ _ _).
97 interpretation "exT2 \snd" 'pi2 = (pi2exT23 _ _ _ _).
98 interpretation "exT2 \fst" 'pi1a x = (pi1exT23 _ _ _ _ x).
99 interpretation "exT2 \snd" 'pi2a x = (pi2exT23 _ _ _ _ x).
100 interpretation "exT2 \fst" 'pi1b x y = (pi1exT23 _ _ _ _ x y).
101 interpretation "exT2 \snd" 'pi2b x y = (pi2exT23 _ _ _ _ x y).
103 inductive exT2 (A:Type) (P,Q:A→CProp) : CProp ≝
104 ex_introT2: ∀w:A. P w → Q w → exT2 A P Q.
106 definition Not : CProp → Prop ≝ λx:CProp.x → False.
108 interpretation "constructive not" 'not x = (Not x).
110 definition cotransitive ≝
111 λC:Type.λlt:C→C→CProp.∀x,y,z:C. lt x y → lt x z ∨ lt z y.
113 definition coreflexive ≝ λC:Type.λlt:C→C→CProp. ∀x:C. ¬ (lt x x).
115 definition symmetric ≝ λC:Type.λlt:C→C→CProp. ∀x,y:C.lt x y → lt y x.
117 definition antisymmetric ≝ λA:Type.λR:A→A→CProp.λeq:A→A→Prop.∀x:A.∀y:A.R x y→R y x→eq x y.
119 definition reflexive ≝ λA:Type.λR:A→A→CProp.∀x:A.R x x.
121 definition transitive ≝ λA:Type.λR:A→A→CProp.∀x,y,z:A.R x y → R y z → R x z.