 
 (defimplicit eq-refl
   "Equality is reflexive."
-  [def-env ctx [x x-ty] [y y-ty]]
-  (list #'eq-refl% x-ty x y))
+  [def-env ctx [x x-ty]]
+  (list #'eq-refl% x-ty x x))
 
 (defthm eq-sym%
   "The symmetry property of equality."

   [latte-kernel.syntax :as stx]
   [latte-kernel.norm :as norm]
   [latte-kernel.typing :as ty]
   [latte.core :as latte :refer [definition defthm defimplicit
                                          assume have qed proof]]
   [latte.prop :as p :refer [<=> and or not]]))

  (list #'equal% x-ty x y))

(defn decompose-equal-type [def-env ctx t]
  (decomposer
   (fn [t]
     (if (clojure.core/and (seq t)
                           (= (count t) 4)
                           (= (first t) #'latte.equal/equal%))
       [(second t) (nth t 2) (nth t 3)]
       ;; XXX: cannot decompose further because
       ;; we cannot retrieve the x and y of the
       ;; definition ... add dummy witnesses ?
       (throw (ex-info "Cannot infer an equal-type" {:type t}))))
   def-env ctx t))

(defthm eq-refl%
  "The reflexivity property of equality."
