src/HOL/Wellfounded.thy
author webertj
Fri, 19 Oct 2012 15:12:52 +0200
changeset 49962 a8cc904a6820
parent 48891 c0eafbd55de3
child 49945 fb696ff1f086
permissions -rw-r--r--
Renamed {left,right}_distrib to distrib_{right,left}.
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
32960
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
     1
(*  Title:      HOL/Wellfounded.thy
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
     2
    Author:     Tobias Nipkow
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
     3
    Author:     Lawrence C Paulson
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
     4
    Author:     Konrad Slind
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
     5
    Author:     Alexander Krauss
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
     6
*)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
     7
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
     8
header {*Well-founded Recursion*}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
     9
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    10
theory Wellfounded
35727
817b8e0f7086 Big_Operators now in Main rather than Plain
haftmann
parents: 35719
diff changeset
    11
imports Transitive_Closure
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    12
begin
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    13
26976
cf147f69b3df rearranged subsections
krauss
parents: 26803
diff changeset
    14
subsection {* Basic Definitions *}
cf147f69b3df rearranged subsections
krauss
parents: 26803
diff changeset
    15
33217
ab979f6e99f4 authentic constants; moved "acyclic" further down
krauss
parents: 33216
diff changeset
    16
definition wf :: "('a * 'a) set => bool" where
45137
6e422d180de8 modernized definitions
haftmann
parents: 45012
diff changeset
    17
  "wf r \<longleftrightarrow> (!P. (!x. (!y. (y,x):r --> P(y)) --> P(x)) --> (!x. P(x)))"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    18
33217
ab979f6e99f4 authentic constants; moved "acyclic" further down
krauss
parents: 33216
diff changeset
    19
definition wfP :: "('a => 'a => bool) => bool" where
45137
6e422d180de8 modernized definitions
haftmann
parents: 45012
diff changeset
    20
  "wfP r \<longleftrightarrow> wf {(x, y). r x y}"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    21
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    22
lemma wfP_wf_eq [pred_set_conv]: "wfP (\<lambda>x y. (x, y) \<in> r) = wf r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    23
  by (simp add: wfP_def)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    24
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    25
lemma wfUNIVI: 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    26
   "(!!P x. (ALL x. (ALL y. (y,x) : r --> P(y)) --> P(x)) ==> P(x)) ==> wf(r)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    27
  unfolding wf_def by blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    28
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    29
lemmas wfPUNIVI = wfUNIVI [to_pred]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    30
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    31
text{*Restriction to domain @{term A} and range @{term B}.  If @{term r} is
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    32
    well-founded over their intersection, then @{term "wf r"}*}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    33
lemma wfI: 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    34
 "[| r \<subseteq> A <*> B; 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    35
     !!x P. [|\<forall>x. (\<forall>y. (y,x) : r --> P y) --> P x;  x : A; x : B |] ==> P x |]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    36
  ==>  wf r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    37
  unfolding wf_def by blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    38
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    39
lemma wf_induct: 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    40
    "[| wf(r);           
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    41
        !!x.[| ALL y. (y,x): r --> P(y) |] ==> P(x)  
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    42
     |]  ==>  P(a)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    43
  unfolding wf_def by blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    44
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    45
lemmas wfP_induct = wf_induct [to_pred]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    46
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    47
lemmas wf_induct_rule = wf_induct [rule_format, consumes 1, case_names less, induct set: wf]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    48
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    49
lemmas wfP_induct_rule = wf_induct_rule [to_pred, induct set: wfP]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    50
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    51
lemma wf_not_sym: "wf r ==> (a, x) : r ==> (x, a) ~: r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    52
  by (induct a arbitrary: x set: wf) blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    53
33215
6fd85372981e replaced (outdated) comments by explicit statements
krauss
parents: 32960
diff changeset
    54
lemma wf_asym:
6fd85372981e replaced (outdated) comments by explicit statements
krauss
parents: 32960
diff changeset
    55
  assumes "wf r" "(a, x) \<in> r"
6fd85372981e replaced (outdated) comments by explicit statements
krauss
parents: 32960
diff changeset
    56
  obtains "(x, a) \<notin> r"
6fd85372981e replaced (outdated) comments by explicit statements
krauss
parents: 32960
diff changeset
    57
  by (drule wf_not_sym[OF assms])
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    58
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    59
lemma wf_not_refl [simp]: "wf r ==> (a, a) ~: r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    60
  by (blast elim: wf_asym)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    61
33215
6fd85372981e replaced (outdated) comments by explicit statements
krauss
parents: 32960
diff changeset
    62
lemma wf_irrefl: assumes "wf r" obtains "(a, a) \<notin> r"
6fd85372981e replaced (outdated) comments by explicit statements
krauss
parents: 32960
diff changeset
    63
by (drule wf_not_refl[OF assms])
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
    64
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    65
lemma wf_wellorderI:
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    66
  assumes wf: "wf {(x::'a::ord, y). x < y}"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    67
  assumes lin: "OFCLASS('a::ord, linorder_class)"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    68
  shows "OFCLASS('a::ord, wellorder_class)"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    69
using lin by (rule wellorder_class.intro)
36635
080b755377c0 locale predicates of classes carry a mandatory "class" prefix
haftmann
parents: 35828
diff changeset
    70
  (blast intro: class.wellorder_axioms.intro wf_induct_rule [OF wf])
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    71
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    72
lemma (in wellorder) wf:
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    73
  "wf {(x, y). x < y}"
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    74
unfolding wf_def by (blast intro: less_induct)
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    75
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
    76
26976
cf147f69b3df rearranged subsections
krauss
parents: 26803
diff changeset
    77
subsection {* Basic Results *}
cf147f69b3df rearranged subsections
krauss
parents: 26803
diff changeset
    78
33216
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    79
text {* Point-free characterization of well-foundedness *}
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    80
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    81
lemma wfE_pf:
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    82
  assumes wf: "wf R"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    83
  assumes a: "A \<subseteq> R `` A"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    84
  shows "A = {}"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    85
