Exact of Cic.term
| Step of Subst.substitution * (rule * int * (Utils.pos * int) * Cic.term)
-and goal_proof = (Utils.pos * int * Subst.substitution * Cic.term) list
+and goal_proof = (rule * Utils.pos * int * Subst.substitution * Cic.term) list
-val pp_proof: (Cic.name option) list -> goal_proof -> proof -> string
+val pp_proof:
+ (Cic.name option) list -> goal_proof -> proof -> Subst.substitution -> int ->
+ Cic.term -> string
val reset : unit -> unit
val is_weak_identity: equality -> bool
val is_identity: Utils.environment -> equality -> bool
+
+(* symmetric [eq_ty] [l] [id] [uri] [m]
+ *
+ * given an equality (_,p,(_,[l],r,_),[m],[id]) of 'type' l=r
+ * returns the proof of the symmetric (r=l).
+ *
+ * [uri] is the uri of eq
+ * [eq_ty] the ty of the equality sides
+ *)
+val symmetric:
+ Cic.term -> Cic.term -> int -> UriManager.uri ->
+ Cic.metasenv -> proof
+