nipkow@15524: (*  Title:      HOL/Orderings.thy
nipkow@15524:     ID:         $Id$
nipkow@15524:     Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
nipkow@15524: *)
nipkow@15524: 
haftmann@21329: header {* Syntactic and abstract orders *}
nipkow@15524: 
nipkow@15524: theory Orderings
haftmann@23881: imports Set Fun
haftmann@23263: uses
haftmann@23263:   "~~/src/Provers/order.ML"
nipkow@15524: begin
nipkow@15524: 
haftmann@22841: subsection {* Partial orders *}
nipkow@15524: 
haftmann@22841: class order = ord +
haftmann@25062:   assumes less_le: "x < y \<longleftrightarrow> x \<le> y \<and> x \<noteq> y"
haftmann@25062:   and order_refl [iff]: "x \<le> x"
haftmann@25062:   and order_trans: "x \<le> y \<Longrightarrow> y \<le> z \<Longrightarrow> x \<le> z"
haftmann@25062:   assumes antisym: "x \<le> y \<Longrightarrow> y \<le> x \<Longrightarrow> x = y"
haftmann@21248: begin
haftmann@21248: 
haftmann@24748: notation (input)
haftmann@24748:   less_eq (infix "\<sqsubseteq>" 50)
haftmann@24748: and
haftmann@24748:   less    (infix "\<sqsubset>" 50)
haftmann@24748: 
nipkow@15524: text {* Reflexivity. *}
nipkow@15524: 
haftmann@25062: lemma eq_refl: "x = y \<Longrightarrow> x \<le> y"
nipkow@15524:     -- {* This form is useful with the classical reasoner. *}
nipkow@23212: by (erule ssubst) (rule order_refl)
nipkow@15524: 
haftmann@25062: lemma less_irrefl [iff]: "\<not> x < x"
nipkow@23212: by (simp add: less_le)
nipkow@15524: 
haftmann@25062: lemma le_less: "x \<le> y \<longleftrightarrow> x < y \<or> x = y"
nipkow@15524:     -- {* NOT suitable for iff, since it can cause PROOF FAILED. *}
nipkow@23212: by (simp add: less_le) blast
nipkow@15524: 
haftmann@25062: lemma le_imp_less_or_eq: "x \<le> y \<Longrightarrow> x < y \<or> x = y"
nipkow@23212: unfolding less_le by blast
nipkow@15524: 
haftmann@25062: lemma less_imp_le: "x < y \<Longrightarrow> x \<le> y"
nipkow@23212: unfolding less_le by blast
haftmann@21248: 
haftmann@25062: lemma less_imp_neq: "x < y \<Longrightarrow> x \<noteq> y"
nipkow@23212: by (erule contrapos_pn, erule subst, rule less_irrefl)
haftmann@21329: 
haftmann@21329: 
haftmann@21329: text {* Useful for simplification, but too risky to include by default. *}
haftmann@21329: 
haftmann@25062: lemma less_imp_not_eq: "x < y \<Longrightarrow> (x = y) \<longleftrightarrow> False"
nipkow@23212: by auto
haftmann@21329: 
haftmann@25062: lemma less_imp_not_eq2: "x < y \<Longrightarrow> (y = x) \<longleftrightarrow> False"
nipkow@23212: by auto
haftmann@21329: 
haftmann@21329: 
haftmann@21329: text {* Transitivity rules for calculational reasoning *}
haftmann@21329: 
haftmann@25062: lemma neq_le_trans: "a \<noteq> b \<Longrightarrow> a \<le> b \<Longrightarrow> a < b"
nipkow@23212: by (simp add: less_le)
haftmann@21329: 
haftmann@25062: lemma le_neq_trans: "a \<le> b \<Longrightarrow> a \<noteq> b \<Longrightarrow> a < b"
nipkow@23212: by (simp add: less_le)
haftmann@21329: 
nipkow@15524: 
nipkow@15524: text {* Asymmetry. *}
nipkow@15524: 
haftmann@25062: lemma less_not_sym: "x < y \<Longrightarrow> \<not> (y < x)"
nipkow@23212: by (simp add: less_le antisym)
nipkow@15524: 
haftmann@25062: lemma less_asym: "x < y \<Longrightarrow> (\<not> P \<Longrightarrow> y < x) \<Longrightarrow> P"
nipkow@23212: by (drule less_not_sym, erule contrapos_np) simp
nipkow@15524: 
haftmann@25062: lemma eq_iff: "x = y \<longleftrightarrow> x \<le> y \<and> y \<le> x"
nipkow@23212: by (blast intro: antisym)
nipkow@15524: 
haftmann@25062: lemma antisym_conv: "y \<le> x \<Longrightarrow> x \<le> y \<longleftrightarrow> x = y"
nipkow@23212: by (blast intro: antisym)
nipkow@15524: 
haftmann@25062: lemma less_imp_neq: "x < y \<Longrightarrow> x \<noteq> y"
nipkow@23212: by (erule contrapos_pn, erule subst, rule less_irrefl)
haftmann@21248: 
haftmann@21083: 
nipkow@15524: text {* Transitivity. *}
nipkow@15524: 
haftmann@25062: lemma less_trans: "x < y \<Longrightarrow> y < z \<Longrightarrow> x < z"
nipkow@23212: by (simp add: less_le) (blast intro: order_trans antisym)
nipkow@15524: 
haftmann@25062: lemma le_less_trans: "x \<le> y \<Longrightarrow> y < z \<Longrightarrow> x < z"
nipkow@23212: by (simp add: less_le) (blast intro: order_trans antisym)
nipkow@15524: 
haftmann@25062: lemma less_le_trans: "x < y \<Longrightarrow> y \<le> z \<Longrightarrow> x < z"
nipkow@23212: by (simp add: less_le) (blast intro: order_trans antisym)
nipkow@15524: 
nipkow@15524: 
nipkow@15524: text {* Useful for simplification, but too risky to include by default. *}
nipkow@15524: 
haftmann@25062: lemma less_imp_not_less: "x < y \<Longrightarrow> (\<not> y < x) \<longleftrightarrow> True"
nipkow@23212: by (blast elim: less_asym)
nipkow@15524: 
haftmann@25062: lemma less_imp_triv: "x < y \<Longrightarrow> (y < x \<longrightarrow> P) \<longleftrightarrow> True"
nipkow@23212: by (blast elim: less_asym)
nipkow@15524: 
haftmann@21248: 
haftmann@21083: text {* Transitivity rules for calculational reasoning *}
nipkow@15524: 
haftmann@25062: lemma less_asym': "a < b \<Longrightarrow> b < a \<Longrightarrow> P"
nipkow@23212: by (rule less_asym)
haftmann@21248: 
haftmann@22916: 
haftmann@22916: text {* Reverse order *}
haftmann@22916: 
haftmann@22916: lemma order_reverse:
haftmann@25103:   "order (op \<ge>) (op >)"
nipkow@23212: by unfold_locales
nipkow@23212:    (simp add: less_le, auto intro: antisym order_trans)
haftmann@22916: 
haftmann@21248: end
nipkow@15524: 
haftmann@21329: 
haftmann@21329: subsection {* Linear (total) orders *}
haftmann@21329: 
haftmann@22316: class linorder = order +
haftmann@21216:   assumes linear: "x \<sqsubseteq> y \<or> y \<sqsubseteq> x"
haftmann@21248: begin
haftmann@21248: 
haftmann@25062: lemma less_linear: "x < y \<or> x = y \<or> y < x"
nipkow@23212: unfolding less_le using less_le linear by blast
haftmann@21248: 
haftmann@25062: lemma le_less_linear: "x \<le> y \<or> y < x"
nipkow@23212: by (simp add: le_less less_linear)
haftmann@21248: 
haftmann@21248: lemma le_cases [case_names le ge]:
haftmann@25062:   "(x \<le> y \<Longrightarrow> P) \<Longrightarrow> (y \<le> x \<Longrightarrow> P) \<Longrightarrow> P"
nipkow@23212: using linear by blast
haftmann@21248: 
haftmann@22384: lemma linorder_cases [case_names less equal greater]:
haftmann@25062:   "(x < y \<Longrightarrow> P) \<Longrightarrow> (x = y \<Longrightarrow> P) \<Longrightarrow> (y < x \<Longrightarrow> P) \<Longrightarrow> P"
nipkow@23212: using less_linear by blast
haftmann@21248: 
haftmann@25062: lemma not_less: "\<not> x < y \<longleftrightarrow> y \<le> x"
nipkow@23212: apply (simp add: less_le)
nipkow@23212: using linear apply (blast intro: antisym)
nipkow@23212: done
nipkow@23212: 
nipkow@23212: lemma not_less_iff_gr_or_eq:
haftmann@25062:  "\<not>(x < y) \<longleftrightarrow> (x > y | x = y)"
nipkow@23212: apply(simp add:not_less le_less)
nipkow@23212: apply blast
nipkow@23212: done
nipkow@15524: 
haftmann@25062: lemma not_le: "\<not> x \<le> y \<longleftrightarrow> y < x"
nipkow@23212: apply (simp add: less_le)
nipkow@23212: using linear apply (blast intro: antisym)
nipkow@23212: done
nipkow@15524: 
haftmann@25062: lemma neq_iff: "x \<noteq> y \<longleftrightarrow> x < y \<or> y < x"
nipkow@23212: by (cut_tac x = x and y = y in less_linear, auto)
nipkow@15524: 
haftmann@25062: lemma neqE: "x \<noteq> y \<Longrightarrow> (x < y \<Longrightarrow> R) \<Longrightarrow> (y < x \<Longrightarrow> R) \<Longrightarrow> R"
nipkow@23212: by (simp add: neq_iff) blast
nipkow@15524: 
haftmann@25062: lemma antisym_conv1: "\<not> x < y \<Longrightarrow> x \<le> y \<longleftrightarrow> x = y"
nipkow@23212: by (blast intro: antisym dest: not_less [THEN iffD1])
nipkow@15524: 
haftmann@25062: lemma antisym_conv2: "x \<le> y \<Longrightarrow> \<not> x < y \<longleftrightarrow> x = y"
nipkow@23212: by (blast intro: antisym dest: not_less [THEN iffD1])
nipkow@15524: 
haftmann@25062: lemma antisym_conv3: "\<not> y < x \<Longrightarrow> \<not> x < y \<longleftrightarrow> x = y"
nipkow@23212: by (blast intro: antisym dest: not_less [THEN iffD1])
nipkow@15524: 
paulson@16796: text{*Replacing the old Nat.leI*}
haftmann@25062: lemma leI: "\<not> x < y \<Longrightarrow> y \<le> x"
nipkow@23212: unfolding not_less .
paulson@16796: 
haftmann@25062: lemma leD: "y \<le> x \<Longrightarrow> \<not> x < y"
nipkow@23212: unfolding not_less .
paulson@16796: 
paulson@16796: (*FIXME inappropriate name (or delete altogether)*)
haftmann@25062: lemma not_leE: "\<not> y \<le> x \<Longrightarrow> x < y"
nipkow@23212: unfolding not_le .
haftmann@21248: 
haftmann@22916: 
haftmann@22916: text {* Reverse order *}
haftmann@22916: 
haftmann@22916: lemma linorder_reverse:
haftmann@25103:   "linorder (op \<ge>) (op >)"
nipkow@23212: by unfold_locales
nipkow@23212:   (simp add: less_le, auto intro: antisym order_trans simp add: linear)
haftmann@22916: 
haftmann@22916: 
haftmann@23881: text {* min/max *}
haftmann@23881: 
haftmann@23881: text {* for historic reasons, definitions are done in context ord *}
haftmann@23881: 
haftmann@23881: definition (in ord)
haftmann@23881:   min :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
haftmann@25062:   [code unfold, code inline del]: "min a b = (if a \<le> b then a else b)"
haftmann@23881: 
haftmann@23881: definition (in ord)
haftmann@23881:   max :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
haftmann@25062:   [code unfold, code inline del]: "max a b = (if a \<le> b then b else a)"
haftmann@22384: 
haftmann@21383: lemma min_le_iff_disj:
haftmann@25062:   "min x y \<le> z \<longleftrightarrow> x \<le> z \<or> y \<le> z"
nipkow@23212: unfolding min_def using linear by (auto intro: order_trans)
haftmann@21383: 
haftmann@21383: lemma le_max_iff_disj:
haftmann@25062:   "z \<le> max x y \<longleftrightarrow> z \<le> x \<or> z \<le> y"
nipkow@23212: unfolding max_def using linear by (auto intro: order_trans)
haftmann@21383: 
haftmann@21383: lemma min_less_iff_disj:
haftmann@25062:   "min x y < z \<longleftrightarrow> x < z \<or> y < z"
nipkow@23212: unfolding min_def le_less using less_linear by (auto intro: less_trans)
haftmann@21383: 
haftmann@21383: lemma less_max_iff_disj:
haftmann@25062:   "z < max x y \<longleftrightarrow> z < x \<or> z < y"
nipkow@23212: unfolding max_def le_less using less_linear by (auto intro: less_trans)
haftmann@21383: 
haftmann@21383: lemma min_less_iff_conj [simp]:
haftmann@25062:   "z < min x y \<longleftrightarrow> z < x \<and> z < y"
nipkow@23212: unfolding min_def le_less using less_linear by (auto intro: less_trans)
haftmann@21383: 
haftmann@21383: lemma max_less_iff_conj [simp]:
haftmann@25062:   "max x y < z \<longleftrightarrow> x < z \<and> y < z"
nipkow@23212: unfolding max_def le_less using less_linear by (auto intro: less_trans)
haftmann@21383: 
paulson@24286: lemma split_min [noatp]:
haftmann@25062:   "P (min i j) \<longleftrightarrow> (i \<le> j \<longrightarrow> P i) \<and> (\<not> i \<le> j \<longrightarrow> P j)"
nipkow@23212: by (simp add: min_def)
haftmann@21383: 
paulson@24286: lemma split_max [noatp]:
haftmann@25062:   "P (max i j) \<longleftrightarrow> (i \<le> j \<longrightarrow> P j) \<and> (\<not> i \<le> j \<longrightarrow> P i)"
nipkow@23212: by (simp add: max_def)
haftmann@21383: 
haftmann@21248: end
haftmann@21248: 
haftmann@23948: 
haftmann@21083: subsection {* Reasoning tools setup *}
haftmann@21083: 
haftmann@21091: ML {*
haftmann@21091: 
ballarin@24641: signature ORDERS =
ballarin@24641: sig
ballarin@24641:   val print_structures: Proof.context -> unit
ballarin@24641:   val setup: theory -> theory
ballarin@24704:   val order_tac: thm list -> Proof.context -> int -> tactic
ballarin@24641: end;
haftmann@21091: 
ballarin@24641: structure Orders: ORDERS =
haftmann@21248: struct
ballarin@24641: 
ballarin@24641: (** Theory and context data **)
ballarin@24641: 
ballarin@24641: fun struct_eq ((s1: string, ts1), (s2, ts2)) =
ballarin@24641:   (s1 = s2) andalso eq_list (op aconv) (ts1, ts2);
ballarin@24641: 
ballarin@24641: structure Data = GenericDataFun
ballarin@24641: (
ballarin@24641:   type T = ((string * term list) * Order_Tac.less_arith) list;
ballarin@24641:     (* Order structures:
ballarin@24641:        identifier of the structure, list of operations and record of theorems
ballarin@24641:        needed to set up the transitivity reasoner,
ballarin@24641:        identifier and operations identify the structure uniquely. *)
ballarin@24641:   val empty = [];
ballarin@24641:   val extend = I;
ballarin@24641:   fun merge _ = AList.join struct_eq (K fst);
ballarin@24641: );
ballarin@24641: 
ballarin@24641: fun print_structures ctxt =
ballarin@24641:   let
ballarin@24641:     val structs = Data.get (Context.Proof ctxt);
ballarin@24641:     fun pretty_term t = Pretty.block
wenzelm@24920:       [Pretty.quote (Syntax.pretty_term ctxt t), Pretty.brk 1,
ballarin@24641:         Pretty.str "::", Pretty.brk 1,
wenzelm@24920:         Pretty.quote (Syntax.pretty_typ ctxt (type_of t))];
ballarin@24641:     fun pretty_struct ((s, ts), _) = Pretty.block
ballarin@24641:       [Pretty.str s, Pretty.str ":", Pretty.brk 1,
ballarin@24641:        Pretty.enclose "(" ")" (Pretty.breaks (map pretty_term ts))];
ballarin@24641:   in
ballarin@24641:     Pretty.writeln (Pretty.big_list "Order structures:" (map pretty_struct structs))
ballarin@24641:   end;
ballarin@24641: 
ballarin@24641: 
ballarin@24641: (** Method **)
haftmann@21091: 
ballarin@24704: fun struct_tac ((s, [eq, le, less]), thms) prems =
ballarin@24641:   let
ballarin@24641:     fun decomp thy (Trueprop $ t) =
ballarin@24641:       let
ballarin@24641:         fun excluded t =
ballarin@24641:           (* exclude numeric types: linear arithmetic subsumes transitivity *)
ballarin@24641:           let val T = type_of t
ballarin@24641:           in
ballarin@24641: 	    T = HOLogic.natT orelse T = HOLogic.intT orelse T = HOLogic.realT
ballarin@24641:           end;
ballarin@24741: 	fun rel (bin_op $ t1 $ t2) =
ballarin@24641:               if excluded t1 then NONE
ballarin@24641:               else if Pattern.matches thy (eq, bin_op) then SOME (t1, "=", t2)
ballarin@24641:               else if Pattern.matches thy (le, bin_op) then SOME (t1, "<=", t2)
ballarin@24641:               else if Pattern.matches thy (less, bin_op) then SOME (t1, "<", t2)
ballarin@24641:               else NONE
ballarin@24741: 	  | rel _ = NONE;
ballarin@24741: 	fun dec (Const (@{const_name Not}, _) $ t) = (case rel t
ballarin@24741: 	      of NONE => NONE
ballarin@24741: 	       | SOME (t1, rel, t2) => SOME (t1, "~" ^ rel, t2))
ballarin@24741:           | dec x = rel x;
ballarin@24641:       in dec t end;
ballarin@24641:   in
ballarin@24641:     case s of
ballarin@24704:       "order" => Order_Tac.partial_tac decomp thms prems
ballarin@24704:     | "linorder" => Order_Tac.linear_tac decomp thms prems
ballarin@24641:     | _ => error ("Unknown kind of order `" ^ s ^ "' encountered in transitivity reasoner.")
ballarin@24641:   end
ballarin@24641: 
ballarin@24704: fun order_tac prems ctxt =
ballarin@24704:   FIRST' (map (fn s => CHANGED o struct_tac s prems) (Data.get (Context.Proof ctxt)));
ballarin@24641: 
ballarin@24641: 
ballarin@24641: (** Attribute **)
ballarin@24641: 
ballarin@24641: fun add_struct_thm s tag =
ballarin@24641:   Thm.declaration_attribute
ballarin@24641:     (fn thm => Data.map (AList.map_default struct_eq (s, Order_Tac.empty TrueI) (Order_Tac.update tag thm)));
ballarin@24641: fun del_struct s =
ballarin@24641:   Thm.declaration_attribute
ballarin@24641:     (fn _ => Data.map (AList.delete struct_eq s));
ballarin@24641: 
ballarin@24641: val attribute = Attrib.syntax
ballarin@24641:      (Scan.lift ((Args.add -- Args.name >> (fn (_, s) => SOME s) ||
ballarin@24641:           Args.del >> K NONE) --| Args.colon (* FIXME ||
ballarin@24641:         Scan.succeed true *) ) -- Scan.lift Args.name --
ballarin@24641:       Scan.repeat Args.term
ballarin@24641:       >> (fn ((SOME tag, n), ts) => add_struct_thm (n, ts) tag
ballarin@24641:            | ((NONE, n), ts) => del_struct (n, ts)));
ballarin@24641: 
ballarin@24641: 
ballarin@24641: (** Diagnostic command **)
ballarin@24641: 
ballarin@24641: val print = Toplevel.unknown_context o
ballarin@24641:   Toplevel.keep (Toplevel.node_case
ballarin@24641:     (Context.cases (print_structures o ProofContext.init) print_structures)
ballarin@24641:     (print_structures o Proof.context_of));
ballarin@24641: 
wenzelm@24867: val _ =
ballarin@24641:   OuterSyntax.improper_command "print_orders"
ballarin@24641:     "print order structures available to transitivity reasoner" OuterKeyword.diag
ballarin@24641:     (Scan.succeed (Toplevel.no_timing o print));
ballarin@24641: 
ballarin@24641: 
ballarin@24641: (** Setup **)
ballarin@24641: 
wenzelm@24867: val setup =
wenzelm@24867:   Method.add_methods
wenzelm@24867:     [("order", Method.ctxt_args (Method.SIMPLE_METHOD' o order_tac []), "transitivity reasoner")] #>
wenzelm@24867:   Attrib.add_attributes [("order", attribute, "theorems controlling transitivity reasoner")];
haftmann@21091: 
haftmann@21091: end;
ballarin@24641: 
haftmann@21091: *}
haftmann@21091: 
ballarin@24641: setup Orders.setup
ballarin@24641: 
ballarin@24641: 
ballarin@24641: text {* Declarations to set up transitivity reasoner of partial and linear orders. *}
ballarin@24641: 
haftmann@25076: context order
haftmann@25076: begin
haftmann@25076: 
ballarin@24641: (* The type constraint on @{term op =} below is necessary since the operation
ballarin@24641:    is not a parameter of the locale. *)
haftmann@25076: 
haftmann@25076: lemmas
haftmann@25076:   [order add less_reflE: order "op = :: 'a \<Rightarrow> 'a \<Rightarrow> bool" "op <=" "op <"] =
ballarin@24641:   less_irrefl [THEN notE]
haftmann@25076: lemmas
haftmann@25062:   [order add le_refl: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   order_refl
haftmann@25076: lemmas
haftmann@25062:   [order add less_imp_le: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   less_imp_le
haftmann@25076: lemmas
haftmann@25062:   [order add eqI: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   antisym
haftmann@25076: lemmas
haftmann@25062:   [order add eqD1: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   eq_refl
haftmann@25076: lemmas
haftmann@25062:   [order add eqD2: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   sym [THEN eq_refl]
haftmann@25076: lemmas
haftmann@25062:   [order add less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   less_trans
haftmann@25076: lemmas
haftmann@25062:   [order add less_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   less_le_trans
haftmann@25076: lemmas
haftmann@25062:   [order add le_less_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   le_less_trans
haftmann@25076: lemmas
haftmann@25062:   [order add le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   order_trans
haftmann@25076: lemmas
haftmann@25062:   [order add le_neq_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   le_neq_trans
haftmann@25076: lemmas
haftmann@25062:   [order add neq_le_trans: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   neq_le_trans
haftmann@25076: lemmas
haftmann@25062:   [order add less_imp_neq: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   less_imp_neq
haftmann@25076: lemmas
haftmann@25062:   [order add eq_neq_eq_imp_neq: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:    eq_neq_eq_imp_neq
haftmann@25076: lemmas
haftmann@25062:   [order add not_sym: order "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   not_sym
ballarin@24641: 
haftmann@25076: end
haftmann@25076: 
haftmann@25076: context linorder
haftmann@25076: begin
ballarin@24641: 
haftmann@25076: lemmas
haftmann@25076:   [order del: order "op = :: 'a => 'a => bool" "op <=" "op <"] = _
haftmann@25076: 
haftmann@25076: lemmas
haftmann@25062:   [order add less_reflE: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   less_irrefl [THEN notE]
haftmann@25076: lemmas
haftmann@25062:   [order add le_refl: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   order_refl
haftmann@25076: lemmas
haftmann@25062:   [order add less_imp_le: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   less_imp_le
haftmann@25076: lemmas
haftmann@25062:   [order add not_lessI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   not_less [THEN iffD2]
haftmann@25076: lemmas
haftmann@25062:   [order add not_leI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   not_le [THEN iffD2]
haftmann@25076: lemmas
haftmann@25062:   [order add not_lessD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   not_less [THEN iffD1]
haftmann@25076: lemmas
haftmann@25062:   [order add not_leD: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   not_le [THEN iffD1]
haftmann@25076: lemmas
haftmann@25062:   [order add eqI: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   antisym
haftmann@25076: lemmas
haftmann@25062:   [order add eqD1: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   eq_refl
haftmann@25076: lemmas
haftmann@25062:   [order add eqD2: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   sym [THEN eq_refl]
haftmann@25076: lemmas
haftmann@25062:   [order add less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   less_trans
haftmann@25076: lemmas
haftmann@25062:   [order add less_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   less_le_trans
haftmann@25076: lemmas
haftmann@25062:   [order add le_less_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   le_less_trans
haftmann@25076: lemmas
haftmann@25062:   [order add le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   order_trans
haftmann@25076: lemmas
haftmann@25062:   [order add le_neq_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   le_neq_trans
haftmann@25076: lemmas
haftmann@25062:   [order add neq_le_trans: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   neq_le_trans
haftmann@25076: lemmas
haftmann@25062:   [order add less_imp_neq: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   less_imp_neq
haftmann@25076: lemmas
haftmann@25062:   [order add eq_neq_eq_imp_neq: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   eq_neq_eq_imp_neq
haftmann@25076: lemmas
haftmann@25062:   [order add not_sym: linorder "op = :: 'a => 'a => bool" "op <=" "op <"] =
ballarin@24641:   not_sym
ballarin@24641: 
haftmann@25076: end
haftmann@25076: 
ballarin@24641: 
haftmann@21083: setup {*
haftmann@21083: let
haftmann@21083: 
haftmann@21083: fun prp t thm = (#prop (rep_thm thm) = t);
nipkow@15524: 
haftmann@21083: fun prove_antisym_le sg ss ((le as Const(_,T)) $ r $ s) =
haftmann@21083:   let val prems = prems_of_ss ss;
haftmann@22916:       val less = Const (@{const_name less}, T);
haftmann@21083:       val t = HOLogic.mk_Trueprop(le $ s $ r);
haftmann@21083:   in case find_first (prp t) prems of
haftmann@21083:        NONE =>
haftmann@21083:          let val t = HOLogic.mk_Trueprop(HOLogic.Not $ (less $ r $ s))
haftmann@21083:          in case find_first (prp t) prems of
haftmann@21083:               NONE => NONE
haftmann@24422:             | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv1}))
haftmann@21083:          end
haftmann@24422:      | SOME thm => SOME(mk_meta_eq(thm RS @{thm order_class.antisym_conv}))
haftmann@21083:   end
haftmann@21083:   handle THM _ => NONE;
nipkow@15524: 
haftmann@21083: fun prove_antisym_less sg ss (NotC $ ((less as Const(_,T)) $ r $ s)) =
haftmann@21083:   let val prems = prems_of_ss ss;
haftmann@22916:       val le = Const (@{const_name less_eq}, T);
haftmann@21083:       val t = HOLogic.mk_Trueprop(le $ r $ s);
haftmann@21083:   in case find_first (prp t) prems of
haftmann@21083:        NONE =>
haftmann@21083:          let val t = HOLogic.mk_Trueprop(NotC $ (less $ s $ r))
haftmann@21083:          in case find_first (prp t) prems of
haftmann@21083:               NONE => NONE
haftmann@24422:             | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv3}))
haftmann@21083:          end
haftmann@24422:      | SOME thm => SOME(mk_meta_eq(thm RS @{thm linorder_class.antisym_conv2}))
haftmann@21083:   end
haftmann@21083:   handle THM _ => NONE;
nipkow@15524: 
haftmann@21248: fun add_simprocs procs thy =
haftmann@21248:   (Simplifier.change_simpset_of thy (fn ss => ss
haftmann@21248:     addsimprocs (map (fn (name, raw_ts, proc) =>
haftmann@21248:       Simplifier.simproc thy name raw_ts proc)) procs); thy);
haftmann@21248: fun add_solver name tac thy =
haftmann@21248:   (Simplifier.change_simpset_of thy (fn ss => ss addSolver
ballarin@24704:     (mk_solver' name (fn ss => tac (MetaSimplifier.prems_of_ss ss) (MetaSimplifier.the_context ss)))); thy);
haftmann@21083: 
haftmann@21083: in
haftmann@21248:   add_simprocs [
haftmann@21248:        ("antisym le", ["(x::'a::order) <= y"], prove_antisym_le),
haftmann@21248:        ("antisym less", ["~ (x::'a::linorder) < y"], prove_antisym_less)
haftmann@21248:      ]
ballarin@24641:   #> add_solver "Transitivity" Orders.order_tac
haftmann@21248:   (* Adding the transitivity reasoners also as safe solvers showed a slight
haftmann@21248:      speed up, but the reasoning strength appears to be not higher (at least
haftmann@21248:      no breaking of additional proofs in the entire HOL distribution, as
haftmann@21248:      of 5 March 2004, was observed). *)
haftmann@21083: end
haftmann@21083: *}
nipkow@15524: 
nipkow@15524: 
haftmann@24422: subsection {* Dense orders *}
haftmann@24422: 
haftmann@24422: class dense_linear_order = linorder + 
haftmann@25076:   assumes gt_ex: "\<exists>y. x < y" 
haftmann@25076:   and lt_ex: "\<exists>y. y < x"
haftmann@25076:   and dense: "x < y \<Longrightarrow> (\<exists>z. x < z \<and> z < y)"
haftmann@24422:   (*see further theory Dense_Linear_Order*)
haftmann@25076: begin
ballarin@24641: 
haftmann@24422: lemma interval_empty_iff:
haftmann@25076:   "{y. x < y \<and> y < z} = {} \<longleftrightarrow> \<not> x < z"
haftmann@24422:   by (auto dest: dense)
haftmann@24422: 
haftmann@25076: end
haftmann@25076: 
haftmann@24422: subsection {* Name duplicates *}
haftmann@24422: 
haftmann@24422: lemmas order_less_le = less_le
haftmann@24422: lemmas order_eq_refl = order_class.eq_refl
haftmann@24422: lemmas order_less_irrefl = order_class.less_irrefl
haftmann@24422: lemmas order_le_less = order_class.le_less
haftmann@24422: lemmas order_le_imp_less_or_eq = order_class.le_imp_less_or_eq
haftmann@24422: lemmas order_less_imp_le = order_class.less_imp_le
haftmann@24422: lemmas order_less_imp_not_eq = order_class.less_imp_not_eq
haftmann@24422: lemmas order_less_imp_not_eq2 = order_class.less_imp_not_eq2
haftmann@24422: lemmas order_neq_le_trans = order_class.neq_le_trans
haftmann@24422: lemmas order_le_neq_trans = order_class.le_neq_trans
haftmann@24422: 
haftmann@24422: lemmas order_antisym = antisym
haftmann@24422: lemmas order_less_not_sym = order_class.less_not_sym
haftmann@24422: lemmas order_less_asym = order_class.less_asym
haftmann@24422: lemmas order_eq_iff = order_class.eq_iff
haftmann@24422: lemmas order_antisym_conv = order_class.antisym_conv
haftmann@24422: lemmas order_less_trans = order_class.less_trans
haftmann@24422: lemmas order_le_less_trans = order_class.le_less_trans
haftmann@24422: lemmas order_less_le_trans = order_class.less_le_trans
haftmann@24422: lemmas order_less_imp_not_less = order_class.less_imp_not_less
haftmann@24422: lemmas order_less_imp_triv = order_class.less_imp_triv
haftmann@24422: lemmas order_less_asym' = order_class.less_asym'
haftmann@24422: 
haftmann@24422: lemmas linorder_linear = linear
haftmann@24422: lemmas linorder_less_linear = linorder_class.less_linear
haftmann@24422: lemmas linorder_le_less_linear = linorder_class.le_less_linear
haftmann@24422: lemmas linorder_le_cases = linorder_class.le_cases
haftmann@24422: lemmas linorder_not_less = linorder_class.not_less
haftmann@24422: lemmas linorder_not_le = linorder_class.not_le
haftmann@24422: lemmas linorder_neq_iff = linorder_class.neq_iff
haftmann@24422: lemmas linorder_neqE = linorder_class.neqE
haftmann@24422: lemmas linorder_antisym_conv1 = linorder_class.antisym_conv1
haftmann@24422: lemmas linorder_antisym_conv2 = linorder_class.antisym_conv2
haftmann@24422: lemmas linorder_antisym_conv3 = linorder_class.antisym_conv3
haftmann@24422: 
haftmann@24422: 
haftmann@21083: subsection {* Bounded quantifiers *}
haftmann@21083: 
haftmann@21083: syntax
wenzelm@21180:   "_All_less" :: "[idt, 'a, bool] => bool"    ("(3ALL _<_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3EX _<_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3ALL _<=_./ _)" [0, 0, 10] 10)
wenzelm@21180:   "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _<=_./ _)" [0, 0, 10] 10)
haftmann@21083: 
wenzelm@21180:   "_All_greater" :: "[idt, 'a, bool] => bool"    ("(3ALL _>_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_Ex_greater" :: "[idt, 'a, bool] => bool"    ("(3EX _>_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_All_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3ALL _>=_./ _)" [0, 0, 10] 10)
wenzelm@21180:   "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3EX _>=_./ _)" [0, 0, 10] 10)
haftmann@21083: 
haftmann@21083: syntax (xsymbols)
wenzelm@21180:   "_All_less" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_<_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_<_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<le>_./ _)" [0, 0, 10] 10)
wenzelm@21180:   "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
haftmann@21083: 
wenzelm@21180:   "_All_greater" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_>_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_Ex_greater" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_>_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_All_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<ge>_./ _)" [0, 0, 10] 10)
wenzelm@21180:   "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
haftmann@21083: 
haftmann@21083: syntax (HOL)
wenzelm@21180:   "_All_less" :: "[idt, 'a, bool] => bool"    ("(3! _<_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3? _<_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3! _<=_./ _)" [0, 0, 10] 10)
wenzelm@21180:   "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3? _<=_./ _)" [0, 0, 10] 10)
haftmann@21083: 
haftmann@21083: syntax (HTML output)
wenzelm@21180:   "_All_less" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_<_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_Ex_less" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_<_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_All_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<le>_./ _)" [0, 0, 10] 10)
wenzelm@21180:   "_Ex_less_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<le>_./ _)" [0, 0, 10] 10)
haftmann@21083: 
wenzelm@21180:   "_All_greater" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_>_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_Ex_greater" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_>_./ _)"  [0, 0, 10] 10)
wenzelm@21180:   "_All_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<forall>_\<ge>_./ _)" [0, 0, 10] 10)
wenzelm@21180:   "_Ex_greater_eq" :: "[idt, 'a, bool] => bool"    ("(3\<exists>_\<ge>_./ _)" [0, 0, 10] 10)
haftmann@21083: 
haftmann@21083: translations
haftmann@21083:   "ALL x<y. P"   =>  "ALL x. x < y \<longrightarrow> P"
haftmann@21083:   "EX x<y. P"    =>  "EX x. x < y \<and> P"
haftmann@21083:   "ALL x<=y. P"  =>  "ALL x. x <= y \<longrightarrow> P"
haftmann@21083:   "EX x<=y. P"   =>  "EX x. x <= y \<and> P"
haftmann@21083:   "ALL x>y. P"   =>  "ALL x. x > y \<longrightarrow> P"
haftmann@21083:   "EX x>y. P"    =>  "EX x. x > y \<and> P"
haftmann@21083:   "ALL x>=y. P"  =>  "ALL x. x >= y \<longrightarrow> P"
haftmann@21083:   "EX x>=y. P"   =>  "EX x. x >= y \<and> P"
haftmann@21083: 
haftmann@21083: print_translation {*
haftmann@21083: let
haftmann@22916:   val All_binder = Syntax.binder_name @{const_syntax All};
haftmann@22916:   val Ex_binder = Syntax.binder_name @{const_syntax Ex};
wenzelm@22377:   val impl = @{const_syntax "op -->"};
wenzelm@22377:   val conj = @{const_syntax "op &"};
haftmann@22916:   val less = @{const_syntax less};
haftmann@22916:   val less_eq = @{const_syntax less_eq};
wenzelm@21180: 
wenzelm@21180:   val trans =
wenzelm@21524:    [((All_binder, impl, less), ("_All_less", "_All_greater")),
wenzelm@21524:     ((All_binder, impl, less_eq), ("_All_less_eq", "_All_greater_eq")),
wenzelm@21524:     ((Ex_binder, conj, less), ("_Ex_less", "_Ex_greater")),
wenzelm@21524:     ((Ex_binder, conj, less_eq), ("_Ex_less_eq", "_Ex_greater_eq"))];
wenzelm@21180: 
krauss@22344:   fun matches_bound v t = 
krauss@22344:      case t of (Const ("_bound", _) $ Free (v', _)) => (v = v')
krauss@22344:               | _ => false
krauss@22344:   fun contains_var v = Term.exists_subterm (fn Free (x, _) => x = v | _ => false)
krauss@22344:   fun mk v c n P = Syntax.const c $ Syntax.mark_bound v $ n $ P
wenzelm@21180: 
wenzelm@21180:   fun tr' q = (q,
wenzelm@21180:     fn [Const ("_bound", _) $ Free (v, _), Const (c, _) $ (Const (d, _) $ t $ u) $ P] =>
wenzelm@21180:       (case AList.lookup (op =) trans (q, c, d) of
wenzelm@21180:         NONE => raise Match
wenzelm@21180:       | SOME (l, g) =>
krauss@22344:           if matches_bound v t andalso not (contains_var v u) then mk v l u P
krauss@22344:           else if matches_bound v u andalso not (contains_var v t) then mk v g t P
krauss@22344:           else raise Match)
wenzelm@21180:      | _ => raise Match);
wenzelm@21524: in [tr' All_binder, tr' Ex_binder] end
haftmann@21083: *}
haftmann@21083: 
haftmann@21083: 
haftmann@21383: subsection {* Transitivity reasoning *}
haftmann@21383: 
haftmann@21383: lemma ord_le_eq_trans: "a <= b ==> b = c ==> a <= c"
nipkow@23212: by (rule subst)
haftmann@21383: 
haftmann@21383: lemma ord_eq_le_trans: "a = b ==> b <= c ==> a <= c"
nipkow@23212: by (rule ssubst)
haftmann@21383: 
haftmann@21383: lemma ord_less_eq_trans: "a < b ==> b = c ==> a < c"
nipkow@23212: by (rule subst)
haftmann@21383: 
haftmann@21383: lemma ord_eq_less_trans: "a = b ==> b < c ==> a < c"
nipkow@23212: by (rule ssubst)
haftmann@21383: 
haftmann@21383: lemma order_less_subst2: "(a::'a::order) < b ==> f b < (c::'c::order) ==>
haftmann@21383:   (!!x y. x < y ==> f x < f y) ==> f a < c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383:   assume "a < b" hence "f a < f b" by (rule r)
haftmann@21383:   also assume "f b < c"
haftmann@21383:   finally (order_less_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma order_less_subst1: "(a::'a::order) < f b ==> (b::'b::order) < c ==>
haftmann@21383:   (!!x y. x < y ==> f x < f y) ==> a < f c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383:   assume "a < f b"
haftmann@21383:   also assume "b < c" hence "f b < f c" by (rule r)
haftmann@21383:   finally (order_less_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma order_le_less_subst2: "(a::'a::order) <= b ==> f b < (c::'c::order) ==>
haftmann@21383:   (!!x y. x <= y ==> f x <= f y) ==> f a < c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383:   assume "a <= b" hence "f a <= f b" by (rule r)
haftmann@21383:   also assume "f b < c"
haftmann@21383:   finally (order_le_less_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma order_le_less_subst1: "(a::'a::order) <= f b ==> (b::'b::order) < c ==>
haftmann@21383:   (!!x y. x < y ==> f x < f y) ==> a < f c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383:   assume "a <= f b"
haftmann@21383:   also assume "b < c" hence "f b < f c" by (rule r)
haftmann@21383:   finally (order_le_less_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma order_less_le_subst2: "(a::'a::order) < b ==> f b <= (c::'c::order) ==>
haftmann@21383:   (!!x y. x < y ==> f x < f y) ==> f a < c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383:   assume "a < b" hence "f a < f b" by (rule r)
haftmann@21383:   also assume "f b <= c"
haftmann@21383:   finally (order_less_le_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma order_less_le_subst1: "(a::'a::order) < f b ==> (b::'b::order) <= c ==>
haftmann@21383:   (!!x y. x <= y ==> f x <= f y) ==> a < f c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383:   assume "a < f b"
haftmann@21383:   also assume "b <= c" hence "f b <= f c" by (rule r)
haftmann@21383:   finally (order_less_le_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma order_subst1: "(a::'a::order) <= f b ==> (b::'b::order) <= c ==>
haftmann@21383:   (!!x y. x <= y ==> f x <= f y) ==> a <= f c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383:   assume "a <= f b"
haftmann@21383:   also assume "b <= c" hence "f b <= f c" by (rule r)
haftmann@21383:   finally (order_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma order_subst2: "(a::'a::order) <= b ==> f b <= (c::'c::order) ==>
haftmann@21383:   (!!x y. x <= y ==> f x <= f y) ==> f a <= c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383:   assume "a <= b" hence "f a <= f b" by (rule r)
haftmann@21383:   also assume "f b <= c"
haftmann@21383:   finally (order_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma ord_le_eq_subst: "a <= b ==> f b = c ==>
haftmann@21383:   (!!x y. x <= y ==> f x <= f y) ==> f a <= c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383:   assume "a <= b" hence "f a <= f b" by (rule r)
haftmann@21383:   also assume "f b = c"
haftmann@21383:   finally (ord_le_eq_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma ord_eq_le_subst: "a = f b ==> b <= c ==>
haftmann@21383:   (!!x y. x <= y ==> f x <= f y) ==> a <= f c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x <= y ==> f x <= f y"
haftmann@21383:   assume "a = f b"
haftmann@21383:   also assume "b <= c" hence "f b <= f c" by (rule r)
haftmann@21383:   finally (ord_eq_le_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma ord_less_eq_subst: "a < b ==> f b = c ==>
haftmann@21383:   (!!x y. x < y ==> f x < f y) ==> f a < c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383:   assume "a < b" hence "f a < f b" by (rule r)
haftmann@21383:   also assume "f b = c"
haftmann@21383:   finally (ord_less_eq_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: lemma ord_eq_less_subst: "a = f b ==> b < c ==>
haftmann@21383:   (!!x y. x < y ==> f x < f y) ==> a < f c"
haftmann@21383: proof -
haftmann@21383:   assume r: "!!x y. x < y ==> f x < f y"
haftmann@21383:   assume "a = f b"
haftmann@21383:   also assume "b < c" hence "f b < f c" by (rule r)
haftmann@21383:   finally (ord_eq_less_trans) show ?thesis .
haftmann@21383: qed
haftmann@21383: 
haftmann@21383: text {*
haftmann@21383:   Note that this list of rules is in reverse order of priorities.
haftmann@21383: *}
haftmann@21383: 
haftmann@21383: lemmas order_trans_rules [trans] =
haftmann@21383:   order_less_subst2
haftmann@21383:   order_less_subst1
haftmann@21383:   order_le_less_subst2
haftmann@21383:   order_le_less_subst1
haftmann@21383:   order_less_le_subst2
haftmann@21383:   order_less_le_subst1
haftmann@21383:   order_subst2
haftmann@21383:   order_subst1
haftmann@21383:   ord_le_eq_subst
haftmann@21383:   ord_eq_le_subst
haftmann@21383:   ord_less_eq_subst
haftmann@21383:   ord_eq_less_subst
haftmann@21383:   forw_subst
haftmann@21383:   back_subst
haftmann@21383:   rev_mp
haftmann@21383:   mp
haftmann@21383:   order_neq_le_trans
haftmann@21383:   order_le_neq_trans
haftmann@21383:   order_less_trans
haftmann@21383:   order_less_asym'
haftmann@21383:   order_le_less_trans
haftmann@21383:   order_less_le_trans
haftmann@21383:   order_trans
haftmann@21383:   order_antisym
haftmann@21383:   ord_le_eq_trans
haftmann@21383:   ord_eq_le_trans
haftmann@21383:   ord_less_eq_trans
haftmann@21383:   ord_eq_less_trans
haftmann@21383:   trans
haftmann@21383: 
haftmann@21083: 
wenzelm@21180: (* FIXME cleanup *)
wenzelm@21180: 
haftmann@21083: text {* These support proving chains of decreasing inequalities
haftmann@21083:     a >= b >= c ... in Isar proofs. *}
haftmann@21083: 
haftmann@21083: lemma xt1:
haftmann@21083:   "a = b ==> b > c ==> a > c"
haftmann@21083:   "a > b ==> b = c ==> a > c"
haftmann@21083:   "a = b ==> b >= c ==> a >= c"
haftmann@21083:   "a >= b ==> b = c ==> a >= c"
haftmann@21083:   "(x::'a::order) >= y ==> y >= x ==> x = y"
haftmann@21083:   "(x::'a::order) >= y ==> y >= z ==> x >= z"
haftmann@21083:   "(x::'a::order) > y ==> y >= z ==> x > z"
haftmann@21083:   "(x::'a::order) >= y ==> y > z ==> x > z"
wenzelm@23417:   "(a::'a::order) > b ==> b > a ==> P"
haftmann@21083:   "(x::'a::order) > y ==> y > z ==> x > z"
haftmann@21083:   "(a::'a::order) >= b ==> a ~= b ==> a > b"
haftmann@21083:   "(a::'a::order) ~= b ==> a >= b ==> a > b"
haftmann@21083:   "a = f b ==> b > c ==> (!!x y. x > y ==> f x > f y) ==> a > f c" 
haftmann@21083:   "a > b ==> f b = c ==> (!!x y. x > y ==> f x > f y) ==> f a > c"
haftmann@21083:   "a = f b ==> b >= c ==> (!!x y. x >= y ==> f x >= f y) ==> a >= f c"
haftmann@21083:   "a >= b ==> f b = c ==> (!! x y. x >= y ==> f x >= f y) ==> f a >= c"
haftmann@25076:   by auto
haftmann@21083: 
haftmann@21083: lemma xt2:
haftmann@21083:   "(a::'a::order) >= f b ==> b >= c ==> (!!x y. x >= y ==> f x >= f y) ==> a >= f c"
haftmann@21083: by (subgoal_tac "f b >= f c", force, force)
haftmann@21083: 
haftmann@21083: lemma xt3: "(a::'a::order) >= b ==> (f b::'b::order) >= c ==> 
haftmann@21083:     (!!x y. x >= y ==> f x >= f y) ==> f a >= c"
haftmann@21083: by (subgoal_tac "f a >= f b", force, force)
haftmann@21083: 
haftmann@21083: lemma xt4: "(a::'a::order) > f b ==> (b::'b::order) >= c ==>
haftmann@21083:   (!!x y. x >= y ==> f x >= f y) ==> a > f c"
haftmann@21083: by (subgoal_tac "f b >= f c", force, force)
haftmann@21083: 
haftmann@21083: lemma xt5: "(a::'a::order) > b ==> (f b::'b::order) >= c==>
haftmann@21083:     (!!x y. x > y ==> f x > f y) ==> f a > c"
haftmann@21083: by (subgoal_tac "f a > f b", force, force)
haftmann@21083: 
haftmann@21083: lemma xt6: "(a::'a::order) >= f b ==> b > c ==>
haftmann@21083:     (!!x y. x > y ==> f x > f y) ==> a > f c"
haftmann@21083: by (subgoal_tac "f b > f c", force, force)
haftmann@21083: 
haftmann@21083: lemma xt7: "(a::'a::order) >= b ==> (f b::'b::order) > c ==>
haftmann@21083:     (!!x y. x >= y ==> f x >= f y) ==> f a > c"
haftmann@21083: by (subgoal_tac "f a >= f b", force, force)
haftmann@21083: 
haftmann@21083: lemma xt8: "(a::'a::order) > f b ==> (b::'b::order) > c ==>
haftmann@21083:     (!!x y. x > y ==> f x > f y) ==> a > f c"
haftmann@21083: by (subgoal_tac "f b > f c", force, force)
haftmann@21083: 
haftmann@21083: lemma xt9: "(a::'a::order) > b ==> (f b::'b::order) > c ==>
haftmann@21083:     (!!x y. x > y ==> f x > f y) ==> f a > c"
haftmann@21083: by (subgoal_tac "f a > f b", force, force)
haftmann@21083: 
haftmann@21083: lemmas xtrans = xt1 xt2 xt3 xt4 xt5 xt6 xt7 xt8 xt9
haftmann@21083: 
haftmann@21083: (* 
haftmann@21083:   Since "a >= b" abbreviates "b <= a", the abbreviation "..." stands
haftmann@21083:   for the wrong thing in an Isar proof.
haftmann@21083: 
haftmann@21083:   The extra transitivity rules can be used as follows: 
haftmann@21083: 
haftmann@21083: lemma "(a::'a::order) > z"
haftmann@21083: proof -
haftmann@21083:   have "a >= b" (is "_ >= ?rhs")
haftmann@21083:     sorry
haftmann@21083:   also have "?rhs >= c" (is "_ >= ?rhs")
haftmann@21083:     sorry
haftmann@21083:   also (xtrans) have "?rhs = d" (is "_ = ?rhs")
haftmann@21083:     sorry
haftmann@21083:   also (xtrans) have "?rhs >= e" (is "_ >= ?rhs")
haftmann@21083:     sorry
haftmann@21083:   also (xtrans) have "?rhs > f" (is "_ > ?rhs")
haftmann@21083:     sorry
haftmann@21083:   also (xtrans) have "?rhs > z"
haftmann@21083:     sorry
haftmann@21083:   finally (xtrans) show ?thesis .
haftmann@21083: qed
haftmann@21083: 
haftmann@21083:   Alternatively, one can use "declare xtrans [trans]" and then
haftmann@21083:   leave out the "(xtrans)" above.
haftmann@21083: *)
haftmann@21083: 
haftmann@21546: subsection {* Order on bool *}
haftmann@21546: 
haftmann@22886: instance bool :: order 
haftmann@21546:   le_bool_def: "P \<le> Q \<equiv> P \<longrightarrow> Q"
haftmann@21546:   less_bool_def: "P < Q \<equiv> P \<le> Q \<and> P \<noteq> Q"
haftmann@22916:   by intro_classes (auto simp add: le_bool_def less_bool_def)
haftmann@24422: lemmas [code func del] = le_bool_def less_bool_def
haftmann@21546: 
haftmann@21546: lemma le_boolI: "(P \<Longrightarrow> Q) \<Longrightarrow> P \<le> Q"
nipkow@23212: by (simp add: le_bool_def)
haftmann@21546: 
haftmann@21546: lemma le_boolI': "P \<longrightarrow> Q \<Longrightarrow> P \<le> Q"
nipkow@23212: by (simp add: le_bool_def)
haftmann@21546: 
haftmann@21546: lemma le_boolE: "P \<le> Q \<Longrightarrow> P \<Longrightarrow> (Q \<Longrightarrow> R) \<Longrightarrow> R"
nipkow@23212: by (simp add: le_bool_def)
haftmann@21546: 
haftmann@21546: lemma le_boolD: "P \<le> Q \<Longrightarrow> P \<longrightarrow> Q"
nipkow@23212: by (simp add: le_bool_def)
haftmann@21546: 
haftmann@22348: lemma [code func]:
haftmann@22348:   "False \<le> b \<longleftrightarrow> True"
haftmann@22348:   "True \<le> b \<longleftrightarrow> b"
haftmann@22348:   "False < b \<longleftrightarrow> b"
haftmann@22348:   "True < b \<longleftrightarrow> False"
haftmann@22348:   unfolding le_bool_def less_bool_def by simp_all
haftmann@22348: 
haftmann@22424: 
haftmann@23881: subsection {* Order on sets *}
haftmann@23881: 
haftmann@23881: instance set :: (type) order
haftmann@23881:   by (intro_classes,
haftmann@23881:       (assumption | rule subset_refl subset_trans subset_antisym psubset_eq)+)
haftmann@23881: 
haftmann@23881: lemmas basic_trans_rules [trans] =
haftmann@23881:   order_trans_rules set_rev_mp set_mp
haftmann@23881: 
haftmann@23881: 
haftmann@23881: subsection {* Order on functions *}
haftmann@23881: 
haftmann@23881: instance "fun" :: (type, ord) ord
haftmann@23881:   le_fun_def: "f \<le> g \<equiv> \<forall>x. f x \<le> g x"
haftmann@23881:   less_fun_def: "f < g \<equiv> f \<le> g \<and> f \<noteq> g" ..
haftmann@23881: 
haftmann@23881: lemmas [code func del] = le_fun_def less_fun_def
haftmann@23881: 
haftmann@23881: instance "fun" :: (type, order) order
haftmann@23881:   by default
haftmann@23881:     (auto simp add: le_fun_def less_fun_def expand_fun_eq
haftmann@23881:        intro: order_trans order_antisym)
haftmann@23881: 
haftmann@23881: lemma le_funI: "(\<And>x. f x \<le> g x) \<Longrightarrow> f \<le> g"
haftmann@23881:   unfolding le_fun_def by simp
haftmann@23881: 
haftmann@23881: lemma le_funE: "f \<le> g \<Longrightarrow> (f x \<le> g x \<Longrightarrow> P) \<Longrightarrow> P"
haftmann@23881:   unfolding le_fun_def by simp
haftmann@23881: 
haftmann@23881: lemma le_funD: "f \<le> g \<Longrightarrow> f x \<le> g x"
haftmann@23881:   unfolding le_fun_def by simp
haftmann@23881: 
haftmann@23881: text {*
haftmann@23881:   Handy introduction and elimination rules for @{text "\<le>"}
haftmann@23881:   on unary and binary predicates
haftmann@23881: *}
haftmann@23881: 
haftmann@23881: lemma predicate1I [Pure.intro!, intro!]:
haftmann@23881:   assumes PQ: "\<And>x. P x \<Longrightarrow> Q x"
haftmann@23881:   shows "P \<le> Q"
haftmann@23881:   apply (rule le_funI)
haftmann@23881:   apply (rule le_boolI)
haftmann@23881:   apply (rule PQ)
haftmann@23881:   apply assumption
haftmann@23881:   done
haftmann@23881: 
haftmann@23881: lemma predicate1D [Pure.dest, dest]: "P \<le> Q \<Longrightarrow> P x \<Longrightarrow> Q x"
haftmann@23881:   apply (erule le_funE)
haftmann@23881:   apply (erule le_boolE)
haftmann@23881:   apply assumption+
haftmann@23881:   done
haftmann@23881: 
haftmann@23881: lemma predicate2I [Pure.intro!, intro!]:
haftmann@23881:   assumes PQ: "\<And>x y. P x y \<Longrightarrow> Q x y"
haftmann@23881:   shows "P \<le> Q"
haftmann@23881:   apply (rule le_funI)+
haftmann@23881:   apply (rule le_boolI)
haftmann@23881:   apply (rule PQ)
haftmann@23881:   apply assumption
haftmann@23881:   done
haftmann@23881: 
haftmann@23881: lemma predicate2D [Pure.dest, dest]: "P \<le> Q \<Longrightarrow> P x y \<Longrightarrow> Q x y"
haftmann@23881:   apply (erule le_funE)+
haftmann@23881:   apply (erule le_boolE)
haftmann@23881:   apply assumption+
haftmann@23881:   done
haftmann@23881: 
haftmann@23881: lemma rev_predicate1D: "P x ==> P <= Q ==> Q x"
haftmann@23881:   by (rule predicate1D)
haftmann@23881: 
haftmann@23881: lemma rev_predicate2D: "P x y ==> P <= Q ==> Q x y"
haftmann@23881:   by (rule predicate2D)
haftmann@23881: 
haftmann@23881: 
haftmann@23881: subsection {* Monotonicity, least value operator and min/max *}
haftmann@21083: 
haftmann@25076: context order
haftmann@25076: begin
haftmann@25076: 
haftmann@25076: definition
haftmann@25076:   mono :: "('a \<Rightarrow> 'b\<Colon>order) \<Rightarrow> bool"
haftmann@25076: where
haftmann@25076:   "mono f \<longleftrightarrow> (\<forall>x y. x \<le> y \<longrightarrow> f x \<le> f y)"
haftmann@25076: 
haftmann@25076: lemma monoI [intro?]:
haftmann@25076:   fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
haftmann@25076:   shows "(\<And>x y. x \<le> y \<Longrightarrow> f x \<le> f y) \<Longrightarrow> mono f"
haftmann@25076:   unfolding mono_def by iprover
haftmann@21216: 
haftmann@25076: lemma monoD [dest?]:
haftmann@25076:   fixes f :: "'a \<Rightarrow> 'b\<Colon>order"
haftmann@25076:   shows "mono f \<Longrightarrow> x \<le> y \<Longrightarrow> f x \<le> f y"
haftmann@25076:   unfolding mono_def by iprover
haftmann@25076: 
haftmann@25076: end
haftmann@25076: 
haftmann@25076: context linorder
haftmann@25076: begin
haftmann@25076: 
haftmann@25076: lemma min_of_mono:
haftmann@25076:   fixes f :: "'a \<Rightarrow> 'b\<Colon>linorder"
haftmann@25076:   shows "mono f \<Longrightarrow> Orderings.min (f m) (f n) = f (min m n)"
haftmann@25076:   by (auto simp: mono_def Orderings.min_def min_def intro: Orderings.antisym)
haftmann@25076: 
haftmann@25076: lemma max_of_mono:
haftmann@25076:   fixes f :: "'a \<Rightarrow> 'b\<Colon>linorder"
haftmann@25076:   shows "mono f \<Longrightarrow> Orderings.max (f m) (f n) = f (max m n)"
haftmann@25076:   by (auto simp: mono_def Orderings.max_def max_def intro: Orderings.antisym)
haftmann@25076: 
haftmann@25076: end
haftmann@21083: 
haftmann@21383: lemma LeastI2_order:
haftmann@21383:   "[| P (x::'a::order);
haftmann@21383:       !!y. P y ==> x <= y;
haftmann@21383:       !!x. [| P x; ALL y. P y --> x \<le> y |] ==> Q x |]
haftmann@21383:    ==> Q (Least P)"
nipkow@23212: apply (unfold Least_def)
nipkow@23212: apply (rule theI2)
nipkow@23212:   apply (blast intro: order_antisym)+
nipkow@23212: done
haftmann@21383: 
haftmann@23881: lemma Least_mono:
haftmann@23881:   "mono (f::'a::order => 'b::order) ==> EX x:S. ALL y:S. x <= y
haftmann@23881:     ==> (LEAST y. y : f ` S) = f (LEAST x. x : S)"
haftmann@23881:     -- {* Courtesy of Stephan Merz *}
haftmann@23881:   apply clarify
haftmann@23881:   apply (erule_tac P = "%x. x : S" in LeastI2_order, fast)
haftmann@23881:   apply (rule LeastI2_order)
haftmann@23881:   apply (auto elim: monoD intro!: order_antisym)
haftmann@23881:   done
haftmann@23881: 
haftmann@21383: lemma Least_equality:
nipkow@23212:   "[| P (k::'a::order); !!x. P x ==> k <= x |] ==> (LEAST x. P x) = k"
nipkow@23212: apply (simp add: Least_def)
nipkow@23212: apply (rule the_equality)
nipkow@23212: apply (auto intro!: order_antisym)
nipkow@23212: done
haftmann@21383: 
haftmann@21383: lemma min_leastL: "(!!x. least <= x) ==> min least x = least"
nipkow@23212: by (simp add: min_def)
haftmann@21383: 
haftmann@21383: lemma max_leastL: "(!!x. least <= x) ==> max least x = x"
nipkow@23212: by (simp add: max_def)
haftmann@21383: 
haftmann@21383: lemma min_leastR: "(\<And>x\<Colon>'a\<Colon>order. least \<le> x) \<Longrightarrow> min x least = least"
nipkow@23212: apply (simp add: min_def)
nipkow@23212: apply (blast intro: order_antisym)
nipkow@23212: done
haftmann@21383: 
haftmann@21383: lemma max_leastR: "(\<And>x\<Colon>'a\<Colon>order. least \<le> x) \<Longrightarrow> max x least = x"
nipkow@23212: apply (simp add: max_def)
nipkow@23212: apply (blast intro: order_antisym)
nipkow@23212: done
haftmann@21383: 
haftmann@22548: subsection {* legacy ML bindings *}
wenzelm@21673: 
wenzelm@21673: ML {*
haftmann@22548: val monoI = @{thm monoI};
haftmann@22886: *}
wenzelm@21673: 
nipkow@15524: end