proof -
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    86
  { fix x
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    87
    from wf have "x \<notin> A"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    88
    proof induct
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    89
      fix x assume "\<And>y. (y, x) \<in> R \<Longrightarrow> y \<notin> A"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    90
      then have "x \<notin> R `` A" by blast
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    91
      with a show "x \<notin> A" by blast
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    92
    qed
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    93
  } thus ?thesis by auto
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    94
qed
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    95
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    96
lemma wfI_pf:
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    97
  assumes a: "\<And>A. A \<subseteq> R `` A \<Longrightarrow> A = {}"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    98
  shows "wf R"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
    99
proof (rule wfUNIVI)
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   100
  fix P :: "'a \<Rightarrow> bool" and x
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   101
  let ?A = "{x. \<not> P x}"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   102
  assume "\<forall>x. (\<forall>y. (y, x) \<in> R \<longrightarrow> P y) \<longrightarrow> P x"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   103
  then have "?A \<subseteq> R `` ?A" by blast
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   104
  with a show "P x" by blast
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   105
qed
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   106
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   107
text{*Minimal-element characterization of well-foundedness*}
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   108
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   109
lemma wfE_min:
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   110
  assumes wf: "wf R" and Q: "x \<in> Q"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   111
  obtains z where "z \<in> Q" "\<And>y. (y, z) \<in> R \<Longrightarrow> y \<notin> Q"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   112
  using Q wfE_pf[OF wf, of Q] by blast
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   113
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   114
lemma wfI_min:
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   115
  assumes a: "\<And>x Q. x \<in> Q \<Longrightarrow> \<exists>z\<in>Q. \<forall>y. (y, z) \<in> R \<longrightarrow> y \<notin> Q"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   116
  shows "wf R"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   117
proof (rule wfI_pf)
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   118
  fix A assume b: "A \<subseteq> R `` A"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   119
  { fix x assume "x \<in> A"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   120
    from a[OF this] b have "False" by blast
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   121
  }
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   122
  thus "A = {}" by blast
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   123
qed
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   124
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   125
lemma wf_eq_minimal: "wf r = (\<forall>Q x. x\<in>Q --> (\<exists>z\<in>Q. \<forall>y. (y,z)\<in>r --> y\<notin>Q))"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   126
apply auto
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   127
apply (erule wfE_min, assumption, blast)
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   128
apply (rule wfI_min, auto)
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   129
done
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   130
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   131
lemmas wfP_eq_minimal = wf_eq_minimal [to_pred]
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   132
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   133
text{* Well-foundedness of transitive closure *}
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   134
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   135
lemma wf_trancl:
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   136
  assumes "wf r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   137
  shows "wf (r^+)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   138
