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 "hints_declaration.ma".
16 include "sets/setoids1.ma".
18 ndefinition CPROP: setoid1.
21 | napply (mk_equivalence_relation1 CProp[0])
23 | #x; napply mk_iff; #H; nassumption
24 | #x; #y; *; #H1; #H2; napply mk_iff; nassumption
25 | #x; #y; #z; *; #H1; #H2; *; #H3; #H4; napply mk_iff; #w
26 [ napply (H3 (H1 w)) | napply (H2 (H4 w))]##]##]
29 alias symbol "hint_decl" = "hint_decl_CProp2".
30 unification hint 0 ≔ ⊢ CProp[0] ≡ carr1 CPROP.
32 (*ndefinition CProp0_of_CPROP: carr1 CPROP → CProp[0] ≝ λx.x.
33 ncoercion CProp0_of_CPROP : ∀x: carr1 CPROP. CProp[0] ≝ CProp0_of_CPROP
34 on _x: carr1 CPROP to CProp[0].*)
36 alias symbol "eq" = "setoid1 eq".
38 ndefinition fi': ∀A,B:CPROP. A = B → B → A.
39 #A; #B; #H; napply (fi … H); nassumption.
42 notation ". r" with precedence 50 for @{'fi $r}.
43 interpretation "fi" 'fi r = (fi' ?? r).
45 ndefinition and_morphism: unary_morphism1 CPROP (unary_morphism1_setoid1 CPROP CPROP).
46 napply (mk_binary_morphism1 … And);
47 #a; #a'; #b; #b'; #Ha; #Hb; @; *; #x; #y; @
48 [ napply (. Ha^-1) | napply (. Hb^-1) | napply (. Ha) | napply (. Hb)] //.
51 unification hint 0 ≔ A,B:CProp[0];
53 MM ≟ mk_unary_morphism1 …
54 (λX.mk_unary_morphism1 … (And X) (prop11 … (and_morphism X)))
55 (prop11 … and_morphism)
56 (*-------------------------------------------------------------*) ⊢
57 fun11 T T (fun11 T (unary_morphism1_setoid1 T T) MM A) B ≡ And A B.
62 nlemma test: ∀A,A',B: CProp[0]. A=A' → (B ∨ A) = B → (B ∧ A) ∧ B.
63 #A; #A'; #B; #H1; #H2; napply (. (#‡H1)‡H2^-1); nelim daemon.
70 ndefinition or_morphism: unary_morphism1 CPROP (unary_morphism1_setoid1 CPROP CPROP).
71 napply (mk_binary_morphism1 … Or);
72 #a; #a'; #b; #b'; #Ha; #Hb; @; *; #x
73 [ @1; napply (. Ha^-1) | @2; napply (. Hb^-1) | @1; napply (. Ha) | @2; napply (. Hb)] //.
76 unification hint 0 ≔ A,B:CProp[0];
78 MM ≟ mk_unary_morphism1 …
79 (λX.mk_unary_morphism1 … (Or X) (prop11 … (or_morphism X)))
80 (prop11 … or_morphism)
81 (*-------------------------------------------------------------*) ⊢
82 fun11 T T (fun11 T (unary_morphism1_setoid1 T T) MM A) B ≡ Or A B.
84 (* XXX always applied, generates hard unif problems
85 ndefinition if_morphism: unary_morphism1 CPROP (unary_morphism1_setoid1 CPROP CPROP).
86 napply (mk_binary_morphism1 … (λA,B:CProp[0]. A → B));
87 #a; #a'; #b; #b'; #Ha; #Hb; @; #H; #x
88 [ napply (. Hb^-1); napply H; napply (. Ha) | napply (. Hb); napply H; napply (. Ha^-1)]
92 unification hint 0 ≔ A,B:CProp[0];
94 R ≟ mk_unary_morphism1 …
95 (λX:CProp[0].mk_unary_morphism1 …
96 (λY:CProp[0]. X → Y) (prop11 … (if_morphism X)))
97 (prop11 … if_morphism)
98 (*----------------------------------------------------------------------*) ⊢
99 fun11 T T (fun11 T (unary_morphism1_setoid1 T T) R A) B ≡ A → B.
102 (* not as morphism *)
103 nlemma Not_morphism : CProp[0] ⇒_1 CProp[0].
104 @(λx:CProp[0].¬ x); #a b; *; #; @; /3/; nqed.
106 unification hint 0 ≔ P : CProp[0];
109 M ≟ mk_unary_morphism1 ?? (λP.¬ P) (prop11 ?? Not_morphism)
110 (*------------------------*)⊢
113 (* Ex setoid support *)
115 (* The caml, as some patches for it
116 ncoercion setoid1_of_setoid : ∀s:setoid. setoid1 ≝ setoid1_of_setoid on _s: setoid to setoid1.
119 (* simple case where the whole predicate can be rewritten *)
120 nlemma Ex_morphism : ∀S:setoid.((setoid1_of_setoid S) ⇒_1 CProp[0]) ⇒_1 CProp[0].
121 #S; @(λP: (setoid1_of_setoid S) ⇒_1 CProp[0].Ex S P);
122 #P Q E; @; *; #x Px; @x; ncases (E x x #); /2/; nqed.
124 unification hint 0 ≔ S : setoid, P : (setoid1_of_setoid S) ⇒_1 CProp[0];
125 A ≟ unary_morphism1_setoid1 (setoid1_of_setoid S) CPROP,
127 M ≟ mk_unary_morphism1 ?? (λP: (setoid1_of_setoid S) ⇒_1 CProp[0].Ex S P)
128 (prop11 ?? (Ex_morphism S))
129 (*------------------------*)⊢
130 fun11 A B M P ≡ Ex S (fun11 (setoid1_of_setoid S) CPROP P).
132 nlemma Ex_morphism_eta : ∀S:setoid.((setoid1_of_setoid S) ⇒_1 CProp[0]) ⇒_1 CProp[0].
133 #S; @(λP: (setoid1_of_setoid S) ⇒_1 CProp[0].Ex S (λx.P x));
134 #P Q E; @; *; #x Px; @x; ncases (E x x #); /2/; nqed.
136 unification hint 0 ≔ S : setoid, P : (setoid1_of_setoid S) ⇒_1 CProp[0];
137 A ≟ unary_morphism1_setoid1 (setoid1_of_setoid S) CPROP,
139 M ≟ mk_unary_morphism1 ?? (λP: (setoid1_of_setoid S) ⇒_1 CProp[0].Ex S (λx.P x))
140 (prop11 ?? (Ex_morphism_eta S))
141 (*------------------------*)⊢
142 fun11 A B M P ≡ Ex S (λx.fun11 (setoid1_of_setoid S) CPROP P x).
144 nlemma Ex_setoid : ∀S:setoid.((setoid1_of_setoid S) ⇒_1 CPROP) → setoid.
145 #T P; @ (Ex T (λx:T.P x)); @; ##[ #H1 H2; napply True |##*: //; ##] nqed.
147 unification hint 0 ≔ T,P ;
149 (*---------------------------*) ⊢
150 Ex T (λx:T.P x) ≡ carr S.
152 (* couts how many Ex we are traversing *)
153 ninductive counter : Type[0] ≝
155 | Next : (Prop → Prop) → (* dummy arg please the notation mechanism *)
158 (* to rewrite terms (live in setoid) *)
159 nlet rec mk_P (S, T : setoid) (n : counter) on n ≝
160 match n with [ End ⇒ T → CProp[0] | Next _ m ⇒ S → (mk_P S T m) ].
162 nlet rec mk_F (S, T : setoid) (n : counter) on n ≝
163 match n with [ End ⇒ T | Next _ m ⇒ S → (mk_F S T m) ].
165 nlet rec mk_E (S, T : setoid) (n : counter) on n : ∀f,g : mk_F S T n. CProp[0] ≝
167 [ End ⇒ λf,g:T. f = g
168 | Next q m ⇒ λf,g: mk_F S T (Next q m). ∀x:S.mk_E S T m (f x) (g x) ].
170 nlet rec mk_H (S, T : setoid) (n : counter) on n :
171 ∀P1,P2: mk_P S T n.∀f,g : mk_F S T n. CProp[1] ≝
173 [ End ⇒ λP1,P2:mk_P S T End.λf,g:T. f = g → P1 f =_1 P2 g
174 | Next q m ⇒ λP1,P2: mk_P S T (Next q m).λf,g: mk_F S T (Next q m).
175 ∀x:S.mk_H S T m (P1 x) (P2 x) (f x) (g x) ].
177 nlet rec mk_Ex (S, T : setoid) (n : counter) on n :
178 ∀P: mk_P S T n.∀f : mk_F S T n. CProp[0] ≝
180 [ End ⇒ λP:mk_P S T End.λf:T. P f
181 | Next q m ⇒ λP: mk_P S T (Next q m).λf: mk_F S T (Next q m).
182 ∃x:S.mk_Ex S T m (P x) (f x) ].
184 nlemma Sig_generic : ∀S,T.∀n:counter.∀P,f,g.
185 mk_E S T n f g → mk_H S T n P P f g → mk_Ex S T n P f =_1 mk_Ex S T n P g.
186 #S T n; nelim n; nnormalize;
188 ##| #q m IH P f g E H; @; *; #x Px; @x; ncases (IH … (E x) (H x)); /3/; ##]
191 (* to rewrite propositions (live in setoid1) *)
192 nlet rec mk_P1 (S : setoid) (T : setoid1) (n : counter) on n ≝
193 match n with [ End ⇒ T → CProp[0] | Next _ m ⇒ S → (mk_P1 S T m) ].
195 nlet rec mk_F1 (S : setoid) (T : setoid1) (n : counter) on n ≝
196 match n with [ End ⇒ T | Next _ m ⇒ S → (mk_F1 S T m) ].
198 nlet rec mk_E1 (S : setoid) (T : setoid1) (n : counter) on n : ∀f,g : mk_F1 S T n. CProp[1] ≝
200 [ End ⇒ λf,g:T. f =_1 g
201 | Next q m ⇒ λf,g: mk_F1 S T (Next q m). ∀x:S.mk_E1 S T m (f x) (g x) ].
203 nlet rec mk_H1 (S : setoid) (T : setoid1) (n : counter) on n :
204 ∀P1,P2: mk_P1 S T n.∀f,g : mk_F1 S T n. CProp[1] ≝
206 [ End ⇒ λP1,P2:mk_P1 S T End.λf,g:T. f = g → P1 f =_1 P2 g
207 | Next q m ⇒ λP1,P2: mk_P1 S T (Next q m).λf,g: mk_F1 S T (Next q m).
208 ∀x:S.mk_H1 S T m (P1 x) (P2 x) (f x) (g x) ].
210 nlet rec mk_Ex1 (S : setoid) (T : setoid1) (n : counter) on n :
211 ∀P: mk_P1 S T n.∀f : mk_F1 S T n. CProp[0] ≝
213 [ End ⇒ λP:mk_P1 S T End.λf:T. P f
214 | Next q m ⇒ λP: mk_P1 S T (Next q m).λf: mk_F1 S T (Next q m).
215 ∃x:S.mk_Ex1 S T m (P x) (f x) ].
217 nlemma Sig_generic1 : ∀S,T.∀n:counter.∀P,f,g.
218 mk_E1 S T n f g → mk_H1 S T n P P f g → mk_Ex1 S T n P f =_1 mk_Ex1 S T n P g.
219 #S T n; nelim n; nnormalize;
221 ##| #q m IH P f g E H; @; *; #x Px; @x; ncases (IH … (E x) (H x)); /3/; ##]
224 (* notation "∑x1,...,xn. E / H ; P" were:
225 - x1...xn are bound in E and P, H is bound in P
226 - H is an identifier that will have the type of E in P
227 - P is the proof that the two existentially quantified predicates are equal*)
228 notation > "∑ list1 ident x sep , . term 56 E / ident nE ; term 19 H" with precedence 20
230 ${ fold right @{ 'End } rec acc @{ ('Next (λ${ident x}.${ident x}) $acc) } }
231 ${ fold right @{ $E } rec acc @{ λ${ident x}.$acc } }
232 ${ fold right @{ λ${ident nE}.$H } rec acc @{ λ${ident x}.$acc } }
235 interpretation "next" 'Next x y = (Next x y).
236 interpretation "end" 'End = End.
237 interpretation "sig_gen" 'Sig_gen n E H = (Sig_generic ?? n ??? E H).
238 interpretation "sig_gen1" 'Sig_gen n E H = (Sig_generic1 ?? n ??? E H).
241 nlemma test0 : ∀S:setoid. ∀P: (setoid1_of_setoid S) ⇒_1 CPROP.∀f,g:S → S.
242 (∀x:S.f x = g x) → (Ex S (λw.P (f w))) =_1 (Ex S (λw.P (g w))).
243 #S P f g E; napply (∑w. E w / H ; ┼_1H); nqed.
245 nlemma test : ∀S:setoid. ∀P: (setoid1_of_setoid S) ⇒_1 CPROP.∀f,g:S → S.
246 (∀x:S.f x = g x) → (Ex S (λw.P (f w)∧ True)) =_1 (Ex S (λw.P (g w)∧ True)).
247 #S P f g E; napply (∑w. E w / H ; (┼_1H)╪_1#); nqed.
249 nlemma test_bound : ∀S:setoid. ∀e,f: (setoid1_of_setoid S) ⇒_1 CPROP. e = f →
250 (Ex S (λw.e w ∧ True)) =_1 (Ex S (λw.f w ∧ True)).
251 #S f g E; napply (.=_1 ∑x. E x x # / H ; (H ╪_1 #)); //; nqed.
253 nlemma test2 : ∀S:setoid. ∀ee: (setoid1_of_setoid S) ⇒_1 (setoid1_of_setoid S) ⇒_1 CPROP.
254 ∀x,y:setoid1_of_setoid S.x =_1 y →
255 (True ∧ (Ex S (λw.ee x w ∧ True))) =_1 (True ∧ (Ex S (λw.ee y w ∧ True))).
256 #S m x y E; napply (.=_1 #╪_1(∑w. E / E ; ((E ╪_1 #) ╪_1 #))). //; nqed.
258 nlemma test3 : ∀S:setoid. ∀ee: (setoid1_of_setoid S) ⇒_1 (setoid1_of_setoid S) ⇒_1 CPROP.
259 ∀x,y:setoid1_of_setoid S.x =_1 y →
260 ((Ex S (λw.ee x w ∧ True) ∨ True)) =_1 ((Ex S (λw.ee y w ∧ True) ∨ True)).
261 #S m x y E; napply (.=_1 (∑w. E / E ; ((E ╪_1 #) ╪_1 #)) ╪_1 #). //; nqed.