lemma eq_rect_Type0_r:
∀A.∀a.∀P: ∀x:A. eq ? x a → Type[0]. P a (refl A a) → ∀x.∀p:eq ? x a.P x p.
- #A #a #P #H #x #p (generalize in match H) (generalize in match P)
+ #A #a #P #H #x #p (generalize {match H}) (generalize {match P})
cases p; //; qed.
-
+
+lemma eq_rect_Type1_r:
+ ∀A.∀a.∀P: ∀x:A. eq ? x a → Type[1]. P a (refl A a) → ∀x.∀p:eq ? x a.P x p.
+ #A #a #P #H #x #p (generalize {match H}) (generalize {match P})
+ cases p; //; qed.
+
lemma eq_rect_Type2_r:
∀A.∀a.∀P: ∀x:A. eq ? x a → Type[2]. P a (refl A a) → ∀x.∀p:eq ? x a.P x p.
- #A #a #P #H #x #p (generalize in match H) (generalize in match P)
+ #A #a #P #H #x #p (generalize {match H}) (generalize {match P})
cases p; //; qed.
lemma eq_rect_Type3_r:
∀A.∀a.∀P: ∀x:A. eq ? x a → Type[3]. P a (refl A a) → ∀x.∀p:eq ? x a.P x p.
- #A #a #P #H #x #p (generalize in match H) (generalize in match P)
+ #A #a #P #H #x #p (generalize {match H}) (generalize {match P})
cases p; //; qed.
theorem rewrite_l: ∀A:Type[2].∀x.∀P:A → Type[2]. P x → ∀y. x = y → P y.
#A #x #P #Hx #y #Heq (cases Heq); //; qed.
theorem sym_eq: ∀A.∀x,y:A. x = y → y = x.
-#A #x #y #Heq @(rewrite_l A x (λz.z=x)) // qed-.
+#A #x #y #Heq @(rewrite_l A x (λz.z=x)) // qed.
theorem rewrite_r: ∀A:Type[2].∀x.∀P:A → Type[2]. P x → ∀y. y = x → P y.
#A #x #P #Hx #y #Heq (cases (sym_eq ? ? ? Heq)); //; qed.
#A #B #Ha #Heq (elim Heq); //; qed.
theorem trans_eq : ∀A.∀x,y,z:A. x = y → y = z → x = z.
-#A #x #y #z #H1 #H2 >H1; //; qed-.
+#A #x #y #z #H1 #H2 >H1; //; qed.
theorem eq_f: ∀A,B.∀f:A→B.∀x,y:A. x=y → f x = f y.
#A #B #f #x #y #H >H; //; qed.