diff --git a/examples/int_to_Zp.v b/examples/int_to_Zp.v
index 5006788..335fecc 100644
--- a/examples/int_to_Zp.v
+++ b/examples/int_to_Zp.v
@@ -50,6 +50,42 @@ Notation "x + y" := (addp x%Zmodp y%Zmodp) : Zmodp_scope.
 Notation "x * y" := (mul x%int y%int) : int_scope.
 Notation "x * y" := (mulp x%Zmodp y%Zmodp) : Zmodp_scope.
 
+Module IntToZmodp.
+
+Definition Rp := SplitSurj.toParam
+  (SplitSurj.Build_type modp reprp reprpK).
+
+Axiom Rzero' : Rp zero zerop.
+Variable Radd' : binop_param Rp Rp Rp add addp.
+Variable Rmul' : binop_param Rp Rp Rp mul mulp.
+
+Trocq Use Rmul'.
+Trocq Use Rzero'.
+Trocq Use Param10_paths.
+Trocq Use Rp.
+
+Definition eq_Zmodp (x y : Zmodp) := (x = y).
+(* Bug if we inline the previous def in the following axiom *)
+Axiom Reqmodp01 : forall (m : int) (x : Zmodp), Rp m x ->
+  forall n y, Rp n y -> Param01.Rel (eqmodp m n) (eq_Zmodp x y).
+Trocq Use Reqmodp01.
+Arguments eq_Zmodp /.
+
+Hypothesis RedZmodpEq0 :
+  (forall (m n p : Zmodp), (m = n * n)%Zmodp -> m = (p * p * p)%Zmodp ->
+    m = zerop).
+
+Lemma IntRedModZp : forall (m n p : int),
+  (m = n * n)%int -> m = (p * p * p)%int -> eqmodp m zero.
+Proof.
+trocq; simpl.
+exact @RedZmodpEq0.
+Qed.
+
+(* Print Assumptions IntRedModZp. (* No Univalence *) *)
+
+End IntToZmodp.
+
 Module ZmodpToInt.
 
 Definition Rp x n := eqmodp (reprp x) n.
@@ -66,12 +102,6 @@ unshelve econstructor.
   + by move=> a b; rewrite /Rp/sym_rel/eqmodp reprpK => <-.
 Defined.
 
-Definition Rp00 : Param00.Rel Zmodp int := Rp2a2b.
-Definition Rp01 : Param01.Rel Zmodp int := Rp2a2b.
-Definition Rp10 : Param10.Rel Zmodp int := Rp2a2b.
-Definition Rp02b : Param02b.Rel Zmodp int := Rp2a2b.
-Definition Rp2a0 : Param2a0.Rel Zmodp int := Rp2a2b.
-
 Axiom Rzero : Rp zerop zero.
 Variable Radd : binop_param Rp Rp Rp addp add.
 Variable paths_to_eqmodp : binop_param Rp Rp iff paths eqmodp.
@@ -98,40 +128,3 @@ Proof.
 Qed.
 
 End ZmodpToInt.
-
-Module IntToZmodp.
-
-Definition Rp n x := modp n = x.
-Definition Rp42a@{i} : Param42a.Rel int@{i} Zmodp@{i} :=
-  SplitSurj.toParam (SplitSurj.Build_type modp reprp reprpK).
-
-Axiom Rzero' : Rp zero zerop.
-Variable Radd' : binop_param Rp Rp Rp add addp.
-Variable Rmul' : binop_param Rp Rp Rp mul mulp.
-
-Trocq Use Rmul'.
-Trocq Use Rzero'.
-Trocq Use Param10_paths.
-Trocq Use Rp42a.
-
-Definition eq_Zmodp (x y : Zmodp) := (x = y).
-(* Bug if we inline the previous def in the following axiom *)
-Axiom Reqmodp01 : forall (m : int) (x : Zmodp), Rp m x ->
-  forall n y, Rp n y -> Param01.Rel (eqmodp m n) (eq_Zmodp x y).
-Trocq Use Reqmodp01.
-Arguments eq_Zmodp /.
-
-Hypothesis RedZmodpEq0 :
-  (forall (m n p : Zmodp), (m = n * n)%Zmodp -> m = (p * p * p)%Zmodp ->
-    m = zerop).
-
-Lemma IntRedModZp : forall (m n p : int),
-  (m = n * n)%int -> m = (p * p * p)%int -> eqmodp m zero.
-Proof.
-trocq; simpl.
-exact @RedZmodpEq0.
-Qed.
-
-(* Print Assumptions IntRedModZp. (* No Univalence *) *)
-
-End IntToZmodp.
diff --git a/examples/peano_bin_nat.v b/examples/peano_bin_nat.v
index b5a9ac9..90981e6 100644
--- a/examples/peano_bin_nat.v
+++ b/examples/peano_bin_nat.v
@@ -107,8 +107,6 @@ Definition Nmap (n : N) : nat :=
 Fixpoint Ncomap (n : nat) : N :=
   match n with O => 0 | S n => Nsucc (Ncomap n) end.
 
-Definition RN@{} := sym_rel@{Set} (graph@{Set} Ncomap).
-
 Lemma Naddpp p : (Npos p + Npos p)%N = Npos p~0.
 Proof. by elim: p => //= p IHp; rewrite Pos.addpp. Qed.
 
@@ -129,7 +127,7 @@ Proof. by case: n => //= ; elim=> //= p /NcomapNpos/= ->. Qed.
 
 (* the best we can do to link these types is (4,4), but
 we only need (2a,3) which is morally that Nmap is a split injection *)
-Definition RN2a3 : Param2a3.Rel@{Set} N nat := SplitSurj.toParamSym@{Set} {|
+Definition RN := SplitSurj.toParamSym@{Set} {|
    SplitSurj.retract := Ncomap;
    SplitSurj.section := Nmap;
    SplitSurj.sectionK := NmapK |}.
@@ -145,11 +143,11 @@ Definition RN2a3 : Param2a3.Rel@{Set} N nat := SplitSurj.toParamSym@{Set} {|
 (* NB: as these are not type formers, only class (0,0) is required, so these proofs amount to what
    would be done in the context of raw parametricity *)
 
-Definition RN0 : RN N0 0. Proof. done. Qed.
+Definition RN0 : RN N0 0%nat. Proof. done. Qed.
 Definition RNS : forall m n, RN m n -> RN (Nsucc m) (S n).
 Proof. by move=> _ + <-; case=> //=. Qed.
 
-Trocq Use RN2a3.
+Trocq Use RN.
 Trocq Use RN0.
 Trocq Use RNS.