diff --git a/2017-12-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_exercises.v b/2017-12-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_exercises.v
index 08e1b5d..9466afa 100644
--- a/2017-12-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_exercises.v
+++ b/2017-12-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_exercises.v
@@ -237,9 +237,9 @@ Definition iseqrelconstr {X : UU} {R : hrel X}
 
 Definition eqrel (X : UU) : UU
   := ∑ R : hrel X, iseqrel R.
-Definition eqrelpair {X : UU} (R : hrel X) (is : iseqrel R)
+Definition eqrelpair {X : UU} (R : hrel X) (ise : iseqrel R)
   : eqrel X
-  := tpair (λ R : hrel X, iseqrel R) R is.
+  := tpair (λ R : hrel X, iseqrel R) R ise.
 Definition eqrelconstr {X : UU} (R : hrel X)
            (is1 : istrans R) (is2 : isrefl R) (is3 : issymm R) : eqrel X
   := eqrelpair R (make_dirprod (make_dirprod is1 is2) is3).
@@ -270,7 +270,7 @@ Admitted.
 (** ** A subtype with paths between any two elements is an [hProp]. *)
 
 Lemma isapropsubtype {X : UU} (A : hsubtype X)
-      (is : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
+      (hyp : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
   : isaprop (carrier A).
 Proof.
   apply invproofirrelevance.
@@ -285,7 +285,7 @@ Proof.
   induction x as [ x0 is0 ].
   induction x' as [ x0' is0' ].
   simpl.
-  apply (is x0 x0' is0 is0').
+  apply (hyp x0 x0' is0 is0').
 Defined.
 
 
@@ -308,14 +308,13 @@ Definition iseqclassconstr {X : UU} (R : hrel X) {A : hsubtype X}
 
 Definition eqax0 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ishinh (carrier A)
-  := λ is : iseqclass R A, pr1 is.
+  := λ ise : iseqclass R A, pr1 ise.
 Definition eqax1 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, R x1 x2 -> A x1 -> A x2
-  := λ is : iseqclass R A, pr1 (pr2 is).
+  := λ ise : iseqclass R A, pr1 (pr2 ise).
 Definition eqax2 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, A x1 -> A x2 -> R x1 x2
-  := λ is : iseqclass R A, pr2 (pr2 is).
-
+  := λ ise : iseqclass R A, pr2 (pr2 ise).
 
 Lemma isapropiseqclass {X : UU} (R : hrel X) (A : hsubtype X)
   : isaprop (iseqclass R A).
@@ -332,9 +331,9 @@ Definition setquot {X : UU} (R : hrel X) : UU
   := ∑ A : hsubtype X, iseqclass R A.
 
 Definition setquotpair {X : UU} (R : hrel X) (A : hsubtype X)
-           (is : iseqclass R A)
+           (ise : iseqclass R A)
   : setquot R
-  := A ,, is.
+  := A ,, ise.
 
 Definition pr1setquot {X : UU} (R : hrel X)
   : setquot R -> hsubtype X
@@ -426,7 +425,7 @@ Definition iscomprelfun {X Y : UU} (R : hrel X) (f : X -> Y) : UU
   := ∏ x x' : X, R x x' -> f x = f x'.
 
 Lemma isapropimeqclass {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-      (is : iscomprelfun R f) (c : setquot R) :
+      (isc : iscomprelfun R f) (c : setquot R) :
   isaprop (image (λ x : c, f (pr1 x))).
 Proof.
   apply isapropsubtype.
@@ -438,16 +437,16 @@ Proof.
   destruct x1 as [ x1 is1' ]. destruct x2 as [ x2 is2' ].
   simpl in is1. simpl in is2. simpl in is1'. simpl in is2'.
   assert (r : R x1 x2) by apply (eqax2 iseq _ _ is1' is2').
-  apply ( !is1 @  (is _ _ r) @ is2).
+  apply ( !is1 @  (isc _ _ r) @ is2).
 Defined.
 
 Definition setquotuniv {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) (c : setquot R) : Y.
+        (isc : iscomprelfun R f) (c : setquot R) : Y.
 Proof.
   apply (pr1image (λ x : c, f (pr1 x))).
   apply (@squash_to_prop (carrier c)).
   - apply (eqax0 (pr2 c)).
-  - apply isapropimeqclass. apply is.
+  - apply isapropimeqclass. apply isc.
   - unfold carrier. apply prtoimage.
 Defined.
 
@@ -460,8 +459,8 @@ Defined.
 
 
 Theorem setquotunivcomm {X : UU} (R : eqrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) :
-  ∏ x : X, setquotuniv R Y f is (setquotpr R x) = f x.
+        (isc : iscomprelfun R f) :
+  ∏ x : X, setquotuniv R Y f isc (setquotpr R x) = f x.
 Proof.
   intros.
 Admitted.
diff --git a/2017-12-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_solutions.v b/2017-12-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_solutions.v
index 165342f..1275789 100644
--- a/2017-12-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_solutions.v
+++ b/2017-12-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_solutions.v
@@ -256,9 +256,9 @@ Definition iseqrelconstr {X : UU} {R : hrel X}
 
 Definition eqrel (X : UU) : UU
   := ∑ R : hrel X, iseqrel R.
-Definition eqrelpair {X : UU} (R : hrel X) (is : iseqrel R)
+Definition eqrelpair {X : UU} (R : hrel X) (ise : iseqrel R)
   : eqrel X
-  := tpair (λ R : hrel X, iseqrel R) R is.
+  := tpair (λ R : hrel X, iseqrel R) R ise.
 Definition eqrelconstr {X : UU} (R : hrel X)
            (is1 : istrans R) (is2 : isrefl R) (is3 : issymm R) : eqrel X
   := eqrelpair R (make_dirprod (make_dirprod is1 is2) is3).
@@ -289,7 +289,7 @@ Defined.
 (** ** A subtype with paths between any two elements is an [hProp]. *)
 
 Lemma isapropsubtype {X : UU} (A : hsubtype X)
-      (is : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
+      (hyp : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
   : isaprop (carrier A).
 Proof.
   apply invproofirrelevance.
@@ -304,7 +304,7 @@ Proof.
   induction x as [ x0 is0 ].
   induction x' as [ x0' is0' ].
   simpl.
-  apply (is x0 x0' is0 is0').
+  apply (hyp x0 x0' is0 is0').
 Defined.
 
 
@@ -327,14 +327,13 @@ Definition iseqclassconstr {X : UU} (R : hrel X) {A : hsubtype X}
 
 Definition eqax0 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ishinh (carrier A)
-  := λ is : iseqclass R A, pr1 is.
+  := λ ise : iseqclass R A, pr1 ise.
 Definition eqax1 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, R x1 x2 -> A x1 -> A x2
-  := λ is : iseqclass R A, pr1 (pr2 is).
+  := λ ise : iseqclass R A, pr1 (pr2 ise).
 Definition eqax2 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, A x1 -> A x2 -> R x1 x2
-  := λ is : iseqclass R A, pr2 (pr2 is).
-
+  := λ ise : iseqclass R A, pr2 (pr2 ise).
 
 Lemma isapropiseqclass {X : UU} (R : hrel X) (A : hsubtype X)
   : isaprop (iseqclass R A).
@@ -368,9 +367,9 @@ Definition setquot {X : UU} (R : hrel X) : UU
   := ∑ A : hsubtype X, iseqclass R A.
 
 Definition setquotpair {X : UU} (R : hrel X) (A : hsubtype X)
-           (is : iseqclass R A)
+           (ise : iseqclass R A)
   : setquot R
-  := A ,, is.
+  := A ,, ise.
 
 Definition pr1setquot {X : UU} (R : hrel X)
   : setquot R -> hsubtype X
@@ -456,7 +455,7 @@ Definition iscomprelfun {X Y : UU} (R : hrel X) (f : X -> Y) : UU
   := ∏ x x' : X, R x x' -> f x = f x'.
 
 Lemma isapropimeqclass {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-      (is : iscomprelfun R f) (c : setquot R) :
+      (isc : iscomprelfun R f) (c : setquot R) :
   isaprop (image (λ x : c, f (pr1 x))).
 Proof.
   apply isapropsubtype.
@@ -468,24 +467,24 @@ Proof.
   destruct x1 as [ x1 is1' ]. destruct x2 as [ x2 is2' ].
   simpl in is1. simpl in is2. simpl in is1'. simpl in is2'.
   assert (r : R x1 x2) by apply (eqax2 iseq _ _ is1' is2').
-  apply ( !is1 @  (is _ _ r) @ is2).
+  apply ( !is1 @  (isc _ _ r) @ is2).
 Defined.
 
 Definition setquotuniv {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) (c : setquot R) : Y.
+        (isc : iscomprelfun R f) (c : setquot R) : Y.
 Proof.
   apply (pr1image (λ x : c, f (pr1 x))).
   apply (@squash_to_prop (carrier c)).
   - apply (eqax0 (pr2 c)).
-  - apply isapropimeqclass. apply is.
+  - apply isapropimeqclass. apply isc.
   - unfold carrier. apply prtoimage.
 Defined.
 
 
 
 Theorem setquotunivcomm {X : UU} (R : eqrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) :
-  ∏ x : X, setquotuniv R Y f is (setquotpr R x) = f x.
+        (isc : iscomprelfun R f) :
+  ∏ x : X, setquotuniv R Y f isc (setquotpr R x) = f x.
 Proof.
   intros. apply idpath.
 Defined.
diff --git a/2019-04-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_exercises.v b/2019-04-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_exercises.v
index e2182e3..72050f4 100644
--- a/2019-04-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_exercises.v
+++ b/2019-04-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_exercises.v
@@ -192,9 +192,9 @@ Definition iseqrelconstr {X : UU} {R : hrel X}
 
 Definition eqrel (X : UU) : UU
   := ∑ R : hrel X, iseqrel R.
-Definition eqrelpair {X : UU} (R : hrel X) (is : iseqrel R)
+Definition eqrelpair {X : UU} (R : hrel X) (ise : iseqrel R)
   : eqrel X
-  := tpair (λ R : hrel X, iseqrel R) R is.
+  := tpair (λ R : hrel X, iseqrel R) R ise.
 Definition eqrelconstr {X : UU} (R : hrel X)
            (is1 : istrans R) (is2 : isrefl R) (is3 : issymm R) : eqrel X
   := eqrelpair R (make_dirprod (make_dirprod is1 is2) is3).
@@ -224,7 +224,7 @@ Defined.
 (** ** A subtype with paths between any two elements is an [hProp]. *)
 
 Lemma isapropsubtype {X : UU} (A : hsubtype X)
-      (is : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
+      (hyp : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
   : isaprop (carrier A).
 Proof.
   apply invproofirrelevance.
@@ -239,7 +239,7 @@ Proof.
   induction x as [ x0 is0 ].
   induction x' as [ x0' is0' ].
   simpl.
-  apply (is x0 x0' is0 is0').
+  apply (hyp x0 x0' is0 is0').
 Defined.
 
 (** ** Equivalence classes with respect to a given relation *)
@@ -261,13 +261,13 @@ Definition iseqclassconstr {X : UU} (R : hrel X) {A : hsubtype X}
 
 Definition eqax0 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ishinh (carrier A)
-  := λ is : iseqclass R A, pr1 is.
+  := λ ise : iseqclass R A, pr1 ise.
 Definition eqax1 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, R x1 x2 -> A x1 -> A x2
-  := λ is : iseqclass R A, pr1 (pr2 is).
+  := λ ise : iseqclass R A, pr1 (pr2 ise).
 Definition eqax2 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, A x1 -> A x2 -> R x1 x2
-  := λ is : iseqclass R A, pr2 (pr2 is).
+  := λ ise : iseqclass R A, pr2 (pr2 ise).
 
 Lemma isapropiseqclass {X : UU} (R : hrel X) (A : hsubtype X)
   : isaprop (iseqclass R A).
@@ -283,9 +283,9 @@ Definition setquot {X : UU} (R : hrel X) : UU
   := ∑ A : hsubtype X, iseqclass R A.
 
 Definition setquotpair {X : UU} (R : hrel X) (A : hsubtype X)
-           (is : iseqclass R A)
+           (ise : iseqclass R A)
   : setquot R
-  := A ,, is.
+  := A ,, ise.
 
 Definition pr1setquot {X : UU} (R : hrel X)
   : setquot R -> hsubtype X
@@ -365,7 +365,7 @@ Definition iscomprelfun {X Y : UU} (R : hrel X) (f : X -> Y) : UU
   := ∏ x x' : X, R x x' -> f x = f x'.
 
 Lemma isapropimeqclass {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-      (is : iscomprelfun R f) (c : setquot R) :
+      (isc : iscomprelfun R f) (c : setquot R) :
   isaprop (image (λ x : c, f (pr1 x))).
 Proof.
   apply isapropsubtype.
@@ -377,16 +377,16 @@ Proof.
   destruct x1 as [ x1 is1' ]. destruct x2 as [ x2 is2' ].
   simpl in is1. simpl in is2. simpl in is1'. simpl in is2'.
   assert (r : R x1 x2) by apply (eqax2 iseq _ _ is1' is2').
-  apply ( !is1 @  (is _ _ r) @ is2).
+  apply ( !is1 @  (isc _ _ r) @ is2).
 Defined.
 
 Definition setquotuniv {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) (c : setquot R) : Y.
+        (isc : iscomprelfun R f) (c : setquot R) : Y.
 Proof.
   apply (pr1image (λ x : c, f (pr1 x))).
   apply (@squash_to_prop (carrier c)).
   - apply (eqax0 (pr2 c)).
-  - apply isapropimeqclass. apply is.
+  - apply isapropimeqclass. apply isc.
   - unfold carrier. apply prtoimage.
 Defined.
 
@@ -397,8 +397,8 @@ Defined.
   can be empty. Nevertheless setquotuniv will apply. *)
 
 Theorem setquotunivcomm {X : UU} (R : eqrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) :
-  ∏ x : X, setquotuniv R Y f is (setquotpr R x) = f x.
+        (isc : iscomprelfun R f) :
+  ∏ x : X, setquotuniv R Y f isc (setquotpr R x) = f x.
 Proof.
   intros.
   apply idpath.
diff --git a/2019-04-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_solutions.v b/2019-04-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_solutions.v
index 2f82ac2..58aee38 100644
--- a/2019-04-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_solutions.v
+++ b/2019-04-Birmingham/Part5_Set_Level_Mathematics/set_level_mathematics_solutions.v
@@ -219,9 +219,9 @@ Definition iseqrelconstr {X : UU} {R : hrel X}
 
 Definition eqrel (X : UU) : UU
   := ∑ R : hrel X, iseqrel R.
-Definition eqrelpair {X : UU} (R : hrel X) (is : iseqrel R)
+Definition eqrelpair {X : UU} (R : hrel X) (ise : iseqrel R)
   : eqrel X
-  := tpair (λ R : hrel X, iseqrel R) R is.
+  := tpair (λ R : hrel X, iseqrel R) R ise.
 Definition eqrelconstr {X : UU} (R : hrel X)
            (is1 : istrans R) (is2 : isrefl R) (is3 : issymm R) : eqrel X
   := eqrelpair R (make_dirprod (make_dirprod is1 is2) is3).
@@ -253,7 +253,7 @@ Defined.
 (** ** A subtype with paths between any two elements is an [hProp]. *)
 
 Lemma isapropsubtype {X : UU} (A : hsubtype X)
-      (is : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
+      (hyp : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
   : isaprop (carrier A).
 Proof.
   apply invproofirrelevance.
@@ -268,7 +268,7 @@ Proof.
   induction x as [ x0 is0 ].
   induction x' as [ x0' is0' ].
   simpl.
-  apply (is x0 x0' is0 is0').
+  apply (hyp x0 x0' is0 is0').
 Defined.
 
 (** ** Equivalence classes with respect to a given relation *)
@@ -290,13 +290,13 @@ Definition iseqclassconstr {X : UU} (R : hrel X) {A : hsubtype X}
 
 Definition eqax0 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ishinh (carrier A)
-  := λ is : iseqclass R A, pr1 is.
+  := λ ise : iseqclass R A, pr1 ise.
 Definition eqax1 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, R x1 x2 -> A x1 -> A x2
-  := λ is : iseqclass R A, pr1 (pr2 is).
+  := λ ise : iseqclass R A, pr1 (pr2 ise).
 Definition eqax2 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, A x1 -> A x2 -> R x1 x2
-  := λ is : iseqclass R A, pr2 (pr2 is).
+  := λ ise : iseqclass R A, pr2 (pr2 ise).
 
 Lemma isapropiseqclass {X : UU} (R : hrel X) (A : hsubtype X)
   : isaprop (iseqclass R A).
@@ -323,9 +323,9 @@ Definition setquot {X : UU} (R : hrel X) : UU
   := ∑ A : hsubtype X, iseqclass R A.
 
 Definition setquotpair {X : UU} (R : hrel X) (A : hsubtype X)
-           (is : iseqclass R A)
+           (ise : iseqclass R A)
   : setquot R
-  := A ,, is.
+  := A ,, ise.
 
 Definition pr1setquot {X : UU} (R : hrel X)
   : setquot R -> hsubtype X
@@ -405,7 +405,7 @@ Definition iscomprelfun {X Y : UU} (R : hrel X) (f : X -> Y) : UU
   := ∏ x x' : X, R x x' -> f x = f x'.
 
 Lemma isapropimeqclass {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-      (is : iscomprelfun R f) (c : setquot R) :
+      (isc : iscomprelfun R f) (c : setquot R) :
   isaprop (image (λ x : c, f (pr1 x))).
 Proof.
   apply isapropsubtype.
@@ -417,16 +417,16 @@ Proof.
   destruct x1 as [ x1 is1' ]. destruct x2 as [ x2 is2' ].
   simpl in is1. simpl in is2. simpl in is1'. simpl in is2'.
   assert (r : R x1 x2) by apply (eqax2 iseq _ _ is1' is2').
-  apply ( !is1 @  (is _ _ r) @ is2).
+  apply ( !is1 @  (isc _ _ r) @ is2).
 Defined.
 
 Definition setquotuniv {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) (c : setquot R) : Y.
+        (isc : iscomprelfun R f) (c : setquot R) : Y.
 Proof.
   apply (pr1image (λ x : c, f (pr1 x))).
   apply (@squash_to_prop (carrier c)).
   - apply (eqax0 (pr2 c)).
-  - apply isapropimeqclass. apply is.
+  - apply isapropimeqclass. apply isc.
   - unfold carrier. apply prtoimage.
 Defined.
 
@@ -437,8 +437,8 @@ Defined.
   can be empty. Nevertheless setquotuniv will apply. *)
 
 Theorem setquotunivcomm {X : UU} (R : eqrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) :
-  ∏ x : X, setquotuniv R Y f is (setquotpr R x) = f x.
+        (isc : iscomprelfun R f) :
+  ∏ x : X, setquotuniv R Y f isc (setquotpr R x) = f x.
 Proof.
   intros. apply idpath.
 Defined.
diff --git a/2022-07-Cortona/5_Set-level-mathematics/set_level_mathematics_exercises.v b/2022-07-Cortona/5_Set-level-mathematics/set_level_mathematics_exercises.v
index e2182e3..72050f4 100644
--- a/2022-07-Cortona/5_Set-level-mathematics/set_level_mathematics_exercises.v
+++ b/2022-07-Cortona/5_Set-level-mathematics/set_level_mathematics_exercises.v
@@ -192,9 +192,9 @@ Definition iseqrelconstr {X : UU} {R : hrel X}
 
 Definition eqrel (X : UU) : UU
   := ∑ R : hrel X, iseqrel R.
-Definition eqrelpair {X : UU} (R : hrel X) (is : iseqrel R)
+Definition eqrelpair {X : UU} (R : hrel X) (ise : iseqrel R)
   : eqrel X
-  := tpair (λ R : hrel X, iseqrel R) R is.
+  := tpair (λ R : hrel X, iseqrel R) R ise.
 Definition eqrelconstr {X : UU} (R : hrel X)
            (is1 : istrans R) (is2 : isrefl R) (is3 : issymm R) : eqrel X
   := eqrelpair R (make_dirprod (make_dirprod is1 is2) is3).
@@ -224,7 +224,7 @@ Defined.
 (** ** A subtype with paths between any two elements is an [hProp]. *)
 
 Lemma isapropsubtype {X : UU} (A : hsubtype X)
-      (is : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
+      (hyp : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
   : isaprop (carrier A).
 Proof.
   apply invproofirrelevance.
@@ -239,7 +239,7 @@ Proof.
   induction x as [ x0 is0 ].
   induction x' as [ x0' is0' ].
   simpl.
-  apply (is x0 x0' is0 is0').
+  apply (hyp x0 x0' is0 is0').
 Defined.
 
 (** ** Equivalence classes with respect to a given relation *)
@@ -261,13 +261,13 @@ Definition iseqclassconstr {X : UU} (R : hrel X) {A : hsubtype X}
 
 Definition eqax0 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ishinh (carrier A)
-  := λ is : iseqclass R A, pr1 is.
+  := λ ise : iseqclass R A, pr1 ise.
 Definition eqax1 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, R x1 x2 -> A x1 -> A x2
-  := λ is : iseqclass R A, pr1 (pr2 is).
+  := λ ise : iseqclass R A, pr1 (pr2 ise).
 Definition eqax2 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, A x1 -> A x2 -> R x1 x2
-  := λ is : iseqclass R A, pr2 (pr2 is).
+  := λ ise : iseqclass R A, pr2 (pr2 ise).
 
 Lemma isapropiseqclass {X : UU} (R : hrel X) (A : hsubtype X)
   : isaprop (iseqclass R A).
@@ -283,9 +283,9 @@ Definition setquot {X : UU} (R : hrel X) : UU
   := ∑ A : hsubtype X, iseqclass R A.
 
 Definition setquotpair {X : UU} (R : hrel X) (A : hsubtype X)
-           (is : iseqclass R A)
+           (ise : iseqclass R A)
   : setquot R
-  := A ,, is.
+  := A ,, ise.
 
 Definition pr1setquot {X : UU} (R : hrel X)
   : setquot R -> hsubtype X
@@ -365,7 +365,7 @@ Definition iscomprelfun {X Y : UU} (R : hrel X) (f : X -> Y) : UU
   := ∏ x x' : X, R x x' -> f x = f x'.
 
 Lemma isapropimeqclass {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-      (is : iscomprelfun R f) (c : setquot R) :
+      (isc : iscomprelfun R f) (c : setquot R) :
   isaprop (image (λ x : c, f (pr1 x))).
 Proof.
   apply isapropsubtype.
@@ -377,16 +377,16 @@ Proof.
   destruct x1 as [ x1 is1' ]. destruct x2 as [ x2 is2' ].
   simpl in is1. simpl in is2. simpl in is1'. simpl in is2'.
   assert (r : R x1 x2) by apply (eqax2 iseq _ _ is1' is2').
-  apply ( !is1 @  (is _ _ r) @ is2).
+  apply ( !is1 @  (isc _ _ r) @ is2).
 Defined.
 
 Definition setquotuniv {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) (c : setquot R) : Y.
+        (isc : iscomprelfun R f) (c : setquot R) : Y.
 Proof.
   apply (pr1image (λ x : c, f (pr1 x))).
   apply (@squash_to_prop (carrier c)).
   - apply (eqax0 (pr2 c)).
-  - apply isapropimeqclass. apply is.
+  - apply isapropimeqclass. apply isc.
   - unfold carrier. apply prtoimage.
 Defined.
 
@@ -397,8 +397,8 @@ Defined.
   can be empty. Nevertheless setquotuniv will apply. *)
 
 Theorem setquotunivcomm {X : UU} (R : eqrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) :
-  ∏ x : X, setquotuniv R Y f is (setquotpr R x) = f x.
+        (isc : iscomprelfun R f) :
+  ∏ x : X, setquotuniv R Y f isc (setquotpr R x) = f x.
 Proof.
   intros.
   apply idpath.
diff --git a/2022-07-Cortona/5_Set-level-mathematics/set_level_mathematics_solutions.v b/2022-07-Cortona/5_Set-level-mathematics/set_level_mathematics_solutions.v
index 2f82ac2..58aee38 100644
--- a/2022-07-Cortona/5_Set-level-mathematics/set_level_mathematics_solutions.v
+++ b/2022-07-Cortona/5_Set-level-mathematics/set_level_mathematics_solutions.v
@@ -219,9 +219,9 @@ Definition iseqrelconstr {X : UU} {R : hrel X}
 
 Definition eqrel (X : UU) : UU
   := ∑ R : hrel X, iseqrel R.
-Definition eqrelpair {X : UU} (R : hrel X) (is : iseqrel R)
+Definition eqrelpair {X : UU} (R : hrel X) (ise : iseqrel R)
   : eqrel X
-  := tpair (λ R : hrel X, iseqrel R) R is.
+  := tpair (λ R : hrel X, iseqrel R) R ise.
 Definition eqrelconstr {X : UU} (R : hrel X)
            (is1 : istrans R) (is2 : isrefl R) (is3 : issymm R) : eqrel X
   := eqrelpair R (make_dirprod (make_dirprod is1 is2) is3).
@@ -253,7 +253,7 @@ Defined.
 (** ** A subtype with paths between any two elements is an [hProp]. *)
 
 Lemma isapropsubtype {X : UU} (A : hsubtype X)
-      (is : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
+      (hyp : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
   : isaprop (carrier A).
 Proof.
   apply invproofirrelevance.
@@ -268,7 +268,7 @@ Proof.
   induction x as [ x0 is0 ].
   induction x' as [ x0' is0' ].
   simpl.
-  apply (is x0 x0' is0 is0').
+  apply (hyp x0 x0' is0 is0').
 Defined.
 
 (** ** Equivalence classes with respect to a given relation *)
@@ -290,13 +290,13 @@ Definition iseqclassconstr {X : UU} (R : hrel X) {A : hsubtype X}
 
 Definition eqax0 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ishinh (carrier A)
-  := λ is : iseqclass R A, pr1 is.
+  := λ ise : iseqclass R A, pr1 ise.
 Definition eqax1 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, R x1 x2 -> A x1 -> A x2
-  := λ is : iseqclass R A, pr1 (pr2 is).
+  := λ ise : iseqclass R A, pr1 (pr2 ise).
 Definition eqax2 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, A x1 -> A x2 -> R x1 x2
-  := λ is : iseqclass R A, pr2 (pr2 is).
+  := λ ise : iseqclass R A, pr2 (pr2 ise).
 
 Lemma isapropiseqclass {X : UU} (R : hrel X) (A : hsubtype X)
   : isaprop (iseqclass R A).
@@ -323,9 +323,9 @@ Definition setquot {X : UU} (R : hrel X) : UU
   := ∑ A : hsubtype X, iseqclass R A.
 
 Definition setquotpair {X : UU} (R : hrel X) (A : hsubtype X)
-           (is : iseqclass R A)
+           (ise : iseqclass R A)
   : setquot R
-  := A ,, is.
+  := A ,, ise.
 
 Definition pr1setquot {X : UU} (R : hrel X)
   : setquot R -> hsubtype X
@@ -405,7 +405,7 @@ Definition iscomprelfun {X Y : UU} (R : hrel X) (f : X -> Y) : UU
   := ∏ x x' : X, R x x' -> f x = f x'.
 
 Lemma isapropimeqclass {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-      (is : iscomprelfun R f) (c : setquot R) :
+      (isc : iscomprelfun R f) (c : setquot R) :
   isaprop (image (λ x : c, f (pr1 x))).
 Proof.
   apply isapropsubtype.
@@ -417,16 +417,16 @@ Proof.
   destruct x1 as [ x1 is1' ]. destruct x2 as [ x2 is2' ].
   simpl in is1. simpl in is2. simpl in is1'. simpl in is2'.
   assert (r : R x1 x2) by apply (eqax2 iseq _ _ is1' is2').
-  apply ( !is1 @  (is _ _ r) @ is2).
+  apply ( !is1 @  (isc _ _ r) @ is2).
 Defined.
 
 Definition setquotuniv {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) (c : setquot R) : Y.
+        (isc : iscomprelfun R f) (c : setquot R) : Y.
 Proof.
   apply (pr1image (λ x : c, f (pr1 x))).
   apply (@squash_to_prop (carrier c)).
   - apply (eqax0 (pr2 c)).
-  - apply isapropimeqclass. apply is.
+  - apply isapropimeqclass. apply isc.
   - unfold carrier. apply prtoimage.
 Defined.
 
@@ -437,8 +437,8 @@ Defined.
   can be empty. Nevertheless setquotuniv will apply. *)
 
 Theorem setquotunivcomm {X : UU} (R : eqrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) :
-  ∏ x : X, setquotuniv R Y f is (setquotpr R x) = f x.
+        (isc : iscomprelfun R f) :
+  ∏ x : X, setquotuniv R Y f isc (setquotpr R x) = f x.
 Proof.
   intros. apply idpath.
 Defined.
diff --git a/2024-07-Minneapolis/5_Set-level-mathematics/set_level_mathematics_exercises.v b/2024-07-Minneapolis/5_Set-level-mathematics/set_level_mathematics_exercises.v
index 6bb77e5..f5bab7f 100644
--- a/2024-07-Minneapolis/5_Set-level-mathematics/set_level_mathematics_exercises.v
+++ b/2024-07-Minneapolis/5_Set-level-mathematics/set_level_mathematics_exercises.v
@@ -345,9 +345,9 @@ Definition iseqrelconstr {X : UU} {R : hrel X}
 
 Definition eqrel (X : UU) : UU
   := ∑ R : hrel X, iseqrel R.
-Definition eqrelpair {X : UU} (R : hrel X) (is : iseqrel R)
+Definition eqrelpair {X : UU} (R : hrel X) (ise : iseqrel R)
   : eqrel X
-  := tpair (λ R : hrel X, iseqrel R) R is.
+  := tpair (λ R : hrel X, iseqrel R) R ise.
 Definition eqrelconstr {X : UU} (R : hrel X)
            (is1 : istrans R) (is2 : isrefl R) (is3 : issymm R) : eqrel X
   := eqrelpair R (make_dirprod (make_dirprod is1 is2) is3).
@@ -377,7 +377,7 @@ Defined.
 (** ** A subtype with paths between any two elements is an [hProp]. *)
 
 Lemma isapropsubtype {X : UU} (A : hsubtype X)
-      (is : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
+      (hyp : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
   : isaprop (carrier A).
 Proof.
   apply invproofirrelevance.
@@ -392,7 +392,7 @@ Proof.
   induction x as [ x0 is0 ].
   induction x' as [ x0' is0' ].
   simpl.
-  apply (is x0 x0' is0 is0').
+  apply (hyp x0 x0' is0 is0').
 Defined.
 
 (** ** Equivalence classes with respect to a given relation *)
@@ -414,13 +414,13 @@ Definition iseqclassconstr {X : UU} (R : hrel X) {A : hsubtype X}
 
 Definition eqax0 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ishinh (carrier A)
-  := λ is : iseqclass R A, pr1 is.
+  := λ ise : iseqclass R A, pr1 ise.
 Definition eqax1 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, R x1 x2 -> A x1 -> A x2
-  := λ is : iseqclass R A, pr1 (pr2 is).
+  := λ ise : iseqclass R A, pr1 (pr2 ise).
 Definition eqax2 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, A x1 -> A x2 -> R x1 x2
-  := λ is : iseqclass R A, pr2 (pr2 is).
+  := λ ise : iseqclass R A, pr2 (pr2 ise).
 
 Lemma isapropiseqclass {X : UU} (R : hrel X) (A : hsubtype X)
   : isaprop (iseqclass R A).
@@ -436,9 +436,9 @@ Definition setquot {X : UU} (R : hrel X) : UU
   := ∑ A : hsubtype X, iseqclass R A.
 
 Definition setquotpair {X : UU} (R : hrel X) (A : hsubtype X)
-           (is : iseqclass R A)
+           (ise : iseqclass R A)
   : setquot R
-  := A ,, is.
+  := A ,, ise.
 
 Definition pr1setquot {X : UU} (R : hrel X)
   : setquot R -> hsubtype X
@@ -518,7 +518,7 @@ Definition iscomprelfun {X Y : UU} (R : hrel X) (f : X -> Y) : UU
   := ∏ x x' : X, R x x' -> f x = f x'.
 
 Lemma isapropimeqclass {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-      (is : iscomprelfun R f) (c : setquot R) :
+      (isc : iscomprelfun R f) (c : setquot R) :
   isaprop (image (λ x : c, f (pr1 x))).
 Proof.
   apply isapropsubtype.
@@ -530,16 +530,16 @@ Proof.
   destruct x1 as [ x1 is1' ]. destruct x2 as [ x2 is2' ].
   simpl in is1. simpl in is2. simpl in is1'. simpl in is2'.
   assert (r : R x1 x2) by apply (eqax2 iseq _ _ is1' is2').
-  apply ( !is1 @  (is _ _ r) @ is2).
+  apply ( !is1 @  (isc _ _ r) @ is2).
 Defined.
 
 Definition setquotuniv {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) (c : setquot R) : Y.
+        (isc : iscomprelfun R f) (c : setquot R) : Y.
 Proof.
   apply (pr1image (λ x : c, f (pr1 x))).
   apply (@squash_to_prop (carrier c)).
   - apply (eqax0 (pr2 c)).
-  - apply isapropimeqclass. apply is.
+  - apply isapropimeqclass. apply isc.
   - unfold carrier. apply prtoimage.
 Defined.
 
@@ -550,8 +550,8 @@ Defined.
   can be empty. Nevertheless setquotuniv will apply. *)
 
 Theorem setquotunivcomm {X : UU} (R : eqrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) :
-  ∏ x : X, setquotuniv R Y f is (setquotpr R x) = f x.
+        (isc : iscomprelfun R f) :
+  ∏ x : X, setquotuniv R Y f isc (setquotpr R x) = f x.
 Proof.
   intros.
   apply idpath.
diff --git a/2024-07-Minneapolis/5_Set-level-mathematics/set_level_mathematics_solutions.v b/2024-07-Minneapolis/5_Set-level-mathematics/set_level_mathematics_solutions.v
index 2963ce8..a50b473 100644
--- a/2024-07-Minneapolis/5_Set-level-mathematics/set_level_mathematics_solutions.v
+++ b/2024-07-Minneapolis/5_Set-level-mathematics/set_level_mathematics_solutions.v
@@ -351,9 +351,9 @@ Definition iseqrelconstr {X : UU} {R : hrel X}
 
 Definition eqrel (X : UU) : UU
   := ∑ R : hrel X, iseqrel R.
-Definition eqrelpair {X : UU} (R : hrel X) (is : iseqrel R)
+Definition eqrelpair {X : UU} (R : hrel X) (ise : iseqrel R)
   : eqrel X
-  := tpair (λ R : hrel X, iseqrel R) R is.
+  := tpair (λ R : hrel X, iseqrel R) R ise.
 Definition eqrelconstr {X : UU} (R : hrel X)
            (is1 : istrans R) (is2 : isrefl R) (is3 : issymm R) : eqrel X
   := eqrelpair R (make_dirprod (make_dirprod is1 is2) is3).
@@ -385,7 +385,7 @@ Defined.
 (** ** A subtype with paths between any two elements is an [hProp]. *)
 
 Lemma isapropsubtype {X : UU} (A : hsubtype X)
-      (is : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
+      (hyp : ∏ (x1 x2 : X), A x1 -> A x2 -> x1 = x2)
   : isaprop (carrier A).
 Proof.
   apply invproofirrelevance.
@@ -400,7 +400,7 @@ Proof.
   induction x as [ x0 is0 ].
   induction x' as [ x0' is0' ].
   simpl.
-  apply (is x0 x0' is0 is0').
+  apply (hyp x0 x0' is0 is0').
 Defined.
 
 (** ** Equivalence classes with respect to a given relation *)
@@ -422,13 +422,13 @@ Definition iseqclassconstr {X : UU} (R : hrel X) {A : hsubtype X}
 
 Definition eqax0 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ishinh (carrier A)
-  := λ is : iseqclass R A, pr1 is.
+  := λ ise : iseqclass R A, pr1 ise.
 Definition eqax1 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, R x1 x2 -> A x1 -> A x2
-  := λ is : iseqclass R A, pr1 (pr2 is).
+  := λ ise : iseqclass R A, pr1 (pr2 ise).
 Definition eqax2 {X : UU} {R : hrel X} {A : hsubtype X}
   : iseqclass R A -> ∏ x1 x2 : X, A x1 -> A x2 -> R x1 x2
-  := λ is : iseqclass R A, pr2 (pr2 is).
+  := λ ise : iseqclass R A, pr2 (pr2 ise).
 
 Lemma isapropiseqclass {X : UU} (R : hrel X) (A : hsubtype X)
   : isaprop (iseqclass R A).
@@ -455,9 +455,9 @@ Definition setquot {X : UU} (R : hrel X) : UU
   := ∑ A : hsubtype X, iseqclass R A.
 
 Definition setquotpair {X : UU} (R : hrel X) (A : hsubtype X)
-           (is : iseqclass R A)
+           (ise : iseqclass R A)
   : setquot R
-  := A ,, is.
+  := A ,, ise.
 
 Definition pr1setquot {X : UU} (R : hrel X)
   : setquot R -> hsubtype X
@@ -537,7 +537,7 @@ Definition iscomprelfun {X Y : UU} (R : hrel X) (f : X -> Y) : UU
   := ∏ x x' : X, R x x' -> f x = f x'.
 
 Lemma isapropimeqclass {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-      (is : iscomprelfun R f) (c : setquot R) :
+      (isc : iscomprelfun R f) (c : setquot R) :
   isaprop (image (λ x : c, f (pr1 x))).
 Proof.
   apply isapropsubtype.
@@ -549,16 +549,16 @@ Proof.
   destruct x1 as [ x1 is1' ]. destruct x2 as [ x2 is2' ].
   simpl in is1. simpl in is2. simpl in is1'. simpl in is2'.
   assert (r : R x1 x2) by apply (eqax2 iseq _ _ is1' is2').
-  apply ( !is1 @  (is _ _ r) @ is2).
+  apply ( !is1 @  (isc _ _ r) @ is2).
 Defined.
 
 Definition setquotuniv {X : UU} (R : hrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) (c : setquot R) : Y.
+        (isc : iscomprelfun R f) (c : setquot R) : Y.
 Proof.
   apply (pr1image (λ x : c, f (pr1 x))).
   apply (@squash_to_prop (carrier c)).
   - apply (eqax0 (pr2 c)).
-  - apply isapropimeqclass. apply is.
+  - apply isapropimeqclass. apply isc.
   - unfold carrier. apply prtoimage.
 Defined.
 
@@ -569,8 +569,8 @@ Defined.
   can be empty. Nevertheless setquotuniv will apply. *)
 
 Theorem setquotunivcomm {X : UU} (R : eqrel X) (Y : hSet) (f : X -> Y)
-        (is : iscomprelfun R f) :
-  ∏ x : X, setquotuniv R Y f is (setquotpr R x) = f x.
+        (isc : iscomprelfun R f) :
+  ∏ x : X, setquotuniv R Y f isc (setquotpr R x) = f x.
 Proof.
   intros. apply idpath.
 Defined.
diff --git a/dune-project b/dune-project
index e950e14..1763b75 100644
--- a/dune-project
+++ b/dune-project
@@ -1,3 +1,3 @@
-(lang dune 3.5)
-(using coq 0.6)
+(lang dune 3.8)
+(using coq 0.8)
 (name Schools)