proof -
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   139
  {
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   140
    fix P and x
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   141
    assume induct_step: "!!x. (!!y. (y, x) : r^+ ==> P y) ==> P x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   142
    have "P x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   143
    proof (rule induct_step)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   144
      fix y assume "(y, x) : r^+"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   145
      with `wf r` show "P y"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   146
      proof (induct x arbitrary: y)
32960
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   147
        case (less x)
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   148
        note hyp = `\<And>x' y'. (x', x) : r ==> (y', x') : r^+ ==> P y'`
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   149
        from `(y, x) : r^+` show "P y"
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   150
        proof cases
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   151
          case base
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   152
          show "P y"
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   153
          proof (rule induct_step)
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   154
            fix y' assume "(y', y) : r^+"
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   155
            with `(y, x) : r` show "P y'" by (rule hyp [of y y'])
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   156
          qed
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   157
        next
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   158
          case step
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   159
          then obtain x' where "(x', x) : r" and "(y, x') : r^+" by simp
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   160
          then show "P y" by (rule hyp [of x' y])
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32704
diff changeset
   161
        qed
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   162
      qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   163
    qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   164
  } then show ?thesis unfolding wf_def by blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   165
qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   166
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   167
lemmas wfP_trancl = wf_trancl [to_pred]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   168
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   169
lemma wf_converse_trancl: "wf (r^-1) ==> wf ((r^+)^-1)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   170
  apply (subst trancl_converse [symmetric])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   171
  apply (erule wf_trancl)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   172
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   173
33216
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   174
text {* Well-foundedness of subsets *}
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   175
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   176
lemma wf_subset: "[| wf(r);  p<=r |] ==> wf(p)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   177
  apply (simp (no_asm_use) add: wf_eq_minimal)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   178
  apply fast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   179
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   180
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   181
lemmas wfP_subset = wf_subset [to_pred]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   182
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   183
text {* Well-foundedness of the empty relation *}
33216
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   184
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   185
lemma wf_empty [iff]: "wf {}"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   186
  by (simp add: wf_def)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   187
32205
49db434c157f explicit is better than implicit
haftmann
parents: 31775
diff changeset
   188
lemma wfP_empty [iff]:
49db434c157f explicit is better than implicit
haftmann
parents: 31775
diff changeset
   189
  "wfP (\<lambda>x y. False)"
49db434c157f explicit is better than implicit
haftmann
parents: 31775
diff changeset
   190
proof -
49db434c157f explicit is better than implicit
haftmann
parents: 31775
diff changeset
   191
  have "wfP bot" by (fact wf_empty [to_pred bot_empty_eq2])
44921
58eef4843641 tuned proofs
huffman
parents: 44144
diff changeset
   192
  then show ?thesis by (simp add: bot_fun_def)
32205
49db434c157f explicit is better than implicit
haftmann
parents: 31775
diff changeset
   193
qed
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   194
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   195
lemma wf_Int1: "wf r ==> wf (r Int r')"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   196
  apply (erule wf_subset)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   197
  apply (rule Int_lower1)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   198
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   199
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   200
lemma wf_Int2: "wf r ==> wf (r' Int r)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   201
  apply (erule wf_subset)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   202
  apply (rule Int_lower2)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   203
  done  
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   204
33216
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   205
text {* Exponentiation *}
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   206
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   207
lemma wf_exp:
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   208
  assumes "wf (R ^^ n)"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   209
  shows "wf R"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   210
proof (rule wfI_pf)
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   211
  fix A assume "A \<subseteq> R `` A"
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   212
  then have "A \<subseteq> (R ^^ n) `` A" by (induct n) force+
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   213
  with `wf (R ^^ n)`
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   214
  show "A = {}" by (rule wfE_pf)
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   215
qed
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   216
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   217
text {* Well-foundedness of insert *}
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   218
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   219
lemma wf_insert [iff]: "wf(insert (y,x) r) = (wf(r) & (x,y) ~: r^*)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   220
apply (rule iffI)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   221
 apply (blast elim: wf_trancl [THEN wf_irrefl]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   222
              intro: rtrancl_into_trancl1 wf_subset 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   223
                     rtrancl_mono [THEN [2] rev_subsetD])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   224
apply (simp add: wf_eq_minimal, safe)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   225
apply (rule allE, assumption, erule impE, blast) 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   226
apply (erule bexE)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   227
apply (rename_tac "a", case_tac "a = x")
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   228
 prefer 2
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   229
apply blast 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   230
apply (case_tac "y:Q")
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   231
 prefer 2 apply blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   232
apply (rule_tac x = "{z. z:Q & (z,y) : r^*}" in allE)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   233
 apply assumption
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   234
apply (erule_tac V = "ALL Q. (EX x. x : Q) --> ?P Q" in thin_rl) 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   235
  --{*essential for speed*}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   236
txt{*Blast with new substOccur fails*}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   237
apply (fast intro: converse_rtrancl_into_rtrancl)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   238
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   239
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   240
text{*Well-foundedness of image*}
33216
7c61bc5d7310 point-free characterization of well-foundedness
krauss
parents: 33215
diff changeset
   241
40607
30d512bf47a7 map_pair replaces prod_fun
haftmann
parents: 39302
diff changeset
   242
lemma wf_map_pair_image: "[| wf r; inj f |] ==> wf(map_pair f f ` r)"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   243
apply (simp only: wf_eq_minimal, clarify)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   244
apply (case_tac "EX p. f p : Q")
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   245
apply (erule_tac x = "{p. f p : Q}" in allE)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   246
apply (fast dest: inj_onD, blast)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   247
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   248
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   249
26976
cf147f69b3df rearranged subsections
krauss
parents: 26803
diff changeset
   250
subsection {* Well-Foundedness Results for Unions *}
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   251
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   252
lemma wf_union_compatible:
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   253
  assumes "wf R" "wf S"
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32205
diff changeset
   254
  assumes "R O S \<subseteq> R"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   255
  shows "wf (R \<union> S)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   256
proof (rule wfI_min)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   257
  fix x :: 'a and Q 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   258
  let ?Q' = "{x \<in> Q. \<forall>y. (y, x) \<in> R \<longrightarrow> y \<notin> Q}"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   259
  assume "x \<in> Q"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   260
  obtain a where "a \<in> ?Q'"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   261
    by (rule wfE_min [OF `wf R` `x \<in> Q`]) blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   262
  with `wf S`
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   263
  obtain z where "z \<in> ?Q'" and zmin: "\<And>y. (y, z) \<in> S \<Longrightarrow> y \<notin> ?Q'" by (erule wfE_min)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   264
  { 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   265
    fix y assume "(y, z) \<in> S"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   266
    then have "y \<notin> ?Q'" by (rule zmin)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   267
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   268
    have "y \<notin> Q"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   269
    proof 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   270
      assume "y \<in> Q"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   271
      with `y \<notin> ?Q'` 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   272
      obtain w where "(w, y) \<in> R" and "w \<in> Q" by auto
47433
07f4bf913230 renamed "rel_comp" to "relcomp" (to be consistent with, e.g., "relpow")
griff
parents: 46883
diff changeset
   273
      from `(w, y) \<in> R` `(y, z) \<in> S` have "(w, z) \<in> R O S" by (rule relcompI)
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32205
diff changeset
   274
      with `R O S \<subseteq> R` have "(w, z) \<in> R" ..
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   275
      with `z \<in> ?Q'` have "w \<notin> Q" by blast 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   276
      with `w \<in> Q` show False by contradiction
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   277
    qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   278
  }
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   279
  with `z \<in> ?Q'` show "\<exists>z\<in>Q. \<forall>y. (y, z) \<in> R \<union> S \<longrightarrow> y \<notin> Q" by blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   280
qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   281
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   282
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   283
text {* Well-foundedness of indexed union with disjoint domains and ranges *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   284
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   285
lemma wf_UN: "[| ALL i:I. wf(r i);  
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   286
         ALL i:I. ALL j:I. r i ~= r j --> Domain(r i) Int Range(r j) = {}  
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   287
      |] ==> wf(UN i:I. r i)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   288
apply (simp only: wf_eq_minimal, clarify)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   289
apply (rename_tac A a, case_tac "EX i:I. EX a:A. EX b:A. (b,a) : r i")
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   290
 prefer 2
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   291
 apply force 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   292
apply clarify
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   293
apply (drule bspec, assumption)  
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   294
apply (erule_tac x="{a. a:A & (EX b:A. (b,a) : r i) }" in allE)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   295
apply (blast elim!: allE)  
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   296
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   297
32263
8bc0fd4a23a0 explicit is better than implicit
haftmann
parents: 32244
diff changeset
   298
lemma wfP_SUP:
8bc0fd4a23a0 explicit is better than implicit
haftmann
parents: 32244
diff changeset
   299
  "\<forall>i. wfP (r i) \<Longrightarrow> \<forall>i j. r i \<noteq> r j \<longrightarrow> inf (DomainP (r i)) (RangeP (r j)) = bot \<Longrightarrow> wfP (SUPR UNIV r)"
46883
eec472dae593 tuned pred_set_conv lemmas. Skipped lemmas changing the lemmas generated by inductive_set
noschinl
parents: 46882
diff changeset
   300
  apply (rule wf_UN[to_pred])
46882
6242b4bc05bc tuned simpset
noschinl
parents: 46664
diff changeset
   301
  apply simp_all
45970
b6d0cff57d96 adjusted to set/pred distinction by means of type constructor `set`
haftmann
parents: 45139
diff changeset
   302
  done
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   303
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   304
lemma wf_Union: 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   305
 "[| ALL r:R. wf r;  
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   306
     ALL r:R. ALL s:R. r ~= s --> Domain r Int Range s = {}  
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   307
  |] ==> wf(Union R)"
44937
22c0857b8aab removed further legacy rules from Complete_Lattices
hoelzl
parents: 44921
diff changeset
   308
  using wf_UN[of R "\<lambda>i. i"] by (simp add: SUP_def)
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   309
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   310
(*Intuition: we find an (R u S)-min element of a nonempty subset A
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   311
             by case distinction.
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   312
  1. There is a step a -R-> b with a,b : A.
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   313
     Pick an R-min element z of the (nonempty) set {a:A | EX b:A. a -R-> b}.
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   314
     By definition, there is z':A s.t. z -R-> z'. Because z is R-min in the
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   315
     subset, z' must be R-min in A. Because z' has an R-predecessor, it cannot
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   316
     have an S-successor and is thus S-min in A as well.
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   317
  2. There is no such step.
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   318
     Pick an S-min element of A. In this case it must be an R-min
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   319
     element of A as well.
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   320
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   321
*)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   322
lemma wf_Un:
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   323
     "[| wf r; wf s; Domain r Int Range s = {} |] ==> wf(r Un s)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   324
  using wf_union_compatible[of s r] 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   325
  by (auto simp: Un_ac)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   326
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   327
lemma wf_union_merge: 
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32205
diff changeset
   328
  "wf (R \<union> S) = wf (R O R \<union> S O R \<union> S)" (is "wf ?A = wf ?B")
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   329
proof
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   330
  assume "wf ?A"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   331
  with wf_trancl have wfT: "wf (?A^+)" .
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   332
  moreover have "?B \<subseteq> ?A^+"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   333
    by (subst trancl_unfold, subst trancl_unfold) blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   334
  ultimately show "wf ?B" by (rule wf_subset)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   335
next
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   336
  assume "wf ?B"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   337
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   338
  show "wf ?A"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   339
  proof (rule wfI_min)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   340
    fix Q :: "'a set" and x 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   341
    assume "x \<in> Q"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   342
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   343
    with `wf ?B`
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   344
    obtain z where "z \<in> Q" and "\<And>y. (y, z) \<in> ?B \<Longrightarrow> y \<notin> Q" 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   345
      by (erule wfE_min)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   346
    then have A1: "\<And>y. (y, z) \<in> R O R \<Longrightarrow> y \<notin> Q"
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32205
diff changeset
   347
      and A2: "\<And>y. (y, z) \<in> S O R \<Longrightarrow> y \<notin> Q"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   348
      and A3: "\<And>y. (y, z) \<in> S \<Longrightarrow> y \<notin> Q"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   349
      by auto
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   350
    
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   351
    show "\<exists>z\<in>Q. \<forall>y. (y, z) \<in> ?A \<longrightarrow> y \<notin> Q"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   352
    proof (cases "\<forall>y. (y, z) \<in> R \<longrightarrow> y \<notin> Q")
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   353
      case True
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   354
      with `z \<in> Q` A3 show ?thesis by blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   355
    next
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   356
      case False 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   357
      then obtain z' where "z'\<in>Q" "(z', z) \<in> R" by blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   358
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   359
      have "\<forall>y. (y, z') \<in> ?A \<longrightarrow> y \<notin> Q"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   360
      proof (intro allI impI)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   361
        fix y assume "(y, z') \<in> ?A"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   362
        then show "y \<notin> Q"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   363
        proof
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   364
          assume "(y, z') \<in> R" 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   365
          then have "(y, z) \<in> R O R" using `(z', z) \<in> R` ..
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   366
          with A1 show "y \<notin> Q" .
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   367
        next
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   368
          assume "(y, z') \<in> S" 
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32205
diff changeset
   369
          then have "(y, z) \<in> S O R" using  `(z', z) \<in> R` ..
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   370
          with A2 show "y \<notin> Q" .
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   371
        qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   372
      qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   373
      with `z' \<in> Q` show ?thesis ..
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   374
    qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   375
  qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   376
qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   377
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   378
lemma wf_comp_self: "wf R = wf (R O R)"  -- {* special case *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   379
  by (rule wf_union_merge [where S = "{}", simplified])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   380
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   381
33217
ab979f6e99f4 authentic constants; moved "acyclic" further down
krauss
parents: 33216
diff changeset
   382
subsection {* Acyclic relations *}
ab979f6e99f4 authentic constants; moved "acyclic" further down
krauss
parents: 33216
diff changeset
   383
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   384
lemma wf_acyclic: "wf r ==> acyclic r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   385
apply (simp add: acyclic_def)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   386
apply (blast elim: wf_trancl [THEN wf_irrefl])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   387
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   388
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   389
lemmas wfP_acyclicP = wf_acyclic [to_pred]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   390
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   391
text{* Wellfoundedness of finite acyclic relations*}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   392
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   393
lemma finite_acyclic_wf [rule_format]: "finite r ==> acyclic r --> wf r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   394
apply (erule finite_induct, blast)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   395
apply (simp (no_asm_simp) only: split_tupled_all)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   396
apply simp
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   397
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   398
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   399
lemma finite_acyclic_wf_converse: "[|finite r; acyclic r|] ==> wf (r^-1)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   400
apply (erule finite_converse [THEN iffD2, THEN finite_acyclic_wf])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   401
apply (erule acyclic_converse [THEN iffD2])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   402
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   403
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   404
lemma wf_iff_acyclic_if_finite: "finite r ==> wf r = acyclic r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   405
by (blast intro: finite_acyclic_wf wf_acyclic)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   406
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   407
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   408
subsection {* @{typ nat} is well-founded *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   409
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   410
lemma less_nat_rel: "op < = (\<lambda>m n. n = Suc m)^++"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   411
proof (rule ext, rule ext, rule iffI)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   412
  fix n m :: nat
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   413
  assume "m < n"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   414
  then show "(\<lambda>m n. n = Suc m)^++ m n"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   415
  proof (induct n)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   416
    case 0 then show ?case by auto
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   417
  next
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   418
    case (Suc n) then show ?case
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   419
      by (auto simp add: less_Suc_eq_le le_less intro: tranclp.trancl_into_trancl)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   420
  qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   421
next
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   422
  fix n m :: nat
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   423
  assume "(\<lambda>m n. n = Suc m)^++ m n"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   424
  then show "m < n"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   425
    by (induct n)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   426
      (simp_all add: less_Suc_eq_le reflexive le_less)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   427
qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   428
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   429
definition
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   430
  pred_nat :: "(nat * nat) set" where
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   431
  "pred_nat = {(m, n). n = Suc m}"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   432
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   433
definition
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   434
  less_than :: "(nat * nat) set" where
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   435
  "less_than = pred_nat^+"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   436
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   437
lemma less_eq: "(m, n) \<in> pred_nat^+ \<longleftrightarrow> m < n"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   438
  unfolding less_nat_rel pred_nat_def trancl_def by simp
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   439
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   440
lemma pred_nat_trancl_eq_le:
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   441
  "(m, n) \<in> pred_nat^* \<longleftrightarrow> m \<le> n"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   442
  unfolding less_eq rtrancl_eq_or_trancl by auto
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   443
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   444
lemma wf_pred_nat: "wf pred_nat"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   445
  apply (unfold wf_def pred_nat_def, clarify)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   446
  apply (induct_tac x, blast+)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   447
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   448
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   449
lemma wf_less_than [iff]: "wf less_than"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   450
  by (simp add: less_than_def wf_pred_nat [THEN wf_trancl])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   451
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   452
lemma trans_less_than [iff]: "trans less_than"
35216
7641e8d831d2 get rid of many duplicate simp rule warnings
huffman
parents: 33217
diff changeset
   453
  by (simp add: less_than_def)
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   454
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   455
lemma less_than_iff [iff]: "((x,y): less_than) = (x<y)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   456
  by (simp add: less_than_def less_eq)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   457
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   458
lemma wf_less: "wf {(x, y::nat). x < y}"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   459
  using wf_less_than by (simp add: less_than_def less_eq [symmetric])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   460
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   461
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   462
subsection {* Accessible Part *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   463
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   464
text {*
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   465
 Inductive definition of the accessible part @{term "acc r"} of a
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   466
 relation; see also \cite{paulin-tlca}.
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   467
*}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   468
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   469
inductive_set
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   470
  acc :: "('a * 'a) set => 'a set"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   471
  for r :: "('a * 'a) set"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   472
  where
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   473
    accI: "(!!y. (y, x) : r ==> y : acc r) ==> x : acc r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   474
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   475
abbreviation
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   476
  termip :: "('a => 'a => bool) => 'a => bool" where
45137
6e422d180de8 modernized definitions
haftmann
parents: 45012
diff changeset
   477
  "termip r \<equiv> accp (r\<inverse>\<inverse>)"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   478
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   479
abbreviation
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   480
  termi :: "('a * 'a) set => 'a set" where
45137
6e422d180de8 modernized definitions
haftmann
parents: 45012
diff changeset
   481
  "termi r \<equiv> acc (r\<inverse>)"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   482
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   483
lemmas accpI = accp.accI
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   484
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   485
text {* Induction rules *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   486
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   487
theorem accp_induct:
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   488
  assumes major: "accp r a"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   489
  assumes hyp: "!!x. accp r x ==> \<forall>y. r y x --> P y ==> P x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   490
  shows "P a"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   491
  apply (rule major [THEN accp.induct])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   492
  apply (rule hyp)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   493
   apply (rule accp.accI)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   494
   apply fast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   495
  apply fast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   496
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   497
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   498
theorems accp_induct_rule = accp_induct [rule_format, induct set: accp]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   499
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   500
theorem accp_downward: "accp r b ==> r a b ==> accp r a"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   501
  apply (erule accp.cases)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   502
  apply fast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   503
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   504
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   505
lemma not_accp_down:
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   506
  assumes na: "\<not> accp R x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   507
  obtains z where "R z x" and "\<not> accp R z"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   508
proof -
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   509
  assume a: "\<And>z. \<lbrakk>R z x; \<not> accp R z\<rbrakk> \<Longrightarrow> thesis"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   510
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   511
  show thesis
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   512
  proof (cases "\<forall>z. R z x \<longrightarrow> accp R z")
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   513
    case True
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   514
    hence "\<And>z. R z x \<Longrightarrow> accp R z" by auto
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   515
    hence "accp R x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   516
      by (rule accp.accI)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   517
    with na show thesis ..
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   518
  next
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   519
    case False then obtain z where "R z x" and "\<not> accp R z"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   520
      by auto
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   521
    with a show thesis .
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   522
  qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   523
qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   524
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   525
lemma accp_downwards_aux: "r\<^sup>*\<^sup>* b a ==> accp r a --> accp r b"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   526
  apply (erule rtranclp_induct)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   527
   apply blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   528
  apply (blast dest: accp_downward)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   529
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   530
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   531
theorem accp_downwards: "accp r a ==> r\<^sup>*\<^sup>* b a ==> accp r b"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   532
  apply (blast dest: accp_downwards_aux)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   533
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   534
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   535
theorem accp_wfPI: "\<forall>x. accp r x ==> wfP r"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   536
  apply (rule wfPUNIVI)
44921
58eef4843641 tuned proofs
huffman
parents: 44144
diff changeset
   537
  apply (rule_tac P=P in accp_induct)
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   538
   apply blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   539
  apply blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   540
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   541
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   542
theorem accp_wfPD: "wfP r ==> accp r x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   543
  apply (erule wfP_induct_rule)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   544
  apply (rule accp.accI)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   545
  apply blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   546
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   547
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   548
theorem wfP_accp_iff: "wfP r = (\<forall>x. accp r x)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   549
  apply (blast intro: accp_wfPI dest: accp_wfPD)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   550
  done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   551
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   552
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   553
text {* Smaller relations have bigger accessible parts: *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   554
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   555
lemma accp_subset:
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   556
  assumes sub: "R1 \<le> R2"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   557
  shows "accp R2 \<le> accp R1"
26803
0af0f674845d - Explicitely passed pred_subset_eq and pred_equals_eq as an argument to the
berghofe
parents: 26748
diff changeset
   558
proof (rule predicate1I)
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   559
  fix x assume "accp R2 x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   560
  then show "accp R1 x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   561
  proof (induct x)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   562
    fix x
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   563
    assume ih: "\<And>y. R2 y x \<Longrightarrow> accp R1 y"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   564
    with sub show "accp R1 x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   565
      by (blast intro: accp.accI)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   566
  qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   567
qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   568
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   569
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   570
text {* This is a generalized induction theorem that works on
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   571
  subsets of the accessible part. *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   572
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   573
lemma accp_subset_induct:
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   574
  assumes subset: "D \<le> accp R"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   575
    and dcl: "\<And>x z. \<lbrakk>D x; R z x\<rbrakk> \<Longrightarrow> D z"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   576
    and "D x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   577
    and istep: "\<And>x. \<lbrakk>D x; (\<And>z. R z x \<Longrightarrow> P z)\<rbrakk> \<Longrightarrow> P x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   578
  shows "P x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   579
proof -
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   580
  from subset and `D x`
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   581
  have "accp R x" ..
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   582
  then show "P x" using `D x`
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   583
  proof (induct x)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   584
    fix x
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   585
    assume "D x"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   586
      and "\<And>y. R y x \<Longrightarrow> D y \<Longrightarrow> P y"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   587
    with dcl and istep show "P x" by blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   588
  qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   589
qed
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   590
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   591
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   592
text {* Set versions of the above theorems *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   593
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   594
lemmas acc_induct = accp_induct [to_set]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   595
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   596
lemmas acc_induct_rule = acc_induct [rule_format, induct set: acc]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   597
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   598
lemmas acc_downward = accp_downward [to_set]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   599
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   600
lemmas not_acc_down = not_accp_down [to_set]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   601
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   602
lemmas acc_downwards_aux = accp_downwards_aux [to_set]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   603
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   604
lemmas acc_downwards = accp_downwards [to_set]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   605
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   606
lemmas acc_wfI = accp_wfPI [to_set]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   607
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   608
lemmas acc_wfD = accp_wfPD [to_set]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   609
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   610
lemmas wf_acc_iff = wfP_accp_iff [to_set]
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   611
46177
adac34829e10 pred_subset_eq and SUP_UN_eq2 are now standard pred_set_conv rules
berghofe
parents: 45970
diff changeset
   612
lemmas acc_subset = accp_subset [to_set]
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   613
46177
adac34829e10 pred_subset_eq and SUP_UN_eq2 are now standard pred_set_conv rules
berghofe
parents: 45970
diff changeset
   614
lemmas acc_subset_induct = accp_subset_induct [to_set]
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   615
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   616
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   617
subsection {* Tools for building wellfounded relations *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   618
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   619
text {* Inverse Image *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   620
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   621
lemma wf_inv_image [simp,intro!]: "wf(r) ==> wf(inv_image r (f::'a=>'b))"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   622
apply (simp (no_asm_use) add: inv_image_def wf_eq_minimal)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   623
apply clarify
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   624
apply (subgoal_tac "EX (w::'b) . w : {w. EX (x::'a) . x: Q & (f x = w) }")
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   625
prefer 2 apply (blast del: allE)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   626
apply (erule allE)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   627
apply (erule (1) notE impE)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   628
apply blast
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   629
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   630
36664
6302f9ad7047 repaired comments where SOMEthing went utterly wrong (cf. 2b04504fcb69)
krauss
parents: 36635
diff changeset
   631
text {* Measure functions into @{typ nat} *}
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   632
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   633
definition measure :: "('a => nat) => ('a * 'a)set"
45137
6e422d180de8 modernized definitions
haftmann
parents: 45012
diff changeset
   634
where "measure = inv_image less_than"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   635
46356
48fcca8965f4 adding code_unfold to make measure executable
bulwahn
parents: 46349
diff changeset
   636
lemma in_measure[simp, code_unfold]: "((x,y) : measure f) = (f x < f y)"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   637
  by (simp add:measure_def)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   638
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   639
lemma wf_measure [iff]: "wf (measure f)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   640
apply (unfold measure_def)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   641
apply (rule wf_less_than [THEN wf_inv_image])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   642
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   643
41720
f749155883d7 added termination lemmas
nipkow
parents: 41075
diff changeset
   644
lemma wf_if_measure: fixes f :: "'a \<Rightarrow> nat"
f749155883d7 added termination lemmas
nipkow
parents: 41075
diff changeset
   645
shows "(!!x. P x \<Longrightarrow> f(g x) < f x) \<Longrightarrow> wf {(y,x). P x \<and> y = g x}"
f749155883d7 added termination lemmas
nipkow
parents: 41075
diff changeset
   646
apply(insert wf_measure[of f])
f749155883d7 added termination lemmas
nipkow
parents: 41075
diff changeset
   647
apply(simp only: measure_def inv_image_def less_than_def less_eq)
f749155883d7 added termination lemmas
nipkow
parents: 41075
diff changeset
   648
apply(erule wf_subset)
f749155883d7 added termination lemmas
nipkow
parents: 41075
diff changeset
   649
apply auto
f749155883d7 added termination lemmas
nipkow
parents: 41075
diff changeset
   650
done
f749155883d7 added termination lemmas
nipkow
parents: 41075
diff changeset
   651
f749155883d7 added termination lemmas
nipkow
parents: 41075
diff changeset
   652
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   653
text{* Lexicographic combinations *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   654
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 37407
diff changeset
   655
definition lex_prod :: "('a \<times>'a) set \<Rightarrow> ('b \<times> 'b) set \<Rightarrow> (('a \<times> 'b) \<times> ('a \<times> 'b)) set" (infixr "<*lex*>" 80) where
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 37407
diff changeset
   656
  "ra <*lex*> rb = {((a, b), (a', b')). (a, a') \<in> ra \<or> a = a' \<and> (b, b') \<in> rb}"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   657
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   658
lemma wf_lex_prod [intro!]: "[| wf(ra); wf(rb) |] ==> wf(ra <*lex*> rb)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   659
apply (unfold wf_def lex_prod_def) 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   660
apply (rule allI, rule impI)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   661
apply (simp (no_asm_use) only: split_paired_All)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   662
apply (drule spec, erule mp) 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   663
apply (rule allI, rule impI)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   664
apply (drule spec, erule mp, blast) 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   665
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   666
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   667
lemma in_lex_prod[simp]: 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   668
  "(((a,b),(a',b')): r <*lex*> s) = ((a,a'): r \<or> (a = a' \<and> (b, b') : s))"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   669
  by (auto simp:lex_prod_def)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   670
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   671
text{* @{term "op <*lex*>"} preserves transitivity *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   672
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   673
lemma trans_lex_prod [intro!]: 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   674
    "[| trans R1; trans R2 |] ==> trans (R1 <*lex*> R2)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   675
by (unfold trans_def lex_prod_def, blast) 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   676
36664
6302f9ad7047 repaired comments where SOMEthing went utterly wrong (cf. 2b04504fcb69)
krauss
parents: 36635
diff changeset
   677
text {* lexicographic combinations with measure functions *}
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   678
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   679
definition 
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   680
  mlex_prod :: "('a \<Rightarrow> nat) \<Rightarrow> ('a \<times> 'a) set \<Rightarrow> ('a \<times> 'a) set" (infixr "<*mlex*>" 80)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   681
where
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   682
  "f <*mlex*> R = inv_image (less_than <*lex*> R) (%x. (f x, x))"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   683
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   684
lemma wf_mlex: "wf R \<Longrightarrow> wf (f <*mlex*> R)"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   685
unfolding mlex_prod_def
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   686
by auto
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   687
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   688
lemma mlex_less: "f x < f y \<Longrightarrow> (x, y) \<in> f <*mlex*> R"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   689
unfolding mlex_prod_def by simp
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   690
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   691
lemma mlex_leq: "f x \<le> f y \<Longrightarrow> (x, y) \<in> R \<Longrightarrow> (x, y) \<in> f <*mlex*> R"
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   692
unfolding mlex_prod_def by auto
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   693
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   694
text {* proper subset relation on finite sets *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   695
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   696
definition finite_psubset  :: "('a set * 'a set) set"
45137
6e422d180de8 modernized definitions
haftmann
parents: 45012
diff changeset
   697
where "finite_psubset = {(A,B). A < B & finite B}"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   698
28260
703046c93ffe wf_finite_psubset[simp], in_finite_psubset[simp]
krauss
parents: 27823
diff changeset
   699
lemma wf_finite_psubset[simp]: "wf(finite_psubset)"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   700
apply (unfold finite_psubset_def)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   701
apply (rule wf_measure [THEN wf_subset])
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   702
apply (simp add: measure_def inv_image_def less_than_def less_eq)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   703
apply (fast elim!: psubset_card_mono)
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   704
done
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   705
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   706
lemma trans_finite_psubset: "trans finite_psubset"
26803
0af0f674845d - Explicitely passed pred_subset_eq and pred_equals_eq as an argument to the
berghofe
parents: 26748
diff changeset
   707
by (simp add: finite_psubset_def less_le trans_def, blast)
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   708
28260
703046c93ffe wf_finite_psubset[simp], in_finite_psubset[simp]
krauss
parents: 27823
diff changeset
   709
lemma in_finite_psubset[simp]: "(A, B) \<in> finite_psubset = (A < B & finite B)"
703046c93ffe wf_finite_psubset[simp], in_finite_psubset[simp]
krauss
parents: 27823
diff changeset
   710
unfolding finite_psubset_def by auto
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   711
28735
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   712
text {* max- and min-extension of order to finite sets *}
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   713
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   714
inductive_set max_ext :: "('a \<times> 'a) set \<Rightarrow> ('a set \<times> 'a set) set" 
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   715
for R :: "('a \<times> 'a) set"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   716
where
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   717
  max_extI[intro]: "finite X \<Longrightarrow> finite Y \<Longrightarrow> Y \<noteq> {} \<Longrightarrow> (\<And>x. x \<in> X \<Longrightarrow> \<exists>y\<in>Y. (x, y) \<in> R) \<Longrightarrow> (X, Y) \<in> max_ext R"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   718
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   719
lemma max_ext_wf:
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   720
  assumes wf: "wf r"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   721
  shows "wf (max_ext r)"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   722
proof (rule acc_wfI, intro allI)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   723
  fix M show "M \<in> acc (max_ext r)" (is "_ \<in> ?W")
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   724
  proof cases
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   725
    assume "finite M"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   726
    thus ?thesis
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   727
    proof (induct M)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   728
      show "{} \<in> ?W"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   729
        by (rule accI) (auto elim: max_ext.cases)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   730
    next
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   731
      fix M a assume "M \<in> ?W" "finite M"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   732
      with wf show "insert a M \<in> ?W"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   733
      proof (induct arbitrary: M)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   734
        fix M a
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   735
        assume "M \<in> ?W"  and  [intro]: "finite M"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   736
        assume hyp: "\<And>b M. (b, a) \<in> r \<Longrightarrow> M \<in> ?W \<Longrightarrow> finite M \<Longrightarrow> insert b M \<in> ?W"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   737
        {
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   738
          fix N M :: "'a set"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   739
          assume "finite N" "finite M"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   740
          then
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   741
          have "\<lbrakk>M \<in> ?W ; (\<And>y. y \<in> N \<Longrightarrow> (y, a) \<in> r)\<rbrakk> \<Longrightarrow>  N \<union> M \<in> ?W"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   742
            by (induct N arbitrary: M) (auto simp: hyp)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   743
        }
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   744
        note add_less = this
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   745
        
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   746
        show "insert a M \<in> ?W"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   747
        proof (rule accI)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   748
          fix N assume Nless: "(N, insert a M) \<in> max_ext r"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   749
          hence asm1: "\<And>x. x \<in> N \<Longrightarrow> (x, a) \<in> r \<or> (\<exists>y \<in> M. (x, y) \<in> r)"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   750
            by (auto elim!: max_ext.cases)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   751
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   752
          let ?N1 = "{ n \<in> N. (n, a) \<in> r }"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   753
          let ?N2 = "{ n \<in> N. (n, a) \<notin> r }"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 37767
diff changeset
   754
          have N: "?N1 \<union> ?N2 = N" by (rule set_eqI) auto
28735
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   755
          from Nless have "finite N" by (auto elim: max_ext.cases)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   756
          then have finites: "finite ?N1" "finite ?N2" by auto
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   757
          
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   758
          have "?N2 \<in> ?W"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   759
          proof cases
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   760
            assume [simp]: "M = {}"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   761
            have Mw: "{} \<in> ?W" by (rule accI) (auto elim: max_ext.cases)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   762
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   763
            from asm1 have "?N2 = {}" by auto
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   764
            with Mw show "?N2 \<in> ?W" by (simp only:)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   765
          next
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   766
            assume "M \<noteq> {}"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   767
            have N2: "(?N2, M) \<in> max_ext r" 
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   768
              by (rule max_extI[OF _ _ `M \<noteq> {}`]) (insert asm1, auto intro: finites)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   769
            
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   770
            with `M \<in> ?W` show "?N2 \<in> ?W" by (rule acc_downward)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   771
          qed
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   772
          with finites have "?N1 \<union> ?N2 \<in> ?W" 
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   773
            by (rule add_less) simp
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   774
          then show "N \<in> ?W" by (simp only: N)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   775
        qed
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   776
      qed
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   777
    qed
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   778
  next
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   779
    assume [simp]: "\<not> finite M"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   780
    show ?thesis
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   781
      by (rule accI) (auto elim: max_ext.cases)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   782
  qed
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   783
qed
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   784
29125
d41182a8135c method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents: 28845
diff changeset
   785
lemma max_ext_additive: 
d41182a8135c method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents: 28845
diff changeset
   786
 "(A, B) \<in> max_ext R \<Longrightarrow> (C, D) \<in> max_ext R \<Longrightarrow>
d41182a8135c method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents: 28845
diff changeset
   787
  (A \<union> C, B \<union> D) \<in> max_ext R"
d41182a8135c method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents: 28845
diff changeset
   788
by (force elim!: max_ext.cases)
d41182a8135c method "sizechange" proves termination of functions; added more infrastructure for termination proofs
krauss
parents: 28845
diff changeset
   789
28735
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   790
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 37407
diff changeset
   791
definition min_ext :: "('a \<times> 'a) set \<Rightarrow> ('a set \<times> 'a set) set"  where
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 37407
diff changeset
   792
  "min_ext r = {(X, Y) | X Y. X \<noteq> {} \<and> (\<forall>y \<in> Y. (\<exists>x \<in> X. (x, y) \<in> r))}"
28735
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   793
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   794
lemma min_ext_wf:
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   795
  assumes "wf r"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   796
  shows "wf (min_ext r)"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   797
proof (rule wfI_min)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   798
  fix Q :: "'a set set"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   799
  fix x
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   800
  assume nonempty: "x \<in> Q"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   801
  show "\<exists>m \<in> Q. (\<forall> n. (n, m) \<in> min_ext r \<longrightarrow> n \<notin> Q)"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   802
  proof cases
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   803
    assume "Q = {{}}" thus ?thesis by (simp add: min_ext_def)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   804
  next
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   805
    assume "Q \<noteq> {{}}"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   806
    with nonempty
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   807
    obtain e x where "x \<in> Q" "e \<in> x" by force
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   808
    then have eU: "e \<in> \<Union>Q" by auto
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   809
    with `wf r` 
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   810
    obtain z where z: "z \<in> \<Union>Q" "\<And>y. (y, z) \<in> r \<Longrightarrow> y \<notin> \<Union>Q" 
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   811
      by (erule wfE_min)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   812
    from z obtain m where "m \<in> Q" "z \<in> m" by auto
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   813
    from `m \<in> Q`
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   814
    show ?thesis
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   815
    proof (rule, intro bexI allI impI)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   816
      fix n
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   817
      assume smaller: "(n, m) \<in> min_ext r"
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   818
      with `z \<in> m` obtain y where y: "y \<in> n" "(y, z) \<in> r" by (auto simp: min_ext_def)
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   819
      then show "n \<notin> Q" using z(2) by auto
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   820
    qed      
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   821
  qed
bed31381e6b6 min_ext/max_ext lifting wellfounded relations on finite sets. Preserves wf
krauss
parents: 28562
diff changeset
   822
qed
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   823
43137
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   824
text{* Bounded increase must terminate: *}
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   825
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   826
lemma wf_bounded_measure:
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   827
fixes ub :: "'a \<Rightarrow> nat" and f :: "'a \<Rightarrow> nat"
43140
504d72a39638 tuned lemmas
nipkow
parents: 43137
diff changeset
   828
assumes "!!a b. (b,a) : r \<Longrightarrow> ub b \<le> ub a & ub a \<ge> f b & f b > f a"
43137
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   829
shows "wf r"
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   830
apply(rule wf_subset[OF wf_measure[of "%a. ub a - f a"]])
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   831
apply (auto dest: assms)
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   832
done
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   833
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   834
lemma wf_bounded_set:
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   835
fixes ub :: "'a \<Rightarrow> 'b set" and f :: "'a \<Rightarrow> 'b set"
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   836
assumes "!!a b. (b,a) : r \<Longrightarrow>
43140
504d72a39638 tuned lemmas
nipkow
parents: 43137
diff changeset
   837
  finite(ub a) & ub b \<subseteq> ub a & ub a \<supseteq> f b & f b \<supset> f a"
43137
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   838
shows "wf r"
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   839
apply(rule wf_bounded_measure[of r "%a. card(ub a)" "%a. card(f a)"])
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   840
apply(drule assms)
43140
504d72a39638 tuned lemmas
nipkow
parents: 43137
diff changeset
   841
apply (blast intro: card_mono finite_subset psubset_card_mono dest: psubset_eq[THEN iffD2])
43137
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   842
done
32b888e1a170 new lemmas
nipkow
parents: 41720
diff changeset
   843
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   844
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   845
subsection {* size of a datatype value *}
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   846
48891
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 47433
diff changeset
   847
ML_file "Tools/Function/size.ML"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   848
setup Size.setup
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   849
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28524
diff changeset
   850
lemma size_bool [code]:
27823
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
   851
  "size (b\<Colon>bool) = 0" by (cases b) auto
52971512d1a2 moved class wellorder to theory Orderings
haftmann
parents: 26976
diff changeset
   852
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28524
diff changeset
   853
lemma nat_size [simp, code]: "size (n\<Colon>nat) = n"
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   854
  by (induct n) simp_all
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   855
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35727
diff changeset
   856
declare "prod.size" [no_atp]
26748
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   857
4d51ddd6aa5c Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
diff changeset
   858
end