From 9b17aac85aa650a7a9d6463d3d01f1eb228d4572 Mon Sep 17 00:00:00 2001
From: Josh Chen
Date: Tue, 11 Sep 2018 08:59:16 +0200
Subject: Go back to higher-order application notation

---
 Equal.thy | 22 +++++++++++-----------
 1 file changed, 11 insertions(+), 11 deletions(-)

(limited to 'Equal.thy')

diff --git a/Equal.thy b/Equal.thy
index 772072a..7254104 100644
--- a/Equal.thy
+++ b/Equal.thy
@@ -27,33 +27,33 @@ translations
 section \<open>Type rules\<close>
 
 axiomatization where
-  Equal_form: "\<lbrakk>A: U(i); a: A; b: A\<rbrakk> \<Longrightarrow> a =\<^sub>A b : U(i)"
+  Equal_form: "\<lbrakk>A: U i; a: A; b: A\<rbrakk> \<Longrightarrow> a =\<^sub>A b : U i"
 and
-  Equal_intro: "a : A \<Longrightarrow> refl(a): a =\<^sub>A a"
+  Equal_intro: "a : A \<Longrightarrow> (refl a): a =\<^sub>A a"
 and
   Equal_elim: "\<lbrakk>
     x: A;
     y: A;
     p: x =\<^sub>A y;
-    \<And>x. x: A \<Longrightarrow> f(x) : C(x)(x)(refl x);
-    \<And>x y. \<lbrakk>x: A; y: A\<rbrakk> \<Longrightarrow> C(x)(y): x =\<^sub>A y \<longrightarrow> U(i)
-    \<rbrakk> \<Longrightarrow> ind\<^sub>=(f)(p) : C(x)(y)(p)"
+    \<And>x. x: A \<Longrightarrow> f x: C x x (refl x);
+    \<And>x y. \<lbrakk>x: A; y: A\<rbrakk> \<Longrightarrow> C x y: x =\<^sub>A y \<longrightarrow> U i
+    \<rbrakk> \<Longrightarrow> ind\<^sub>= f p : C x y p"
 and
   Equal_comp: "\<lbrakk>
     a: A;
-    \<And>x. x: A \<Longrightarrow> f(x) : C(x)(x)(refl x);
-    \<And>x y. \<lbrakk>x: A; y: A\<rbrakk> \<Longrightarrow> C(x)(y): x =\<^sub>A y \<longrightarrow> U(i)
-    \<rbrakk> \<Longrightarrow> ind\<^sub>=(f)(refl(a)) \<equiv> f(a)"
+    \<And>x. x: A \<Longrightarrow> f x: C x x (refl x);
+    \<And>x y. \<lbrakk>x: A; y: A\<rbrakk> \<Longrightarrow> C x y: x =\<^sub>A y \<longrightarrow> U i
+    \<rbrakk> \<Longrightarrow> ind\<^sub>= f (refl a) \<equiv> f a"
 
 
 text "Admissible inference rules for equality type formation:"
 
 axiomatization where
-  Equal_wellform1: "a =\<^sub>A b: U(i) \<Longrightarrow> A: U(i)"
+  Equal_wellform1: "a =\<^sub>A b: U i \<Longrightarrow> A: U i"
 and
-  Equal_wellform2: "a =\<^sub>A b: U(i) \<Longrightarrow> a: A"
+  Equal_wellform2: "a =\<^sub>A b: U i \<Longrightarrow> a: A"
 and
-  Equal_wellform3: "a =\<^sub>A b: U(i) \<Longrightarrow> b: A"
+  Equal_wellform3: "a =\<^sub>A b: U i \<Longrightarrow> b: A"
 
 
 text "Rule attribute declarations:"
-- 
cgit v1.2.3