orders.v 3.74 KB
Newer Older
1
(* Copyright (c) 2012-2017, Coq-std++ developers. *)
2
(* This file is distributed under the terms of the BSD license. *)
3 4
(** Properties about arbitrary pre-, partial, and total orders. We do not use
the relation [⊆] because we often have multiple orders on the same structure *)
5
From stdpp Require Export tactics.
6
Set Default Proof Using "Type".
7

8 9 10 11 12 13 14 15 16
Section orders.
  Context {A} {R : relation A}.
  Implicit Types X Y : A.
  Infix "⊆" := R.
  Notation "X ⊈ Y" := (¬X  Y).
  Infix "⊂" := (strict R).

  Lemma reflexive_eq `{!Reflexive R} X Y : X = Y  X  Y.
  Proof. by intros <-. Qed.
17 18
  Lemma anti_symm_iff `{!PartialOrder R} X Y : X = Y  R X Y  R Y X.
  Proof. split. by intros ->. by intros [??]; apply (anti_symm _). Qed.
19 20 21 22 23 24 25 26 27 28
  Lemma strict_spec X Y : X  Y  X  Y  Y  X.
  Proof. done. Qed.
  Lemma strict_include X Y : X  Y  X  Y.
  Proof. by intros [? _]. Qed.
  Lemma strict_ne X Y : X  Y  X  Y.
  Proof. by intros [??] <-. Qed.
  Lemma strict_ne_sym X Y : X  Y  Y  X.
  Proof. by intros [??] <-. Qed.
  Lemma strict_transitive_l `{!Transitive R} X Y Z : X  Y  Y  Z  X  Z.
  Proof.
29 30
    intros [? HXY] ?. split; [by trans Y|].
    contradict HXY. by trans Z.
31 32 33
  Qed.
  Lemma strict_transitive_r `{!Transitive R} X Y Z : X  Y  Y  Z  X  Z.
  Proof.
34 35
    intros ? [? HYZ]. split; [by trans Y|].
    contradict HYZ. by trans X.
36 37 38 39 40 41 42 43 44 45
  Qed.
  Global Instance: Irreflexive (strict R).
  Proof. firstorder. Qed.
  Global Instance: Transitive R  StrictOrder (strict R).
  Proof.
    split; try apply _.
    eauto using strict_transitive_r, strict_include.
  Qed.
  Global Instance preorder_subset_dec_slow `{ X Y, Decision (X  Y)}
    (X Y : A) : Decision (X  Y) | 100 := _.
46
  Lemma strict_spec_alt `{!AntiSymm (=) R} X Y : X  Y  X  Y  X  Y.
47 48
  Proof.
    split.
49 50
    - intros [? HYX]. split. done. by intros <-.
    - intros [? HXY]. split. done. by contradict HXY; apply (anti_symm R).
51
  Qed.
52
  Lemma po_eq_dec `{!PartialOrder R,  X Y, Decision (X  Y)} : EqDecision A.
53
  Proof.
54
    refine (λ X Y, cast_if_and (decide (X  Y)) (decide (Y  X)));
55
     abstract (rewrite anti_symm_iff; tauto).
56 57 58 59 60
  Defined.
  Lemma total_not `{!Total R} X Y : X  Y  Y  X.
  Proof. intros. destruct (total R X Y); tauto. Qed.
  Lemma total_not_strict `{!Total R} X Y : X  Y  Y  X.
  Proof. red; auto using total_not. Qed.
61
  Global Instance trichotomy_total
62
    `{!Trichotomy (strict R), !Reflexive R} : Total R.
63 64 65 66 67 68 69 70 71 72 73 74 75
  Proof.
    intros X Y.
    destruct (trichotomy (strict R) X Y) as [[??]|[<-|[??]]]; intuition.
  Qed.
End orders.

Section strict_orders.
  Context {A} {R : relation A}.
  Implicit Types X Y : A.
  Infix "⊂" := R.

  Lemma irreflexive_eq `{!Irreflexive R} X Y : X = Y  ¬X  Y.
  Proof. intros ->. apply (irreflexivity R). Qed.
76
  Lemma strict_anti_symm `{!StrictOrder R} X Y :
77
    X  Y  Y  X  False.
78
  Proof. intros. apply (irreflexivity R X). by trans Y. Qed.
79 80
  Global Instance trichotomyT_dec `{!TrichotomyT R, !StrictOrder R} X Y :
      Decision (X  Y) :=
81
    match trichotomyT R X Y with
82 83
    | inleft (left H) => left H
    | inleft (right H) => right (irreflexive_eq _ _ H)
84
    | inright H => right (strict_anti_symm _ _ H)
85 86 87
    end.
  Global Instance trichotomyT_trichotomy `{!TrichotomyT R} : Trichotomy R.
  Proof. intros X Y. destruct (trichotomyT R X Y) as [[|]|]; tauto. Qed.
88
End strict_orders.
89 90 91

Ltac simplify_order := repeat
  match goal with
92
  | _ => progress simplify_eq/=
93
  | H : ?R ?x ?x |- _ => by destruct (irreflexivity _ _ H)
94 95 96
  | H1 : ?R ?x ?y |- _ =>
    match goal with
    | H2 : R y x |- _ =>
97
      assert (x = y) by (by apply (anti_symm R)); clear H1 H2
98 99
    | H2 : R y ?z |- _ =>
      unless (R x z) by done;
100
      assert (R x z) by (by trans y)
101 102
    end
  end.