From e0433942a61cfe8b43b68a81efa7d7d68abe3c5a Mon Sep 17 00:00:00 2001 From: matitaweb Date: Wed, 7 Sep 2011 12:48:18 +0000 Subject: [PATCH] logic.ma is now enriched using the correct syntax. --- weblib/basics/logic.ma | 136 ++++++++++++++++++++--------------------- 1 file changed, 68 insertions(+), 68 deletions(-) diff --git a/weblib/basics/logic.ma b/weblib/basics/logic.ma index 34299aff0..374947b7d 100644 --- a/weblib/basics/logic.ma +++ b/weblib/basics/logic.ma @@ -20,43 +20,43 @@ inductive eq (A:Type[1]) (x:A) : A → Prop ≝ interpretation "leibnitz's equality" 'eq t x y = (eq t x y). lemma eq_rect_r: - ∀A.∀a,x.∀p:eq ? x a.∀P: - ∀x:A. x = a → Type[2]. P a (refl A a) → P x p. + ∀A.∀a,x.∀p:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A ? x a.∀P: + ∀x:A. x A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A a → Type[2]. P a (refl A a) → P x p. #A #a #x #p (cases p) // qed. lemma eq_ind_r : - ∀A.∀a.∀P: ∀x:A. x = a → Prop. P a (refl A a) → - ∀x.∀p:eq ? x a.P x p. - #A #a #P #p #x0 #p0; @(eq_rect_r ? ? ? p0) //; qed. + ∀A.∀a.∀P: ∀x:A. x A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A a → Prop. P a (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A A a) → + ∀x.∀p:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A ? x a.P x p. + #A #a #P #p #x0 #p0; @(A href="cic:/matita/basics/logic/eq_rect_r.def(1)"eq_rect_r/A ? ? ? p0) //; 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: ∀x:A. A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A ? x a → Type[2]. P a (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A A a) → + ∀x.∀p:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A ? x a.P x p. #A #a #P #H #x #p (generalize in match H) (generalize in match P) cases p; //; qed. -theorem rewrite_l: ∀A:Type[1].∀x.∀P:A → Type[1]. P x → ∀y. x = y → P y. +theorem rewrite_l: ∀A:Type[1].∀x.∀P:A → Type[1]. P x → ∀y. x A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A 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. +theorem sym_eq: ∀A.∀x,y:A. x A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A y → y A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A x. +#A #x #y #Heq @(A href="cic:/matita/basics/logic/rewrite_l.def(1)"rewrite_l/A A x (λz.zA title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/Ax)); //; qed. -theorem rewrite_r: ∀A:Type[1].∀x.∀P:A → Type[1]. P x → ∀y. y = x → P y. -#A #x #P #Hx #y #Heq (cases (sym_eq ? ? ? Heq)); //; qed. +theorem rewrite_r: ∀A:Type[1].∀x.∀P:A → Type[1]. P x → ∀y. y A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A x → P y. +#A #x #P #Hx #y #Heq (cases (A href="cic:/matita/basics/logic/sym_eq.def(2)"sym_eq/A ? ? ? Heq)); //; qed. -theorem eq_coerc: ∀A,B:Type[0].A→(A=B)→B. +theorem eq_coerc: ∀A,B:Type[0].A→(AA title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/AB)→B. #A #B #Ha #Heq (elim Heq); //; qed. -theorem trans_eq : ∀A.∀x,y,z:A. x = y → y = z → x = z. +theorem trans_eq : ∀A.∀x,y,z:A. x A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A y → y A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A z → x A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A z. #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. +theorem eq_f: ∀A,B.∀f:A→B.∀x,y:A. xA title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/Ay → f x A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A f y. #A #B #f #x #y #H >H; //; qed. (* deleterio per auto? *) theorem eq_f2: ∀A,B,C.∀f:A→B→C. -∀x1,x2:A.∀y1,y2:B. x1=x2 → y1=y2 → f x1 y1 = f x2 y2. -#A #B #C #f #x1 #x2 #y1 #y2 #E1 #E2 >E1; >E2; //; qed. +∀x1,x2:A.∀y1,y2:B. x1A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/Ax2 → y1A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/Ay2 → f x1 y1 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A f x2 y2. +#A #B #C #f #x1 #x2 #y1 #y2 #E1 #E2 E1; E2; //; qed. (* hint to genereric equality definition eq_equality: equality ≝ @@ -80,12 +80,12 @@ inductive False: Prop ≝ . λA. A → False. *) inductive Not (A:Prop): Prop ≝ -nmk: (A → False) → Not A. +nmk: (A → A href="cic:/matita/basics/logic/False.ind(1,0,0)"False/A) → Not A. interpretation "logical not" 'not x = (Not x). -theorem absurd : ∀A:Prop. A → ¬A → False. +theorem absurd : ∀A:Prop. A → A title="logical not" href="cic:/fakeuri.def(1)"¬/AA → A href="cic:/matita/basics/logic/False.ind(1,0,0)"False/A. #A #H #Hn (elim Hn); /2/; qed. (* @@ -93,13 +93,13 @@ ntheorem absurd : ∀ A,C:Prop. A → ¬A → C. #A; #C; #H; #Hn; nelim (Hn H). nqed. *) -theorem not_to_not : ∀A,B:Prop. (A → B) → ¬B →¬A. +theorem not_to_not : ∀A,B:Prop. (A → B) → A title="logical not" href="cic:/fakeuri.def(1)"¬/AB →A title="logical not" href="cic:/fakeuri.def(1)"¬/AA. /4/; qed. (* inequality *) interpretation "leibnitz's non-equality" 'neq t x y = (Not (eq t x y)). -theorem sym_not_eq: ∀A.∀x,y:A. x ≠ y → y ≠ x. +theorem sym_not_eq: ∀A.∀x,y:A. x A title="leibnitz's non-equality" href="cic:/fakeuri.def(1)"≠/A y → y A title="leibnitz's non-equality" href="cic:/fakeuri.def(1)"≠/A x. /3/; qed. (* and *) @@ -108,10 +108,10 @@ inductive And (A,B:Prop) : Prop ≝ interpretation "logical and" 'and x y = (And x y). -theorem proj1: ∀A,B:Prop. A ∧ B → A. +theorem proj1: ∀A,B:Prop. A A title="logical and" href="cic:/fakeuri.def(1)"∧/A B → A. #A #B #AB (elim AB) //; qed. -theorem proj2: ∀ A,B:Prop. A ∧ B → B. +theorem proj2: ∀ A,B:Prop. A A title="logical and" href="cic:/fakeuri.def(1)"∧/A B → B. #A #B #AB (elim AB) //; qed. (* or *) @@ -122,7 +122,7 @@ inductive Or (A,B:Prop) : Prop ≝ interpretation "logical or" 'or x y = (Or x y). definition decidable : Prop → Prop ≝ -λ A:Prop. A ∨ ¬ A. +λ A:Prop. A A title="logical or" href="cic:/fakeuri.def(1)"∨/A A title="logical not" href="cic:/fakeuri.def(1)"¬/A A. (* exists *) inductive ex (A:Type[0]) (P:A → Prop) : Prop ≝ @@ -135,7 +135,7 @@ inductive ex2 (A:Type[0]) (P,Q:A →Prop) : Prop ≝ (* iff *) definition iff := - λ A,B. (A → B) ∧ (B → A). + λ A,B. (A → B) A title="logical and" href="cic:/fakeuri.def(1)"∧/A (B → A). interpretation "iff" 'iff a b = (iff a b). @@ -143,84 +143,84 @@ interpretation "iff" 'iff a b = (iff a b). definition R0 ≝ λT:Type[0].λt:T.t. -definition R1 ≝ eq_rect_Type0. +definition R1 ≝ A href="cic:/matita/basics/logic/eq_rect_Type0.fix(0,5,1)"eq_rect_Type0/A. (* useless stuff *) definition R2 : ∀T0:Type[0]. ∀a0:T0. - ∀T1:∀x0:T0. a0=x0 → Type[0]. - ∀a1:T1 a0 (refl ? a0). - ∀T2:∀x0:T0. ∀p0:a0=x0. ∀x1:T1 x0 p0. R1 ?? T1 a1 ? p0 = x1 → Type[0]. - ∀a2:T2 a0 (refl ? a0) a1 (refl ? a1). + ∀T1:∀x0:T0. a0A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/Ax0 → Type[0]. + ∀a1:T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? a0). + ∀T2:∀x0:T0. ∀p0:a0A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/Ax0. ∀x1:T1 x0 p0. A href="cic:/matita/basics/logic/R1.def(2)"R1/A ?? T1 a1 ? p0 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A x1 → Type[0]. + ∀a2:T2 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? a1). ∀b0:T0. - ∀e0:a0 = b0. + ∀e0:a0 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A b0. ∀b1: T1 b0 e0. - ∀e1:R1 ?? T1 a1 ? e0 = b1. + ∀e1:A href="cic:/matita/basics/logic/R1.def(2)"R1/A ?? T1 a1 ? e0 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A b1. T2 b0 e0 b1 e1. #T0 #a0 #T1 #a1 #T2 #a2 #b0 #e0 #b1 #e1 -@(eq_rect_Type0 ????? e1) -@(R1 ?? ? ?? e0) +@(A href="cic:/matita/basics/logic/eq_rect_Type0.fix(0,5,1)"eq_rect_Type0/A ????? e1) +@(A href="cic:/matita/basics/logic/R1.def(2)"R1/A ?? ? ?? e0) @a2 qed. definition R3 : ∀T0:Type[0]. ∀a0:T0. - ∀T1:∀x0:T0. a0=x0 → Type[0]. - ∀a1:T1 a0 (refl ? a0). - ∀T2:∀x0:T0. ∀p0:a0=x0. ∀x1:T1 x0 p0. R1 ?? T1 a1 ? p0 = x1 → Type[0]. - ∀a2:T2 a0 (refl ? a0) a1 (refl ? a1). - ∀T3:∀x0:T0. ∀p0:a0=x0. ∀x1:T1 x0 p0.∀p1:R1 ?? T1 a1 ? p0 = x1. - ∀x2:T2 x0 p0 x1 p1.R2 ???? T2 a2 x0 p0 ? p1 = x2 → Type[0]. - ∀a3:T3 a0 (refl ? a0) a1 (refl ? a1) a2 (refl ? a2). + ∀T1:∀x0:T0. a0A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/Ax0 → Type[0]. + ∀a1:T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? a0). + ∀T2:∀x0:T0. ∀p0:a0A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/Ax0. ∀x1:T1 x0 p0. A href="cic:/matita/basics/logic/R1.def(2)"R1/A ?? T1 a1 ? p0 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A x1 → Type[0]. + ∀a2:T2 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? a1). + ∀T3:∀x0:T0. ∀p0:a0A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/Ax0. ∀x1:T1 x0 p0.∀p1:A href="cic:/matita/basics/logic/R1.def(2)"R1/A ?? T1 a1 ? p0 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A x1. + ∀x2:T2 x0 p0 x1 p1.A href="cic:/matita/basics/logic/R2.def(3)"R2/A ???? T2 a2 x0 p0 ? p1 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A x2 → Type[0]. + ∀a3:T3 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? a1) a2 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? a2). ∀b0:T0. - ∀e0:a0 = b0. + ∀e0:a0 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A b0. ∀b1: T1 b0 e0. - ∀e1:R1 ?? T1 a1 ? e0 = b1. + ∀e1:A href="cic:/matita/basics/logic/R1.def(2)"R1/A ?? T1 a1 ? e0 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A b1. ∀b2: T2 b0 e0 b1 e1. - ∀e2:R2 ???? T2 a2 b0 e0 ? e1 = b2. + ∀e2:A href="cic:/matita/basics/logic/R2.def(3)"R2/A ???? T2 a2 b0 e0 ? e1 A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A b2. T3 b0 e0 b1 e1 b2 e2. #T0 #a0 #T1 #a1 #T2 #a2 #T3 #a3 #b0 #e0 #b1 #e1 #b2 #e2 -@(eq_rect_Type0 ????? e2) -@(R2 ?? ? ???? e0 ? e1) +@(A href="cic:/matita/basics/logic/eq_rect_Type0.fix(0,5,1)"eq_rect_Type0/A ????? e2) +@(A href="cic:/matita/basics/logic/R2.def(3)"R2/A ?? ? ???? e0 ? e1) @a3 qed. definition R4 : ∀T0:Type[0]. ∀a0:T0. - ∀T1:∀x0:T0. eq T0 a0 x0 → Type[0]. - ∀a1:T1 a0 (refl T0 a0). - ∀T2:∀x0:T0. ∀p0:eq (T0 …) a0 x0. ∀x1:T1 x0 p0.eq (T1 …) (R1 T0 a0 T1 a1 x0 p0) x1 → Type[0]. - ∀a2:T2 a0 (refl T0 a0) a1 (refl (T1 a0 (refl T0 a0)) a1). - ∀T3:∀x0:T0. ∀p0:eq (T0 …) a0 x0. ∀x1:T1 x0 p0.∀p1:eq (T1 …) (R1 T0 a0 T1 a1 x0 p0) x1. - ∀x2:T2 x0 p0 x1 p1.eq (T2 …) (R2 T0 a0 T1 a1 T2 a2 x0 p0 x1 p1) x2 → Type[0]. - ∀a3:T3 a0 (refl T0 a0) a1 (refl (T1 a0 (refl T0 a0)) a1) - a2 (refl (T2 a0 (refl T0 a0) a1 (refl (T1 a0 (refl T0 a0)) a1)) a2). - ∀T4:∀x0:T0. ∀p0:eq (T0 …) a0 x0. ∀x1:T1 x0 p0.∀p1:eq (T1 …) (R1 T0 a0 T1 a1 x0 p0) x1. - ∀x2:T2 x0 p0 x1 p1.∀p2:eq (T2 …) (R2 T0 a0 T1 a1 T2 a2 x0 p0 x1 p1) x2. - ∀x3:T3 x0 p0 x1 p1 x2 p2.∀p3:eq (T3 …) (R3 T0 a0 T1 a1 T2 a2 T3 a3 x0 p0 x1 p1 x2 p2) x3. + ∀T1:∀x0:T0. A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A T0 a0 x0 → Type[0]. + ∀a1:T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0). + ∀T2:∀x0:T0. ∀p0:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T0 …) a0 x0. ∀x1:T1 x0 p0.A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T1 …) (A href="cic:/matita/basics/logic/R1.def(2)"R1/A T0 a0 T1 a1 x0 p0) x1 → Type[0]. + ∀a2:T2 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0)) a1). + ∀T3:∀x0:T0. ∀p0:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T0 …) a0 x0. ∀x1:T1 x0 p0.∀p1:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T1 …) (A href="cic:/matita/basics/logic/R1.def(2)"R1/A T0 a0 T1 a1 x0 p0) x1. + ∀x2:T2 x0 p0 x1 p1.A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T2 …) (A href="cic:/matita/basics/logic/R2.def(3)"R2/A T0 a0 T1 a1 T2 a2 x0 p0 x1 p1) x2 → Type[0]. + ∀a3:T3 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0)) a1) + a2 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T2 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0)) a1)) a2). + ∀T4:∀x0:T0. ∀p0:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T0 …) a0 x0. ∀x1:T1 x0 p0.∀p1:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T1 …) (A href="cic:/matita/basics/logic/R1.def(2)"R1/A T0 a0 T1 a1 x0 p0) x1. + ∀x2:T2 x0 p0 x1 p1.∀p2:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T2 …) (A href="cic:/matita/basics/logic/R2.def(3)"R2/A T0 a0 T1 a1 T2 a2 x0 p0 x1 p1) x2. + ∀x3:T3 x0 p0 x1 p1 x2 p2.∀p3:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T3 …) (A href="cic:/matita/basics/logic/R3.def(4)"R3/A T0 a0 T1 a1 T2 a2 T3 a3 x0 p0 x1 p1 x2 p2) x3. Type[0]. - ∀a4:T4 a0 (refl T0 a0) a1 (refl (T1 a0 (refl T0 a0)) a1) - a2 (refl (T2 a0 (refl T0 a0) a1 (refl (T1 a0 (refl T0 a0)) a1)) a2) - a3 (refl (T3 a0 (refl T0 a0) a1 (refl (T1 a0 (refl T0 a0)) a1) - a2 (refl (T2 a0 (refl T0 a0) a1 (refl (T1 a0 (refl T0 a0)) a1)) a2)) + ∀a4:T4 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0)) a1) + a2 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T2 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0)) a1)) a2) + a3 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T3 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0)) a1) + a2 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T2 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0) a1 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A (T1 a0 (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A T0 a0)) a1)) a2)) a3). ∀b0:T0. - ∀e0:eq (T0 …) a0 b0. + ∀e0:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T0 …) a0 b0. ∀b1: T1 b0 e0. - ∀e1:eq (T1 …) (R1 T0 a0 T1 a1 b0 e0) b1. + ∀e1:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T1 …) (A href="cic:/matita/basics/logic/R1.def(2)"R1/A T0 a0 T1 a1 b0 e0) b1. ∀b2: T2 b0 e0 b1 e1. - ∀e2:eq (T2 …) (R2 T0 a0 T1 a1 T2 a2 b0 e0 b1 e1) b2. + ∀e2:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T2 …) (A href="cic:/matita/basics/logic/R2.def(3)"R2/A T0 a0 T1 a1 T2 a2 b0 e0 b1 e1) b2. ∀b3: T3 b0 e0 b1 e1 b2 e2. - ∀e3:eq (T3 …) (R3 T0 a0 T1 a1 T2 a2 T3 a3 b0 e0 b1 e1 b2 e2) b3. + ∀e3:A href="cic:/matita/basics/logic/eq.ind(1,0,2)"eq/A (T3 …) (A href="cic:/matita/basics/logic/R3.def(4)"R3/A T0 a0 T1 a1 T2 a2 T3 a3 b0 e0 b1 e1 b2 e2) b3. T4 b0 e0 b1 e1 b2 e2 b3 e3. #T0 #a0 #T1 #a1 #T2 #a2 #T3 #a3 #T4 #a4 #b0 #e0 #b1 #e1 #b2 #e2 #b3 #e3 -@(eq_rect_Type0 ????? e3) -@(R3 ????????? e0 ? e1 ? e2) +@(A href="cic:/matita/basics/logic/eq_rect_Type0.fix(0,5,1)"eq_rect_Type0/A ????? e3) +@(A href="cic:/matita/basics/logic/R3.def(4)"R3/A ????????? e0 ? e1 ? e2) @a4 qed. (* TODO concrete definition by means of proof irrelevance *) -axiom streicherK : ∀T:Type[1].∀t:T.∀P:t = t → Type[2].P (refl ? t) → ∀p.P p. \ No newline at end of file +axiom streicherK : ∀T:Type[1].∀t:T.∀P:t A title="leibnitz's equality" href="cic:/fakeuri.def(1)"=/A t → Type[2].P (A href="cic:/matita/basics/logic/eq.con(0,1,2)"refl/A ? t) → ∀p.P p. -- 2.39.2