Skip to content

use RelationClasses instead of Relations_1 in Sorting #152

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

use RelationClasses instead of Relations_1 in Sorting #152

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions theories/Sorting/Sorted.v
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@
The two notions are equivalent if the order is transitive.
*)

From Stdlib Require Import List Relations Relations_1.
From Stdlib Require Import List Relations RelationClasses.

(* Set Universe Polymorphism. *)

Expand All @@ -29,7 +29,7 @@ From Stdlib Require Import List Relations Relations_1.
Set Implicit Arguments.
Local Notation "[ ]" := nil (at level 0).
Local Notation "[ a ; .. ; b ]" := (a :: .. (b :: []) ..) (at level 0).
Arguments Transitive [U] R.
Local Arguments Transitive [_] R.

Section defs.

Expand Down
Loading