aboutsummaryrefslogtreecommitdiff
path: root/tactics
diff options
context:
space:
mode:
authorPierre-Marie Pédrot2019-05-28 13:54:26 +0200
committerPierre-Marie Pédrot2019-05-28 13:54:26 +0200
commitd4ca25df0f481345c99744acda28728c9682f0ac (patch)
treecb9c1d93a219f7d4491fd52bca61478bf5f4f531 /tactics
parente005f390312b8900df36aa27bc087e18701c8fcd (diff)
parent645ffc989659f2abaf1cb4949ac2ad4d748d6083 (diff)
Merge PR #10133: mind_kelim is the highest allowed sort instead of a list
Ack-by: maximedenes Reviewed-by: ppedrot
Diffstat (limited to 'tactics')
-rw-r--r--tactics/equality.ml6
1 files changed, 3 insertions, 3 deletions
diff --git a/tactics/equality.ml b/tactics/equality.ml
index 45a4799ea1..51eee2a053 100644
--- a/tactics/equality.ml
+++ b/tactics/equality.ml
@@ -735,7 +735,7 @@ let find_positions env sigma ~keep_proofs ~no_discr t1 t2 =
let project env sorts posn t1 t2 =
let ty1 = get_type_of env sigma t1 in
let s = get_sort_family_of ~truncation_style:true env sigma ty1 in
- if Sorts.List.mem s sorts
+ if List.mem_f Sorts.family_equal s sorts
then [(List.rev posn,t1,t2)] else []
in
let rec findrec sorts posn t1 t2 =
@@ -746,7 +746,7 @@ let find_positions env sigma ~keep_proofs ~no_discr t1 t2 =
when Int.equal (List.length args1) (constructor_nallargs env sp1)
->
let sorts' =
- Sorts.List.intersect sorts (allowed_sorts env (fst sp1))
+ CList.intersect Sorts.family_equal sorts (sorts_below (top_allowed_sort env (fst sp1)))
in
(* both sides are fully applied constructors, so either we descend,
or we can discriminate here. *)
@@ -762,7 +762,7 @@ let find_positions env sigma ~keep_proofs ~no_discr t1 t2 =
List.flatten
(List.map2_i (fun i -> findrec sorts' ((sp1,adjust i)::posn))
0 rargs1 rargs2)
- else if Sorts.List.mem InType sorts' && not no_discr
+ else if List.mem_f Sorts.family_equal InType sorts' && not no_discr
then (* see build_discriminator *)
raise (DiscrFound (List.rev posn,sp1,sp2))
else