1 (* Author: Tobias Nipkow *)
3 header {* Orders as Relations *}
9 subsection{* Orders on a set *}
11 definition "preorder_on A r \<equiv> refl_on A r \<and> trans r"
13 definition "partial_order_on A r \<equiv> preorder_on A r \<and> antisym r"
15 definition "linear_order_on A r \<equiv> partial_order_on A r \<and> total_on A r"
17 definition "strict_linear_order_on A r \<equiv> trans r \<and> irrefl r \<and> total_on A r"
19 definition "well_order_on A r \<equiv> linear_order_on A r \<and> wf(r - Id)"
21 lemmas order_on_defs =
22 preorder_on_def partial_order_on_def linear_order_on_def
23 strict_linear_order_on_def well_order_on_def
26 lemma preorder_on_empty[simp]: "preorder_on {} {}"
27 by(simp add:preorder_on_def trans_def)
29 lemma partial_order_on_empty[simp]: "partial_order_on {} {}"
30 by(simp add:partial_order_on_def)
32 lemma lnear_order_on_empty[simp]: "linear_order_on {} {}"
33 by(simp add:linear_order_on_def)
35 lemma well_order_on_empty[simp]: "well_order_on {} {}"
36 by(simp add:well_order_on_def)
39 lemma preorder_on_converse[simp]: "preorder_on A (r^-1) = preorder_on A r"
40 by (simp add:preorder_on_def)
42 lemma partial_order_on_converse[simp]:
43 "partial_order_on A (r^-1) = partial_order_on A r"
44 by (simp add: partial_order_on_def)
46 lemma linear_order_on_converse[simp]:
47 "linear_order_on A (r^-1) = linear_order_on A r"
48 by (simp add: linear_order_on_def)
51 lemma strict_linear_order_on_diff_Id:
52 "linear_order_on A r \<Longrightarrow> strict_linear_order_on A (r-Id)"
53 by(simp add: order_on_defs trans_diff_Id)
56 subsection{* Orders on the field *}
58 abbreviation "Refl r \<equiv> refl_on (Field r) r"
60 abbreviation "Preorder r \<equiv> preorder_on (Field r) r"
62 abbreviation "Partial_order r \<equiv> partial_order_on (Field r) r"
64 abbreviation "Total r \<equiv> total_on (Field r) r"
66 abbreviation "Linear_order r \<equiv> linear_order_on (Field r) r"
68 abbreviation "Well_order r \<equiv> well_order_on (Field r) r"
71 lemma subset_Image_Image_iff:
72 "\<lbrakk> Preorder r; A \<subseteq> Field r; B \<subseteq> Field r\<rbrakk> \<Longrightarrow>
73 r `` A \<subseteq> r `` B \<longleftrightarrow> (\<forall>a\<in>A.\<exists>b\<in>B. (b,a):r)"
74 unfolding preorder_on_def refl_on_def Image_def
75 apply (simp add: subset_eq)
76 unfolding trans_def by fast
78 lemma subset_Image1_Image1_iff:
79 "\<lbrakk> Preorder r; a : Field r; b : Field r\<rbrakk> \<Longrightarrow> r `` {a} \<subseteq> r `` {b} \<longleftrightarrow> (b,a):r"
80 by(simp add:subset_Image_Image_iff)
82 lemma Refl_antisym_eq_Image1_Image1_iff:
83 "\<lbrakk>Refl r; antisym r; a:Field r; b:Field r\<rbrakk> \<Longrightarrow> r `` {a} = r `` {b} \<longleftrightarrow> a=b"
84 by(simp add: set_eq_iff antisym_def refl_on_def) metis
86 lemma Partial_order_eq_Image1_Image1_iff:
87 "\<lbrakk>Partial_order r; a:Field r; b:Field r\<rbrakk> \<Longrightarrow> r `` {a} = r `` {b} \<longleftrightarrow> a=b"
88 by(auto simp:order_on_defs Refl_antisym_eq_Image1_Image1_iff)
91 assumes TOT: "Total r" and NID: "\<not> (r <= Id)"
92 shows "Field r = Field(r - Id)"
93 using mono_Field[of "r - Id" r] Diff_subset[of r Id]
95 have "r \<noteq> {}" using NID by fast
96 then obtain b and c where "b \<noteq> c \<and> (b,c) \<in> r" using NID by auto
97 hence 1: "b \<noteq> c \<and> {b,c} \<le> Field r" by (auto simp: Field_def)
99 fix a assume *: "a \<in> Field r"
100 obtain d where 2: "d \<in> Field r" and 3: "d \<noteq> a"
102 hence "(a,d) \<in> r \<or> (d,a) \<in> r" using * TOT
103 by (simp add: total_on_def)
104 thus "a \<in> Field(r - Id)" using 3 unfolding Field_def by blast
108 subsection{* Orders on a type *}
110 abbreviation "strict_linear_order \<equiv> strict_linear_order_on UNIV"
112 abbreviation "linear_order \<equiv> linear_order_on UNIV"
114 abbreviation "well_order r \<equiv> well_order_on UNIV"