From 962fc96123039b53b9c6946796e909fb50ec9004 Mon Sep 17 00:00:00 2001 From: Josh Chen Date: Mon, 13 Aug 2018 10:37:20 +0200 Subject: rcompose done --- Equal.thy | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) (limited to 'Equal.thy') diff --git a/Equal.thy b/Equal.thy index d910bb8..93f623f 100644 --- a/Equal.thy +++ b/Equal.thy @@ -15,7 +15,7 @@ section \Constants and syntax\ axiomatization Equal :: "[Term, Term, Term] \ Term" and refl :: "Term \ Term" and - indEqual :: "[Term \ Term, Term, Term, Term] \ Term" ("(1ind\<^sub>=)") + indEqual :: "[Term \ Term, Term] \ Term" ("(1ind\<^sub>=)") syntax "_EQUAL" :: "[Term, Term, Term] \ Term" ("(3_ =\<^sub>_/ _)" [101, 0, 101] 100) @@ -35,16 +35,16 @@ and Equal_elim: "\ \x y. \x: A; y: A\ \ C(x)(y): x =\<^sub>A y \ U(i); \x. x: A \ f(x) : C(x)(x)(refl x); - a: A; - b: A; + x: A; + y: A; p: a =\<^sub>A b - \ \ ind\<^sub>=(f)(a)(b)(p) : C(a)(b)(p)" + \ \ ind\<^sub>=(f)(p) : C(x)(y)(p)" and Equal_comp: "\ \x y. \x: A; y: A\ \ C(x)(y): x =\<^sub>A y \ U(i); \x. x: A \ f(x) : C(x)(x)(refl x); a: A - \ \ ind\<^sub>=(f)(a)(a)(refl(a)) \ f(a)" + \ \ ind\<^sub>=(f)(refl(a)) \ f(a)" text "Admissible inference rules for equality type formation:" (* @@ -56,7 +56,7 @@ and Equal_form_cond3: "a =\<^sub>A b: U(i) \ b: A" *) lemmas Equal_rules [intro] = Equal_form Equal_intro Equal_elim Equal_comp -(*lemmas Equal_form_conds [intro] = Equal_form_cond1 Equal_form_cond2 Equal_form_cond3*) +(*lemmas Equal_wellform [intro] = Equal_form_cond1 Equal_form_cond2 Equal_form_cond3*) lemmas Equal_comps [comp] = Equal_comp -- cgit v1.2.3