From 4fd7d22b0efb69bc13c43dae4e4c1bd6d392f37d Mon Sep 17 00:00:00 2001 From: stuebinm Date: Wed, 29 Jun 2022 01:28:53 +0200 Subject: (broken) update hott for Isabelle 2021-1 this just replaces all instance of `this` with instances of `infer`. Unfortunately, it looks likes something else also broke, and I have no idea what it is (but the proof for equiv_if_equal fails). Sadly this means we can't get to univalence for now … (but rn I'm too tired to try anything else with it) --- hott/Identity.thy | 23 ++++++++++++----------- 1 file changed, 12 insertions(+), 11 deletions(-) (limited to 'hott/Identity.thy') diff --git a/hott/Identity.thy b/hott/Identity.thy index ce0e0ec..6c044b4 100644 --- a/hott/Identity.thy +++ b/hott/Identity.thy @@ -203,6 +203,7 @@ Lemma (def) ap: shows "f x = f y" by (eq p) intro + definition ap_i ("_[_]" [1000, 0]) where [implicit]: "ap_i f p \ ap {} {} {} {} f p" @@ -304,7 +305,7 @@ Lemma (def) pathcomp_cancel_left: by (rewr eq: pathcomp_assoc, rewr eq: inv_pathcomp, rewr eq: refl_pathcomp) refl - finally show "?" by this + finally show "?" by infer qed Lemma (def) pathcomp_cancel_right: @@ -323,7 +324,7 @@ Lemma (def) pathcomp_cancel_right: rewr eq: pathcomp_assoc[symmetric], rewr eq: pathcomp_inv, rewr eq: pathcomp_refl) refl - finally show "?" by this + finally show "?" by infer qed method pathcomp_cancell = rule pathcomp_cancel_left[rotated 7] @@ -488,7 +489,7 @@ Lemma (def) right_whisker: have "s \ refl x = s" by (rule pathcomp_refl) also have ".. = t" by fact also have ".. = t \ refl x" by (rule pathcomp_refl[symmetric]) - finally show "?" by this + finally show "?" by infer qed done @@ -502,7 +503,7 @@ Lemma (def) left_whisker: have "refl x \ s = s" by (rule refl_pathcomp) also have ".. = t" by fact also have ".. = refl x \ t" by (rule refl_pathcomp[symmetric]) - finally show "?" by this + finally show "?" by infer qed done @@ -608,17 +609,17 @@ Lemma (def) pathcomp_eq_horiz_pathcomp: have "refl (refl a) \ \ \ refl (refl a) = refl (refl a) \ \" by (rule pathcomp_refl) also have ".. = \" by (rule refl_pathcomp) - finally have eq\: "? = \" by this + finally have eq\: "? = \" by infer have "refl (refl a) \ \ \ refl (refl a) = refl (refl a) \ \" by (rule pathcomp_refl) also have ".. = \" by (rule refl_pathcomp) - finally have eq\: "? = \" by this + finally have eq\: "? = \" by infer have "refl (refl a) \ \ \ refl (refl a) \ (refl (refl a) \ \ \ refl (refl a)) = \ \ ?" by right_whisker (fact eq\) also have ".. = \ \ \" by left_whisker (fact eq\) - finally show "? = \ \ \" by this + finally show "? = \ \ \" by infer qed Lemma (def) pathcomp_eq_horiz_pathcomp': @@ -630,17 +631,17 @@ Lemma (def) pathcomp_eq_horiz_pathcomp': have "refl (refl a) \ \ \ refl (refl a) = refl (refl a) \ \" by (rule pathcomp_refl) also have ".. = \" by (rule refl_pathcomp) - finally have eq\: "? = \" by this + finally have eq\: "? = \" by infer have "refl (refl a) \ \ \ refl (refl a) = refl (refl a) \ \" by (rule pathcomp_refl) also have ".. = \" by (rule refl_pathcomp) - finally have eq\: "? = \" by this + finally have eq\: "? = \" by infer have "refl (refl a) \ \ \ refl (refl a) \ (refl (refl a) \ \ \ refl (refl a)) = \ \ ?" by right_whisker (fact eq\) also have ".. = \ \ \" by left_whisker (fact eq\) - finally show "? = \ \ \" by this + finally show "? = \ \ \" by infer qed Lemma (def) eckmann_hilton: @@ -657,7 +658,7 @@ Lemma (def) eckmann_hilton: also have ".. = \ \ \" by (rule pathcomp_eq_horiz_pathcomp') finally show "\ \ \ = \ \ \" - by this + by infer qed end -- cgit v1.2.3