src/HOL/Transitive_Closure.thy
author wenzelm
Sat, 07 Apr 2012 16:41:59 +0200
changeset 47389 e8552cba702d
parent 47202 69cee87927f0
child 47433 07f4bf913230
permissions -rw-r--r--
explicit checks stable_finished_theory/stable_command allow parallel asynchronous command transactions; tuned;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
10213
01c2744a3786 *** empty log message ***
nipkow
parents:
diff changeset
     1
(*  Title:      HOL/Transitive_Closure.thy
01c2744a3786 *** empty log message ***
nipkow
parents:
diff changeset
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
01c2744a3786 *** empty log message ***
nipkow
parents:
diff changeset
     3
    Copyright   1992  University of Cambridge
01c2744a3786 *** empty log message ***
nipkow
parents:
diff changeset
     4
*)
01c2744a3786 *** empty log message ***
nipkow
parents:
diff changeset
     5
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
     6
header {* Reflexive and Transitive closure of a relation *}
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
     7
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15096
diff changeset
     8
theory Transitive_Closure
46664
1f6c140f9c72 moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
haftmann
parents: 46638
diff changeset
     9
imports Relation
21589
1b02201d7195 simplified method setup;
wenzelm
parents: 21404
diff changeset
    10
uses "~~/src/Provers/trancl.ML"
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15096
diff changeset
    11
begin
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    12
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    13
text {*
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    14
  @{text rtrancl} is reflexive/transitive closure,
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    15
  @{text trancl} is transitive closure,
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    16
  @{text reflcl} is reflexive closure.
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    17
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    18
  These postfix operators have \emph{maximum priority}, forcing their
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    19
  operands to be atomic.
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    20
*}
10213
01c2744a3786 *** empty log message ***
nipkow
parents:
diff changeset
    21
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    22
inductive_set
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    23
  rtrancl :: "('a \<times> 'a) set \<Rightarrow> ('a \<times> 'a) set"   ("(_^*)" [1000] 999)
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    24
  for r :: "('a \<times> 'a) set"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
    25
where
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    26
    rtrancl_refl [intro!, Pure.intro!, simp]: "(a, a) : r^*"
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    27
  | rtrancl_into_rtrancl [Pure.intro]: "(a, b) : r^* ==> (b, c) : r ==> (a, c) : r^*"
11327
cd2c27a23df1 Transitive closure is now defined via "inductive".
berghofe
parents: 11115
diff changeset
    28
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    29
inductive_set
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    30
  trancl :: "('a \<times> 'a) set \<Rightarrow> ('a \<times> 'a) set"  ("(_^+)" [1000] 999)
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    31
  for r :: "('a \<times> 'a) set"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
    32
where
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    33
    r_into_trancl [intro, Pure.intro]: "(a, b) : r ==> (a, b) : r^+"
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    34
  | trancl_into_trancl [Pure.intro]: "(a, b) : r^+ ==> (b, c) : r ==> (a, c) : r^+"
13704
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
    35
41792
ff3cb0c418b7 renamed "nitpick\_def" to "nitpick_unfold" to reflect its new semantics
blanchet
parents: 39302
diff changeset
    36
declare rtrancl_def [nitpick_unfold del]
ff3cb0c418b7 renamed "nitpick\_def" to "nitpick_unfold" to reflect its new semantics
blanchet
parents: 39302
diff changeset
    37
        rtranclp_def [nitpick_unfold del]
ff3cb0c418b7 renamed "nitpick\_def" to "nitpick_unfold" to reflect its new semantics
blanchet
parents: 39302
diff changeset
    38
        trancl_def [nitpick_unfold del]
ff3cb0c418b7 renamed "nitpick\_def" to "nitpick_unfold" to reflect its new semantics
blanchet
parents: 39302
diff changeset
    39
        tranclp_def [nitpick_unfold del]
33878
85102f57b4a8 removed "nitpick_def" attributes from (r)trancl(p), since "Nitpick.thy" overrides these
blanchet
parents: 33656
diff changeset
    40
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    41
notation
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    42
  rtranclp  ("(_^**)" [1000] 1000) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    43
  tranclp  ("(_^++)" [1000] 1000)
10213
01c2744a3786 *** empty log message ***
nipkow
parents:
diff changeset
    44
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19623
diff changeset
    45
abbreviation
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    46
  reflclp :: "('a => 'a => bool) => 'a => 'a => bool"  ("(_^==)" [1000] 1000) where
45137
6e422d180de8 modernized definitions
haftmann
parents: 45116
diff changeset
    47
  "r^== \<equiv> sup r op ="
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
    48
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
    49
abbreviation
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    50
  reflcl :: "('a \<times> 'a) set => ('a \<times> 'a) set"  ("(_^=)" [1000] 999) where
45137
6e422d180de8 modernized definitions
haftmann
parents: 45116
diff changeset
    51
  "r^= \<equiv> r \<union> Id"
10213
01c2744a3786 *** empty log message ***
nipkow
parents:
diff changeset
    52
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20716
diff changeset
    53
notation (xsymbols)
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    54
  rtranclp  ("(_\<^sup>*\<^sup>*)" [1000] 1000) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    55
  tranclp  ("(_\<^sup>+\<^sup>+)" [1000] 1000) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    56
  reflclp  ("(_\<^sup>=\<^sup>=)" [1000] 1000) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    57
  rtrancl  ("(_\<^sup>*)" [1000] 999) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    58
  trancl  ("(_\<^sup>+)" [1000] 999) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    59
  reflcl  ("(_\<^sup>=)" [1000] 999)
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    60
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 20716
diff changeset
    61
notation (HTML output)
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    62
  rtranclp  ("(_\<^sup>*\<^sup>*)" [1000] 1000) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    63
  tranclp  ("(_\<^sup>+\<^sup>+)" [1000] 1000) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    64
  reflclp  ("(_\<^sup>=\<^sup>=)" [1000] 1000) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    65
  rtrancl  ("(_\<^sup>*)" [1000] 999) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    66
  trancl  ("(_\<^sup>+)" [1000] 999) and
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    67
  reflcl  ("(_\<^sup>=)" [1000] 999)
14565
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14404
diff changeset
    68
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    69
26271
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    70
subsection {* Reflexive closure *}
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    71
30198
922f944f03b2 name changes
nipkow
parents: 30107
diff changeset
    72
lemma refl_reflcl[simp]: "refl(r^=)"
922f944f03b2 name changes
nipkow
parents: 30107
diff changeset
    73
by(simp add:refl_on_def)
26271
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    74
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    75
lemma antisym_reflcl[simp]: "antisym(r^=) = antisym r"
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    76
by(simp add:antisym_def)
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    77
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    78
lemma trans_reflclI[simp]: "trans r \<Longrightarrow> trans(r^=)"
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    79
unfolding trans_def by blast
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    80
e324f8918c98 Added lemmas
nipkow
parents: 26179
diff changeset
    81
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    82
subsection {* Reflexive-transitive closure *}
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    83
32883
7cbd93dacef3 inf/sup1/2_iff are mere duplicates of underlying definitions: dropped
haftmann
parents: 32601
diff changeset
    84
lemma reflcl_set_eq [pred_set_conv]: "(sup (\<lambda>x y. (x, y) \<in> r) op =) = (\<lambda>x y. (x, y) \<in> r \<union> Id)"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
    85
  by (auto simp add: fun_eq_iff)
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
    86
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    87
lemma r_into_rtrancl [intro]: "!!p. p \<in> r ==> p \<in> r^*"
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    88
  -- {* @{text rtrancl} of @{text r} contains @{text r} *}
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    89
  apply (simp only: split_tupled_all)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    90
  apply (erule rtrancl_refl [THEN rtrancl_into_rtrancl])
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    91
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    92
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    93
lemma r_into_rtranclp [intro]: "r x y ==> r^** x y"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
    94
  -- {* @{text rtrancl} of @{text r} contains @{text r} *}
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    95
  by (erule rtranclp.rtrancl_refl [THEN rtranclp.rtrancl_into_rtrancl])
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
    96
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
    97
lemma rtranclp_mono: "r \<le> s ==> r^** \<le> s^**"
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
    98
  -- {* monotonicity of @{text rtrancl} *}
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
    99
  apply (rule predicate2I)
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   100
  apply (erule rtranclp.induct)
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   101
   apply (rule_tac [2] rtranclp.rtrancl_into_rtrancl, blast+)
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   102
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   103
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   104
lemmas rtrancl_mono = rtranclp_mono [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   105
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   106
theorem rtranclp_induct [consumes 1, case_names base step, induct set: rtranclp]:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   107
  assumes a: "r^** a b"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   108
    and cases: "P a" "!!y z. [| r^** a y; r y z; P y |] ==> P z"
34909
a799687944af Tuned some proofs; nicer case names for some of the induction / cases rules.
berghofe
parents: 33878
diff changeset
   109
  shows "P b" using a
a799687944af Tuned some proofs; nicer case names for some of the induction / cases rules.
berghofe
parents: 33878
diff changeset
   110
  by (induct x\<equiv>a b) (rule cases)+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   111
25425
9191942c4ead Removed some case_names and consumes attributes that are now no longer
berghofe
parents: 25295
diff changeset
   112
lemmas rtrancl_induct [induct set: rtrancl] = rtranclp_induct [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   113
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   114
lemmas rtranclp_induct2 =
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   115
  rtranclp_induct[of _ "(ax,ay)" "(bx,by)", split_rule,
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   116
                 consumes 1, case_names refl step]
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   117
14404
4952c5a92e04 Transitive_Closure: added consumes and case_names attributes
nipkow
parents: 14398
diff changeset
   118
lemmas rtrancl_induct2 =
4952c5a92e04 Transitive_Closure: added consumes and case_names attributes
nipkow
parents: 14398
diff changeset
   119
  rtrancl_induct[of "(ax,ay)" "(bx,by)", split_format (complete),
4952c5a92e04 Transitive_Closure: added consumes and case_names attributes
nipkow
parents: 14398
diff changeset
   120
                 consumes 1, case_names refl step]
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   121
30198
922f944f03b2 name changes
nipkow
parents: 30107
diff changeset
   122
lemma refl_rtrancl: "refl (r^*)"
922f944f03b2 name changes
nipkow
parents: 30107
diff changeset
   123
by (unfold refl_on_def) fast
19228
30fce6da8cbe added many simple lemmas
huffman
parents: 18372
diff changeset
   124
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   125
text {* Transitivity of transitive closure. *}
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   126
lemma trans_rtrancl: "trans (r^*)"
12823
9d3f5056296b Made some proofs constructive.
berghofe
parents: 12691
diff changeset
   127
proof (rule transI)
9d3f5056296b Made some proofs constructive.
berghofe
parents: 12691
diff changeset
   128
  fix x y z
9d3f5056296b Made some proofs constructive.
berghofe
parents: 12691
diff changeset
   129
  assume "(x, y) \<in> r\<^sup>*"
9d3f5056296b Made some proofs constructive.
berghofe
parents: 12691
diff changeset
   130
  assume "(y, z) \<in> r\<^sup>*"
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   131
  then show "(x, z) \<in> r\<^sup>*"
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   132
  proof induct
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   133
    case base
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   134
    show "(x, y) \<in> r\<^sup>*" by fact
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   135
  next
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   136
    case (step u v)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   137
    from `(x, u) \<in> r\<^sup>*` and `(u, v) \<in> r`
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   138
    show "(x, v) \<in> r\<^sup>*" ..
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   139
  qed
12823
9d3f5056296b Made some proofs constructive.
berghofe
parents: 12691
diff changeset
   140
qed
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   141
45607
16b4f5774621 eliminated obsolete "standard";
wenzelm
parents: 45153
diff changeset
   142
lemmas rtrancl_trans = trans_rtrancl [THEN transD]
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   143
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   144
lemma rtranclp_trans:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   145
  assumes xy: "r^** x y"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   146
  and yz: "r^** y z"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   147
  shows "r^** x z" using yz xy
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   148
  by induct iprover+
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   149
26174
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   150
lemma rtranclE [cases set: rtrancl]:
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   151
  assumes major: "(a::'a, b) : r^*"
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   152
  obtains
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   153
    (base) "a = b"
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   154
  | (step) y where "(a, y) : r^*" and "(y, b) : r"
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   155
  -- {* elimination of @{text rtrancl} -- by induction on a special formula *}
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   156
  apply (subgoal_tac "(a::'a) = b | (EX y. (a,y) : r^* & (y,b) : r)")
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   157
   apply (rule_tac [2] major [THEN rtrancl_induct])
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   158
    prefer 2 apply blast
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   159
   prefer 2 apply blast
26174
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   160
  apply (erule asm_rl exE disjE conjE base step)+
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   161
  done
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   162
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32215
diff changeset
   163
lemma rtrancl_Int_subset: "[| Id \<subseteq> s; (r^* \<inter> s) O r \<subseteq> s|] ==> r^* \<subseteq> s"
22080
7bf8868ab3e4 induction rules for trancl/rtrancl expressed using subsets
paulson
parents: 21589
diff changeset
   164
  apply (rule subsetI)
7bf8868ab3e4 induction rules for trancl/rtrancl expressed using subsets
paulson
parents: 21589
diff changeset
   165
  apply (rule_tac p="x" in PairE, clarify)
7bf8868ab3e4 induction rules for trancl/rtrancl expressed using subsets
paulson
parents: 21589
diff changeset
   166
  apply (erule rtrancl_induct, auto) 
7bf8868ab3e4 induction rules for trancl/rtrancl expressed using subsets
paulson
parents: 21589
diff changeset
   167
  done
7bf8868ab3e4 induction rules for trancl/rtrancl expressed using subsets
paulson
parents: 21589
diff changeset
   168
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   169
lemma converse_rtranclp_into_rtranclp:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   170
  "r a b \<Longrightarrow> r\<^sup>*\<^sup>* b c \<Longrightarrow> r\<^sup>*\<^sup>* a c"
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   171
  by (rule rtranclp_trans) iprover+
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   172
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   173
lemmas converse_rtrancl_into_rtrancl = converse_rtranclp_into_rtranclp [to_set]
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   174
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   175
text {*
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   176
  \medskip More @{term "r^*"} equations and inclusions.
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   177
*}
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   178
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   179
lemma rtranclp_idemp [simp]: "(r^**)^** = r^**"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   180
  apply (auto intro!: order_antisym)
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   181
  apply (erule rtranclp_induct)
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   182
   apply (rule rtranclp.rtrancl_refl)
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   183
  apply (blast intro: rtranclp_trans)
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   184
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   185
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   186
lemmas rtrancl_idemp [simp] = rtranclp_idemp [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   187
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   188
lemma rtrancl_idemp_self_comp [simp]: "R^* O R^* = R^*"
39302
d7728f65b353 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents: 39198
diff changeset
   189
  apply (rule set_eqI)
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   190
  apply (simp only: split_tupled_all)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   191
  apply (blast intro: rtrancl_trans)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   192
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   193
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   194
lemma rtrancl_subset_rtrancl: "r \<subseteq> s^* ==> r^* \<subseteq> s^*"
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   195
  apply (drule rtrancl_mono)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   196
  apply simp
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   197
  done
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   198
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   199
lemma rtranclp_subset: "R \<le> S ==> S \<le> R^** ==> S^** = R^**"
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   200
  apply (drule rtranclp_mono)
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   201
  apply (drule rtranclp_mono)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   202
  apply simp
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   203
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   204
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   205
lemmas rtrancl_subset = rtranclp_subset [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   206
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   207
lemma rtranclp_sup_rtranclp: "(sup (R^**) (S^**))^** = (sup R S)^**"
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   208
  by (blast intro!: rtranclp_subset intro: rtranclp_mono [THEN predicate2D])
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   209
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   210
lemmas rtrancl_Un_rtrancl = rtranclp_sup_rtranclp [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   211
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   212
lemma rtranclp_reflcl [simp]: "(R^==)^** = R^**"
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   213
  by (blast intro!: rtranclp_subset)
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   214
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   215
lemmas rtrancl_reflcl [simp] = rtranclp_reflcl [to_set]
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   216
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   217
lemma rtrancl_r_diff_Id: "(r - Id)^* = r^*"
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   218
  apply (rule sym)
14208
144f45277d5a misc tidying
paulson
parents: 13867
diff changeset
   219
  apply (rule rtrancl_subset, blast, clarify)
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   220
  apply (rename_tac a b)
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   221
  apply (case_tac "a = b")
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   222
   apply blast
44921
58eef4843641 tuned proofs
huffman
parents: 44890
diff changeset
   223
  apply blast
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   224
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   225
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   226
lemma rtranclp_r_diff_Id: "(inf r op ~=)^** = r^**"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   227
  apply (rule sym)
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   228
  apply (rule rtranclp_subset)
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   229
   apply blast+
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   230
  done
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   231
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   232
theorem rtranclp_converseD:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   233
  assumes r: "(r^--1)^** x y"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   234
  shows "r^** y x"
12823
9d3f5056296b Made some proofs constructive.
berghofe
parents: 12691
diff changeset
   235
proof -
9d3f5056296b Made some proofs constructive.
berghofe
parents: 12691
diff changeset
   236
  from r show ?thesis
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   237
    by induct (iprover intro: rtranclp_trans dest!: conversepD)+
12823
9d3f5056296b Made some proofs constructive.
berghofe
parents: 12691
diff changeset
   238
qed
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   239
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   240
lemmas rtrancl_converseD = rtranclp_converseD [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   241
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   242
theorem rtranclp_converseI:
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   243
  assumes "r^** y x"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   244
  shows "(r^--1)^** x y"
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   245
  using assms
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   246
  by induct (iprover intro: rtranclp_trans conversepI)+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   247
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   248
lemmas rtrancl_converseI = rtranclp_converseI [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   249
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   250
lemma rtrancl_converse: "(r^-1)^* = (r^*)^-1"
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   251
  by (fast dest!: rtrancl_converseD intro!: rtrancl_converseI)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   252
19228
30fce6da8cbe added many simple lemmas
huffman
parents: 18372
diff changeset
   253
lemma sym_rtrancl: "sym r ==> sym (r^*)"
30fce6da8cbe added many simple lemmas
huffman
parents: 18372
diff changeset
   254
  by (simp only: sym_conv_converse_eq rtrancl_converse [symmetric])
30fce6da8cbe added many simple lemmas
huffman
parents: 18372
diff changeset
   255
34909
a799687944af Tuned some proofs; nicer case names for some of the induction / cases rules.
berghofe
parents: 33878
diff changeset
   256
theorem converse_rtranclp_induct [consumes 1, case_names base step]:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   257
  assumes major: "r^** a b"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   258
    and cases: "P b" "!!y z. [| r y z; r^** z b; P z |] ==> P y"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12823
diff changeset
   259
  shows "P a"
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   260
  using rtranclp_converseI [OF major]
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   261
  by induct (iprover intro: cases dest!: conversepD rtranclp_converseD)+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   262
25425
9191942c4ead Removed some case_names and consumes attributes that are now no longer
berghofe
parents: 25295
diff changeset
   263
lemmas converse_rtrancl_induct = converse_rtranclp_induct [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   264
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   265
lemmas converse_rtranclp_induct2 =
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   266
  converse_rtranclp_induct [of _ "(ax,ay)" "(bx,by)", split_rule,
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   267
                 consumes 1, case_names refl step]
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   268
14404
4952c5a92e04 Transitive_Closure: added consumes and case_names attributes
nipkow
parents: 14398
diff changeset
   269
lemmas converse_rtrancl_induct2 =
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   270
  converse_rtrancl_induct [of "(ax,ay)" "(bx,by)", split_format (complete),
14404
4952c5a92e04 Transitive_Closure: added consumes and case_names attributes
nipkow
parents: 14398
diff changeset
   271
                 consumes 1, case_names refl step]
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   272
34909
a799687944af Tuned some proofs; nicer case names for some of the induction / cases rules.
berghofe
parents: 33878
diff changeset
   273
lemma converse_rtranclpE [consumes 1, case_names base step]:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   274
  assumes major: "r^** x z"
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   275
    and cases: "x=z ==> P"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   276
      "!!y. [| r x y; r^** y z |] ==> P"
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   277
  shows P
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   278
  apply (subgoal_tac "x = z | (EX y. r x y & r^** y z)")
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   279
   apply (rule_tac [2] major [THEN converse_rtranclp_induct])
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   280
    prefer 2 apply iprover
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   281
   prefer 2 apply iprover
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   282
  apply (erule asm_rl exE disjE conjE cases)+
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   283
  done
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   284
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   285
lemmas converse_rtranclE = converse_rtranclpE [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   286
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   287
lemmas converse_rtranclpE2 = converse_rtranclpE [of _ "(xa,xb)" "(za,zb)", split_rule]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   288
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   289
lemmas converse_rtranclE2 = converse_rtranclE [of "(xa,xb)" "(za,zb)", split_rule]
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   290
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   291
lemma r_comp_rtrancl_eq: "r O r^* = r^* O r"
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   292
  by (blast elim: rtranclE converse_rtranclE
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   293
    intro: rtrancl_into_rtrancl converse_rtrancl_into_rtrancl)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   294
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32215
diff changeset
   295
lemma rtrancl_unfold: "r^* = Id Un r^* O r"
15551
af78481b37bf unfold theorems for trancl and rtrancl
paulson
parents: 15531
diff changeset
   296
  by (auto intro: rtrancl_into_rtrancl elim: rtranclE)
af78481b37bf unfold theorems for trancl and rtrancl
paulson
parents: 15531
diff changeset
   297
31690
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   298
lemma rtrancl_Un_separatorE:
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   299
  "(a,b) : (P \<union> Q)^* \<Longrightarrow> \<forall>x y. (a,x) : P^* \<longrightarrow> (x,y) : Q \<longrightarrow> x=y \<Longrightarrow> (a,b) : P^*"
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   300
apply (induct rule:rtrancl.induct)
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   301
 apply blast
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   302
apply (blast intro:rtrancl_trans)
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   303
done
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   304
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   305
lemma rtrancl_Un_separator_converseE:
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   306
  "(a,b) : (P \<union> Q)^* \<Longrightarrow> \<forall>x y. (x,b) : P^* \<longrightarrow> (y,x) : Q \<longrightarrow> y=x \<Longrightarrow> (a,b) : P^*"
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   307
apply (induct rule:converse_rtrancl_induct)
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   308
 apply blast
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   309
apply (blast intro:rtrancl_trans)
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   310
done
cc37bf07f9bb rtrancl lemmas
nipkow
parents: 31577
diff changeset
   311
34970
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   312
lemma Image_closed_trancl:
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   313
  assumes "r `` X \<subseteq> X" shows "r\<^sup>* `` X = X"
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   314
proof -
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   315
  from assms have **: "{y. \<exists>x\<in>X. (x, y) \<in> r} \<subseteq> X" by auto
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   316
  have "\<And>x y. (y, x) \<in> r\<^sup>* \<Longrightarrow> y \<in> X \<Longrightarrow> x \<in> X"
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   317
  proof -
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   318
    fix x y
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   319
    assume *: "y \<in> X"
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   320
    assume "(y, x) \<in> r\<^sup>*"
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   321
    then show "x \<in> X"
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   322
    proof induct
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   323
      case base show ?case by (fact *)
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   324
    next
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   325
      case step with ** show ?case by auto
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   326
    qed
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   327
  qed
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   328
  then show ?thesis by auto
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   329
qed
4c316d777461 lemma Image_closed_trancl
haftmann
parents: 34909
diff changeset
   330
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   331
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   332
subsection {* Transitive closure *}
10331
7411e4659d4a more "xsymbols" syntax;
wenzelm
parents: 10213
diff changeset
   333
13704
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   334
lemma trancl_mono: "!!p. p \<in> r^+ ==> r \<subseteq> s ==> p \<in> s^+"
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   335
  apply (simp add: split_tupled_all)
13704
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   336
  apply (erule trancl.induct)
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   337
   apply (iprover dest: subsetD)+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   338
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   339
13704
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   340
lemma r_into_trancl': "!!p. p : r ==> p : r^+"
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   341
  by (simp only: split_tupled_all) (erule r_into_trancl)
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   342
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   343
text {*
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   344
  \medskip Conversions between @{text trancl} and @{text rtrancl}.
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   345
*}
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   346
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   347
lemma tranclp_into_rtranclp: "r^++ a b ==> r^** a b"
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   348
  by (erule tranclp.induct) iprover+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   349
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   350
lemmas trancl_into_rtrancl = tranclp_into_rtranclp [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   351
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   352
lemma rtranclp_into_tranclp1: assumes r: "r^** a b"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   353
  shows "!!c. r b c ==> r^++ a c" using r
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 16514
diff changeset
   354
  by induct iprover+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   355
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   356
lemmas rtrancl_into_trancl1 = rtranclp_into_tranclp1 [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   357
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   358
lemma rtranclp_into_tranclp2: "[| r a b; r^** b c |] ==> r^++ a c"
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   359
  -- {* intro rule from @{text r} and @{text rtrancl} *}
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   360
  apply (erule rtranclp.cases)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   361
   apply iprover
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   362
  apply (rule rtranclp_trans [THEN rtranclp_into_tranclp1])
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   363
    apply (simp | rule r_into_rtranclp)+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   364
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   365
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   366
lemmas rtrancl_into_trancl2 = rtranclp_into_tranclp2 [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   367
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   368
text {* Nice induction rule for @{text trancl} *}
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   369
lemma tranclp_induct [consumes 1, case_names base step, induct pred: tranclp]:
34909
a799687944af Tuned some proofs; nicer case names for some of the induction / cases rules.
berghofe
parents: 33878
diff changeset
   370
  assumes a: "r^++ a b"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   371
  and cases: "!!y. r a y ==> P y"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   372
    "!!y z. r^++ a y ==> r y z ==> P y ==> P z"
34909
a799687944af Tuned some proofs; nicer case names for some of the induction / cases rules.
berghofe
parents: 33878
diff changeset
   373
  shows "P b" using a
a799687944af Tuned some proofs; nicer case names for some of the induction / cases rules.
berghofe
parents: 33878
diff changeset
   374
  by (induct x\<equiv>a b) (iprover intro: cases)+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   375
25425
9191942c4ead Removed some case_names and consumes attributes that are now no longer
berghofe
parents: 25295
diff changeset
   376
lemmas trancl_induct [induct set: trancl] = tranclp_induct [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   377
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   378
lemmas tranclp_induct2 =
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   379
  tranclp_induct [of _ "(ax,ay)" "(bx,by)", split_rule,
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   380
    consumes 1, case_names base step]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   381
22172
e7d6cb237b5e some new lemmas
paulson
parents: 22080
diff changeset
   382
lemmas trancl_induct2 =
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   383
  trancl_induct [of "(ax,ay)" "(bx,by)", split_format (complete),
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   384
    consumes 1, case_names base step]
22172
e7d6cb237b5e some new lemmas
paulson
parents: 22080
diff changeset
   385
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   386
lemma tranclp_trans_induct:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   387
  assumes major: "r^++ x y"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   388
    and cases: "!!x y. r x y ==> P x y"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   389
      "!!x y z. [| r^++ x y; P x y; r^++ y z; P y z |] ==> P x z"
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   390
  shows "P x y"
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   391
  -- {* Another induction rule for trancl, incorporating transitivity *}
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   392
  by (iprover intro: major [THEN tranclp_induct] cases)
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   393
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   394
lemmas trancl_trans_induct = tranclp_trans_induct [to_set]
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   395
26174
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   396
lemma tranclE [cases set: trancl]:
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   397
  assumes "(a, b) : r^+"
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   398
  obtains
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   399
    (base) "(a, b) : r"
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   400
  | (step) c where "(a, c) : r^+" and "(c, b) : r"
9efd4c04eaa4 rtranclE, tranclE: tuned statement, added case_names;
wenzelm
parents: 25425
diff changeset
   401
  using assms by cases simp_all
10980
0a45f2efaaec Transitive_Closure turned into new-style theory;
wenzelm
parents: 10827
diff changeset
   402
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32215
diff changeset
   403
lemma trancl_Int_subset: "[| r \<subseteq> s; (r^+ \<inter> s) O r \<subseteq> s|] ==> r^+ \<subseteq> s"
22080
7bf8868ab3e4 induction rules for trancl/rtrancl expressed using subsets
paulson
parents: 21589
diff changeset
   404
  apply (rule subsetI)
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   405
  apply (rule_tac p = x in PairE)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   406
  apply clarify
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   407
  apply (erule trancl_induct)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   408
   apply auto
22080
7bf8868ab3e4 induction rules for trancl/rtrancl expressed using subsets
paulson
parents: 21589
diff changeset
   409
  done
7bf8868ab3e4 induction rules for trancl/rtrancl expressed using subsets
paulson
parents: 21589
diff changeset
   410
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32215
diff changeset
   411
lemma trancl_unfold: "r^+ = r Un r^+ O r"
15551
af78481b37bf unfold theorems for trancl and rtrancl
paulson
parents: 15531
diff changeset
   412
  by (auto intro: trancl_into_trancl elim: tranclE)
af78481b37bf unfold theorems for trancl and rtrancl
paulson
parents: 15531
diff changeset
   413
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   414
text {* Transitivity of @{term "r^+"} *}
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   415
lemma trans_trancl [simp]: "trans (r^+)"
13704
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   416
proof (rule transI)
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   417
  fix x y z
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   418
  assume "(x, y) \<in> r^+"
13704
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   419
  assume "(y, z) \<in> r^+"
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   420
  then show "(x, z) \<in> r^+"
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   421
  proof induct
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   422
    case (base u)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   423
    from `(x, y) \<in> r^+` and `(y, u) \<in> r`
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   424
    show "(x, u) \<in> r^+" ..
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   425
  next
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   426
    case (step u v)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   427
    from `(x, u) \<in> r^+` and `(u, v) \<in> r`
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   428
    show "(x, v) \<in> r^+" ..
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   429
  qed
13704
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   430
qed
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   431
45607
16b4f5774621 eliminated obsolete "standard";
wenzelm
parents: 45153
diff changeset
   432
lemmas trancl_trans = trans_trancl [THEN transD]
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   433
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   434
lemma tranclp_trans:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   435
  assumes xy: "r^++ x y"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   436
  and yz: "r^++ y z"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   437
  shows "r^++ x z" using yz xy
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   438
  by induct iprover+
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   439
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   440
lemma trancl_id [simp]: "trans r \<Longrightarrow> r^+ = r"
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   441
  apply auto
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   442
  apply (erule trancl_induct)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   443
   apply assumption
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   444
  apply (unfold trans_def)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   445
  apply blast
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   446
  done
19623
12e6cc4382ae added lemma in_measure
nipkow
parents: 19228
diff changeset
   447
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   448
lemma rtranclp_tranclp_tranclp:
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   449
  assumes "r^** x y"
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   450
  shows "!!z. r^++ y z ==> r^++ x z" using assms
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   451
  by induct (iprover intro: tranclp_trans)+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   452
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   453
lemmas rtrancl_trancl_trancl = rtranclp_tranclp_tranclp [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   454
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   455
lemma tranclp_into_tranclp2: "r a b ==> r^++ b c ==> r^++ a c"
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   456
  by (erule tranclp_trans [OF tranclp.r_into_trancl])
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   457
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   458
lemmas trancl_into_trancl2 = tranclp_into_tranclp2 [to_set]
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   459
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   460
lemma trancl_insert:
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   461
  "(insert (y, x) r)^+ = r^+ \<union> {(a, b). (a, y) \<in> r^* \<and> (x, b) \<in> r^*}"
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   462
  -- {* primitive recursion for @{text trancl} over finite relations *}
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   463
  apply (rule equalityI)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   464
   apply (rule subsetI)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   465
   apply (simp only: split_tupled_all)
14208
144f45277d5a misc tidying
paulson
parents: 13867
diff changeset
   466
   apply (erule trancl_induct, blast)
35216
7641e8d831d2 get rid of many duplicate simp rule warnings
huffman
parents: 34970
diff changeset
   467
   apply (blast intro: rtrancl_into_trancl1 trancl_into_rtrancl trancl_trans)
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   468
  apply (rule subsetI)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   469
  apply (blast intro: trancl_mono rtrancl_mono
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   470
    [THEN [2] rev_subsetD] rtrancl_trancl_trancl rtrancl_into_trancl2)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   471
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   472
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   473
lemma tranclp_converseI: "(r^++)^--1 x y ==> (r^--1)^++ x y"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   474
  apply (drule conversepD)
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   475
  apply (erule tranclp_induct)
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   476
  apply (iprover intro: conversepI tranclp_trans)+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   477
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   478
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   479
lemmas trancl_converseI = tranclp_converseI [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   480
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   481
lemma tranclp_converseD: "(r^--1)^++ x y ==> (r^++)^--1 x y"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   482
  apply (rule conversepI)
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   483
  apply (erule tranclp_induct)
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   484
  apply (iprover dest: conversepD intro: tranclp_trans)+
13704
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   485
  done
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   486
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   487
lemmas trancl_converseD = tranclp_converseD [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   488
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   489
lemma tranclp_converse: "(r^--1)^++ = (r^++)^--1"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 43596
diff changeset
   490
  by (fastforce simp add: fun_eq_iff
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   491
    intro!: tranclp_converseI dest!: tranclp_converseD)
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   492
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   493
lemmas trancl_converse = tranclp_converse [to_set]
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   494
19228
30fce6da8cbe added many simple lemmas
huffman
parents: 18372
diff changeset
   495
lemma sym_trancl: "sym r ==> sym (r^+)"
30fce6da8cbe added many simple lemmas
huffman
parents: 18372
diff changeset
   496
  by (simp only: sym_conv_converse_eq trancl_converse [symmetric])
30fce6da8cbe added many simple lemmas
huffman
parents: 18372
diff changeset
   497
34909
a799687944af Tuned some proofs; nicer case names for some of the induction / cases rules.
berghofe
parents: 33878
diff changeset
   498
lemma converse_tranclp_induct [consumes 1, case_names base step]:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   499
  assumes major: "r^++ a b"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   500
    and cases: "!!y. r y b ==> P(y)"
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   501
      "!!y z.[| r y z;  r^++ z b;  P(z) |] ==> P(y)"
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   502
  shows "P a"
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   503
  apply (rule tranclp_induct [OF tranclp_converseI, OF conversepI, OF major])
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   504
   apply (rule cases)
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   505
   apply (erule conversepD)
35216
7641e8d831d2 get rid of many duplicate simp rule warnings
huffman
parents: 34970
diff changeset
   506
  apply (blast intro: assms dest!: tranclp_converseD)
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   507
  done
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   508
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   509
lemmas converse_trancl_induct = converse_tranclp_induct [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   510
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   511
lemma tranclpD: "R^++ x y ==> EX z. R x z \<and> R^** z y"
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   512
  apply (erule converse_tranclp_induct)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   513
   apply auto
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   514
  apply (blast intro: rtranclp_trans)
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   515
  done
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   516
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   517
lemmas tranclD = tranclpD [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   518
31577
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   519
lemma converse_tranclpE:
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   520
  assumes major: "tranclp r x z"
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   521
  assumes base: "r x z ==> P"
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   522
  assumes step: "\<And> y. [| r x y; tranclp r y z |] ==> P"
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   523
  shows P
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   524
proof -
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   525
  from tranclpD[OF major]
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   526
  obtain y where "r x y" and "rtranclp r y z" by iprover
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   527
  from this(2) show P
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   528
  proof (cases rule: rtranclp.cases)
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   529
    case rtrancl_refl
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   530
    with `r x y` base show P by iprover
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   531
  next
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   532
    case rtrancl_into_rtrancl
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   533
    from this have "tranclp r y z"
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   534
      by (iprover intro: rtranclp_into_tranclp1)
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   535
    with `r x y` step show P by iprover
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   536
  qed
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   537
qed
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   538
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   539
lemmas converse_tranclE = converse_tranclpE [to_set]
ce3721fa1e17 added lemma
bulwahn
parents: 31576
diff changeset
   540
25295
12985023be5e tranclD2 (tranclD at the other end) + trancl_power
kleing
parents: 23743
diff changeset
   541
lemma tranclD2:
12985023be5e tranclD2 (tranclD at the other end) + trancl_power
kleing
parents: 23743
diff changeset
   542
  "(x, y) \<in> R\<^sup>+ \<Longrightarrow> \<exists>z. (x, z) \<in> R\<^sup>* \<and> (z, y) \<in> R"
12985023be5e tranclD2 (tranclD at the other end) + trancl_power
kleing
parents: 23743
diff changeset
   543
  by (blast elim: tranclE intro: trancl_into_rtrancl)
12985023be5e tranclD2 (tranclD at the other end) + trancl_power
kleing
parents: 23743
diff changeset
   544
13867
1fdecd15437f just a few mods to a few thms
nipkow
parents: 13726
diff changeset
   545
lemma irrefl_tranclI: "r^-1 \<inter> r^* = {} ==> (x, x) \<notin> r^+"
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   546
  by (blast elim: tranclE dest: trancl_into_rtrancl)
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   547
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   548
lemma irrefl_trancl_rD: "!!X. ALL x. (x, x) \<notin> r^+ ==> (x, y) \<in> r ==> x \<noteq> y"
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   549
  by (blast dest: r_into_trancl)
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   550
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   551
lemma trancl_subset_Sigma_aux:
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   552
    "(a, b) \<in> r^* ==> r \<subseteq> A \<times> A ==> a = b \<or> a \<in> A"
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
   553
  by (induct rule: rtrancl_induct) auto
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   554
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   555
lemma trancl_subset_Sigma: "r \<subseteq> A \<times> A ==> r^+ \<subseteq> A \<times> A"
13704
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   556
  apply (rule subsetI)
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   557
  apply (simp only: split_tupled_all)
854501b1e957 Transitive closure is now defined inductively as well.
berghofe
parents: 12937
diff changeset
   558
  apply (erule tranclE)
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   559
   apply (blast dest!: trancl_into_rtrancl trancl_subset_Sigma_aux)+
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   560
  done
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   561
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   562
lemma reflcl_tranclp [simp]: "(r^++)^== = r^**"
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   563
  apply (safe intro!: order_antisym)
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   564
   apply (erule tranclp_into_rtranclp)
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   565
  apply (blast elim: rtranclp.cases dest: rtranclp_into_tranclp1)
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   566
  done
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   567
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   568
lemmas reflcl_trancl [simp] = reflcl_tranclp [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   569
11090
wenzelm
parents: 11084
diff changeset
   570
lemma trancl_reflcl [simp]: "(r^=)^+ = r^*"
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   571
  apply safe
14208
144f45277d5a misc tidying
paulson
parents: 13867
diff changeset
   572
   apply (drule trancl_into_rtrancl, simp)
144f45277d5a misc tidying
paulson
parents: 13867
diff changeset
   573
  apply (erule rtranclE, safe)
144f45277d5a misc tidying
paulson
parents: 13867
diff changeset
   574
   apply (rule r_into_trancl, simp)
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   575
  apply (rule rtrancl_into_trancl1)
14208
144f45277d5a misc tidying
paulson
parents: 13867
diff changeset
   576
   apply (erule rtrancl_reflcl [THEN equalityD2, THEN subsetD], fast)
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   577
  done
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   578
45140
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
   579
lemma rtrancl_trancl_reflcl [code]: "r^* = (r^+)^="
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
   580
  by simp
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
   581
11090
wenzelm
parents: 11084
diff changeset
   582
lemma trancl_empty [simp]: "{}^+ = {}"
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   583
  by (auto elim: trancl_induct)
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   584
11090
wenzelm
parents: 11084
diff changeset
   585
lemma rtrancl_empty [simp]: "{}^* = Id"
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   586
  by (rule subst [OF reflcl_trancl]) simp
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   587
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   588
lemma rtranclpD: "R^** a b ==> a = b \<or> a \<noteq> b \<and> R^++ a b"
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   589
  by (force simp add: reflcl_tranclp [symmetric] simp del: reflcl_tranclp)
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   590
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   591
lemmas rtranclD = rtranclpD [to_set]
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   592
16514
090c6a98c704 lemma, equation between rtrancl and trancl
kleing
parents: 16417
diff changeset
   593
lemma rtrancl_eq_or_trancl:
090c6a98c704 lemma, equation between rtrancl and trancl
kleing
parents: 16417
diff changeset
   594
  "(x,y) \<in> R\<^sup>* = (x=y \<or> x\<noteq>y \<and> (x,y) \<in> R\<^sup>+)"
090c6a98c704 lemma, equation between rtrancl and trancl
kleing
parents: 16417
diff changeset
   595
  by (fast elim: trancl_into_rtrancl dest: rtranclD)
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   596
33656
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   597
lemma trancl_unfold_right: "r^+ = r^* O r"
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   598
by (auto dest: tranclD2 intro: rtrancl_into_trancl1)
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   599
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   600
lemma trancl_unfold_left: "r^+ = r O r^*"
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   601
by (auto dest: tranclD intro: rtrancl_into_trancl2)
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   602
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   603
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   604
text {* Simplifying nested closures *}
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   605
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   606
lemma rtrancl_trancl_absorb[simp]: "(R^*)^+ = R^*"
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   607
by (simp add: trans_rtrancl)
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   608
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   609
lemma trancl_rtrancl_absorb[simp]: "(R^+)^* = R^*"
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   610
by (subst reflcl_trancl[symmetric]) simp
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   611
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   612
lemma rtrancl_reflcl_absorb[simp]: "(R^*)^= = R^*"
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   613
by auto
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   614
fc1af6753233 a few lemmas for point-free reasoning about transitive closure
krauss
parents: 32901
diff changeset
   615
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   616
text {* @{text Domain} and @{text Range} *}
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   617
11090
wenzelm
parents: 11084
diff changeset
   618
lemma Domain_rtrancl [simp]: "Domain (R^*) = UNIV"
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   619
  by blast
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   620
11090
wenzelm
parents: 11084
diff changeset
   621
lemma Range_rtrancl [simp]: "Range (R^*) = UNIV"
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   622
  by blast
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   623
11090
wenzelm
parents: 11084
diff changeset
   624
lemma rtrancl_Un_subset: "(R^* \<union> S^*) \<subseteq> (R Un S)^*"
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   625
  by (rule rtrancl_Un_rtrancl [THEN subst]) fast
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   626
11090
wenzelm
parents: 11084
diff changeset
   627
lemma in_rtrancl_UnI: "x \<in> R^* \<or> x \<in> S^* ==> x \<in> (R \<union> S)^*"
11084
32c1deea5bcd unsymbolized;
wenzelm
parents: 10996
diff changeset
   628
  by (blast intro: subsetD [OF rtrancl_Un_subset])
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   629
11090
wenzelm
parents: 11084
diff changeset
   630
lemma trancl_domain [simp]: "Domain (r^+) = Domain r"
46752
e9e7209eb375 more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents: 46664
diff changeset
   631
  by (unfold Domain_unfold) (blast dest: tranclD)
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   632
11090
wenzelm
parents: 11084
diff changeset
   633
lemma trancl_range [simp]: "Range (r^+) = Range r"
46752
e9e7209eb375 more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents: 46664
diff changeset
   634
  unfolding Domain_converse [symmetric] by (simp add: trancl_converse [symmetric])
10996
74e970389def Moved some thms from Transitive_ClosureTr.ML to Transitive_Closure.thy
nipkow
parents: 10980
diff changeset
   635
11115
285b31e9e026 a new theorem from Bryan Ford
paulson
parents: 11090
diff changeset
   636
lemma Not_Domain_rtrancl:
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   637
    "x ~: Domain R ==> ((x, y) : R^*) = (x = y)"
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   638
  apply auto
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   639
  apply (erule rev_mp)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   640
  apply (erule rtrancl_induct)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   641
   apply auto
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   642
  done
11327
cd2c27a23df1 Transitive closure is now defined via "inductive".
berghofe
parents: 11115
diff changeset
   643
29609
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   644
lemma trancl_subset_Field2: "r^+ <= Field r \<times> Field r"
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   645
  apply clarify
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   646
  apply (erule trancl_induct)
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   647
   apply (auto simp add: Field_def)
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   648
  done
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   649
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   650
lemma finite_trancl[simp]: "finite (r^+) = finite r"
29609
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   651
  apply auto
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   652
   prefer 2
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   653
   apply (rule trancl_subset_Field2 [THEN finite_subset])
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   654
   apply (rule finite_SigmaI)
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   655
    prefer 3
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   656
    apply (blast intro: r_into_trancl' finite_subset)
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   657
   apply (auto simp add: finite_Field)
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   658
  done
a010aab5bed0 changed import hierarchy
haftmann
parents: 26801
diff changeset
   659
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   660
text {* More about converse @{text rtrancl} and @{text trancl}, should
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   661
  be merged with main body. *}
12428
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   662
14337
e13731554e50 undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents: 14208
diff changeset
   663
lemma single_valued_confluent:
e13731554e50 undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents: 14208
diff changeset
   664
  "\<lbrakk> single_valued r; (x,y) \<in> r^*; (x,z) \<in> r^* \<rbrakk>
e13731554e50 undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents: 14208
diff changeset
   665
  \<Longrightarrow> (y,z) \<in> r^* \<or> (z,y) \<in> r^*"
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   666
  apply (erule rtrancl_induct)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   667
  apply simp
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   668
  apply (erule disjE)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   669
   apply (blast elim:converse_rtranclE dest:single_valuedD)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   670
  apply(blast intro:rtrancl_trans)
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   671
  done
14337
e13731554e50 undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents: 14208
diff changeset
   672
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   673
lemma r_r_into_trancl: "(a, b) \<in> R ==> (b, c) \<in> R ==> (a, c) \<in> R^+"
12428
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   674
  by (fast intro: trancl_trans)
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   675
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   676
lemma trancl_into_trancl [rule_format]:
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   677
    "(a, b) \<in> r\<^sup>+ ==> (b, c) \<in> r --> (a,c) \<in> r\<^sup>+"
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   678
  apply (erule trancl_induct)
12428
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   679
   apply (fast intro: r_r_into_trancl)
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   680
  apply (fast intro: r_r_into_trancl trancl_trans)
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   681
  done
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   682
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   683
lemma tranclp_rtranclp_tranclp:
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   684
    "r\<^sup>+\<^sup>+ a b ==> r\<^sup>*\<^sup>* b c ==> r\<^sup>+\<^sup>+ a c"
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   685
  apply (drule tranclpD)
26179
bc5d582d6cfe rtranclp_induct, tranclp_induct: added case_names;
wenzelm
parents: 26174
diff changeset
   686
  apply (elim exE conjE)
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   687
  apply (drule rtranclp_trans, assumption)
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   688
  apply (drule rtranclp_into_tranclp2, assumption, assumption)
12428
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   689
  done
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   690
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   691
lemmas trancl_rtrancl_trancl = tranclp_rtranclp_tranclp [to_set]
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   692
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   693
lemmas transitive_closure_trans [trans] =
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   694
  r_r_into_trancl trancl_trans rtrancl_trans
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   695
  trancl.trancl_into_trancl trancl_into_trancl2
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   696
  rtrancl.rtrancl_into_rtrancl converse_rtrancl_into_rtrancl
12691
d21db58bcdc2 converted theory Transitive_Closure;
wenzelm
parents: 12566
diff changeset
   697
  rtrancl_trancl_trancl trancl_rtrancl_trancl
12428
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   698
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   699
lemmas transitive_closurep_trans' [trans] =
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   700
  tranclp_trans rtranclp_trans
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   701
  tranclp.trancl_into_trancl tranclp_into_tranclp2
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   702
  rtranclp.rtrancl_into_rtrancl converse_rtranclp_into_rtranclp
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
   703
  rtranclp_tranclp_tranclp tranclp_rtranclp_tranclp
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
   704
12428
f3033eed309a setup [trans] rules for calculational Isar reasoning
kleing
parents: 11327
diff changeset
   705
declare trancl_into_rtrancl [elim]
11327
cd2c27a23df1 Transitive closure is now defined via "inductive".
berghofe
parents: 11115
diff changeset
   706
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   707
subsection {* The power operation on relations *}
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   708
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   709
text {* @{text "R ^^ n = R O ... O R"}, the n-fold composition of @{text R} *}
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   710
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30954
diff changeset
   711
overloading
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30954
diff changeset
   712
  relpow == "compow :: nat \<Rightarrow> ('a \<times> 'a) set \<Rightarrow> ('a \<times> 'a) set"
47202
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   713
  relpowp == "compow :: nat \<Rightarrow> ('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> ('a \<Rightarrow> 'a \<Rightarrow> bool)"
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30954
diff changeset
   714
begin
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   715
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30954
diff changeset
   716
primrec relpow :: "nat \<Rightarrow> ('a \<times> 'a) set \<Rightarrow> ('a \<times> 'a) set" where
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30954
diff changeset
   717
    "relpow 0 R = Id"
32235
8f9b8d14fc9f "more standard" argument order of relation composition (op O)
krauss
parents: 32215
diff changeset
   718
  | "relpow (Suc n) R = (R ^^ n) O R"
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   719
47202
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   720
primrec relpowp :: "nat \<Rightarrow> ('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> ('a \<Rightarrow> 'a \<Rightarrow> bool)" where
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   721
    "relpowp 0 R = HOL.eq"
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   722
  | "relpowp (Suc n) R = (R ^^ n) OO R"
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   723
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30954
diff changeset
   724
end
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   725
47202
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   726
lemma relpowp_relpow_eq [pred_set_conv]:
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   727
  fixes R :: "'a rel"
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   728
  shows "(\<lambda>x y. (x, y) \<in> R) ^^ n = (\<lambda>x y. (x, y) \<in> R ^^ n)"
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   729
  by (induct n) (simp_all add: rel_compp_rel_comp_eq)
69cee87927f0 power on predicate relations
haftmann
parents: 46752
diff changeset
   730
46360
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   731
text {* for code generation *}
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   732
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   733
definition relpow :: "nat \<Rightarrow> ('a \<times> 'a) set \<Rightarrow> ('a \<times> 'a) set" where
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   734
  relpow_code_def [code_abbrev]: "relpow = compow"
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   735
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   736
lemma [code]:
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   737
  "relpow (Suc n) R = (relpow n R) O R"
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   738
  "relpow 0 R = Id"
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   739
  by (simp_all add: relpow_code_def)
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   740
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   741
hide_const (open) relpow
5cb81e3fa799 adding code generation for relpow by copying the ideas for code generation of funpow
bulwahn
parents: 46347
diff changeset
   742
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   743
lemma relpow_1 [simp]:
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30954
diff changeset
   744
  fixes R :: "('a \<times> 'a) set"
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30954
diff changeset
   745
  shows "R ^^ 1 = R"
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   746
  by simp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   747
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   748
lemma relpow_0_I: 
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   749
  "(x, x) \<in> R ^^ 0"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   750
  by simp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   751
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   752
lemma relpow_Suc_I:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   753
  "(x, y) \<in>  R ^^ n \<Longrightarrow> (y, z) \<in> R \<Longrightarrow> (x, z) \<in> R ^^ Suc n"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   754
  by auto
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   755
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   756
lemma relpow_Suc_I2:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   757
  "(x, y) \<in> R \<Longrightarrow> (y, z) \<in> R ^^ n \<Longrightarrow> (x, z) \<in> R ^^ Suc n"
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 43596
diff changeset
   758
  by (induct n arbitrary: z) (simp, fastforce)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   759
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   760
lemma relpow_0_E:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   761
  "(x, y) \<in> R ^^ 0 \<Longrightarrow> (x = y \<Longrightarrow> P) \<Longrightarrow> P"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   762
  by simp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   763
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   764
lemma relpow_Suc_E:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   765
  "(x, z) \<in> R ^^ Suc n \<Longrightarrow> (\<And>y. (x, y) \<in> R ^^ n \<Longrightarrow> (y, z) \<in> R \<Longrightarrow> P) \<Longrightarrow> P"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   766
  by auto
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   767
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   768
lemma relpow_E:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   769
  "(x, z) \<in>  R ^^ n \<Longrightarrow>  (n = 0 \<Longrightarrow> x = z \<Longrightarrow> P)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   770
   \<Longrightarrow> (\<And>y m. n = Suc m \<Longrightarrow> (x, y) \<in>  R ^^ m \<Longrightarrow> (y, z) \<in> R \<Longrightarrow> P)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   771
   \<Longrightarrow> P"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   772
  by (cases n) auto
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   773
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   774
lemma relpow_Suc_D2:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   775
  "(x, z) \<in> R ^^ Suc n \<Longrightarrow> (\<exists>y. (x, y) \<in> R \<and> (y, z) \<in> R ^^ n)"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   776
  apply (induct n arbitrary: x z)
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   777
   apply (blast intro: relpow_0_I elim: relpow_0_E relpow_Suc_E)
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   778
  apply (blast intro: relpow_Suc_I elim: relpow_0_E relpow_Suc_E)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   779
  done
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   780
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   781
lemma relpow_Suc_E2:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   782
  "(x, z) \<in> R ^^ Suc n \<Longrightarrow> (\<And>y. (x, y) \<in> R \<Longrightarrow> (y, z) \<in> R ^^ n \<Longrightarrow> P) \<Longrightarrow> P"
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   783
  by (blast dest: relpow_Suc_D2)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   784
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   785
lemma relpow_Suc_D2':
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   786
  "\<forall>x y z. (x, y) \<in> R ^^ n \<and> (y, z) \<in> R \<longrightarrow> (\<exists>w. (x, w) \<in> R \<and> (w, z) \<in> R ^^ n)"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   787
  by (induct n) (simp_all, blast)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   788
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   789
lemma relpow_E2:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   790
  "(x, z) \<in> R ^^ n \<Longrightarrow>  (n = 0 \<Longrightarrow> x = z \<Longrightarrow> P)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   791
     \<Longrightarrow> (\<And>y m. n = Suc m \<Longrightarrow> (x, y) \<in> R \<Longrightarrow> (y, z) \<in> R ^^ m \<Longrightarrow> P)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   792
   \<Longrightarrow> P"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   793
  apply (cases n, simp)
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   794
  apply (cut_tac n=nat and R=R in relpow_Suc_D2', simp, blast)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   795
  done
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   796
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   797
lemma relpow_add: "R ^^ (m+n) = R^^m O R^^n"
45976
9dc0d950baa9 tuned layout
haftmann
parents: 45607
diff changeset
   798
  by (induct n) auto
31351
b8d856545a02 new lemma
nipkow
parents: 30971
diff changeset
   799
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   800
lemma relpow_commute: "R O R ^^ n = R ^^ n O R"
45976
9dc0d950baa9 tuned layout
haftmann
parents: 45607
diff changeset
   801
  by (induct n) (simp, simp add: O_assoc [symmetric])
31970
ccaadfcf6941 move rel_pow_commute: "R O R ^^ n = R ^^ n O R" to Transitive_Closure
krauss
parents: 31690
diff changeset
   802
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   803
lemma relpow_empty:
45153
93e290c11b0f tuned type annnotation
haftmann
parents: 45141
diff changeset
   804
  "0 < n \<Longrightarrow> ({} :: ('a \<times> 'a) set) ^^ n = {}"
93e290c11b0f tuned type annnotation
haftmann
parents: 45141
diff changeset
   805
  by (cases n) auto
45116
f947eeef6b6f adding lemma about rel_pow in Transitive_Closure for executable equation of the (refl) transitive closure
bulwahn
parents: 44921
diff changeset
   806
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   807
lemma rtrancl_imp_UN_relpow:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   808
  assumes "p \<in> R^*"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   809
  shows "p \<in> (\<Union>n. R ^^ n)"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   810
proof (cases p)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   811
  case (Pair x y)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   812
  with assms have "(x, y) \<in> R^*" by simp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   813
  then have "(x, y) \<in> (\<Union>n. R ^^ n)" proof induct
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   814
    case base show ?case by (blast intro: relpow_0_I)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   815
  next
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   816
    case step then show ?case by (blast intro: relpow_Suc_I)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   817
  qed
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   818
  with Pair show ?thesis by simp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   819
qed
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   820
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   821
lemma relpow_imp_rtrancl:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   822
  assumes "p \<in> R ^^ n"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   823
  shows "p \<in> R^*"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   824
proof (cases p)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   825
  case (Pair x y)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   826
  with assms have "(x, y) \<in> R ^^ n" by simp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   827
  then have "(x, y) \<in> R^*" proof (induct n arbitrary: x y)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   828
    case 0 then show ?case by simp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   829
  next
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   830
    case Suc then show ?case
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   831
      by (blast elim: relpow_Suc_E intro: rtrancl_into_rtrancl)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   832
  qed
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   833
  with Pair show ?thesis by simp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   834
qed
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   835
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   836
lemma rtrancl_is_UN_relpow:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   837
  "R^* = (\<Union>n. R ^^ n)"
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   838
  by (blast intro: rtrancl_imp_UN_relpow relpow_imp_rtrancl)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   839
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   840
lemma rtrancl_power:
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   841
  "p \<in> R^* \<longleftrightarrow> (\<exists>n. p \<in> R ^^ n)"
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   842
  by (simp add: rtrancl_is_UN_relpow)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   843
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   844
lemma trancl_power:
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   845
  "p \<in> R^+ \<longleftrightarrow> (\<exists>n > 0. p \<in> R ^^ n)"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   846
  apply (cases p)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   847
  apply simp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   848
  apply (rule iffI)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   849
   apply (drule tranclD2)
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   850
   apply (clarsimp simp: rtrancl_is_UN_relpow)
30971
7fbebf75b3ef funpow and relpow with shared "^^" syntax
haftmann
parents: 30954
diff changeset
   851
   apply (rule_tac x="Suc n" in exI)
46752
e9e7209eb375 more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents: 46664
diff changeset
   852
   apply (clarsimp simp: rel_comp_unfold)
44890
22f665a2e91c new fastforce replacing fastsimp - less confusing name
nipkow
parents: 43596
diff changeset
   853
   apply fastforce
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   854
  apply clarsimp
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   855
  apply (case_tac n, simp)
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   856
  apply clarsimp
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   857
  apply (drule relpow_imp_rtrancl)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   858
  apply (drule rtrancl_into_trancl1) apply auto
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   859
  done
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   860
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   861
lemma rtrancl_imp_relpow:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   862
  "p \<in> R^* \<Longrightarrow> \<exists>n. p \<in> R ^^ n"
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   863
  by (auto dest: rtrancl_imp_UN_relpow)
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
   864
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   865
text{* By Sternagel/Thiemann: *}
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   866
lemma relpow_fun_conv:
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   867
  "((a,b) \<in> R ^^ n) = (\<exists>f. f 0 = a \<and> f n = b \<and> (\<forall>i<n. (f i, f(Suc i)) \<in> R))"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   868
proof (induct n arbitrary: b)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   869
  case 0 show ?case by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   870
next
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   871
  case (Suc n)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   872
  show ?case
46752
e9e7209eb375 more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents: 46664
diff changeset
   873
  proof (simp add: rel_comp_unfold Suc)
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   874
    show "(\<exists>y. (\<exists>f. f 0 = a \<and> f n = y \<and> (\<forall>i<n. (f i,f(Suc i)) \<in> R)) \<and> (y,b) \<in> R)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   875
     = (\<exists>f. f 0 = a \<and> f(Suc n) = b \<and> (\<forall>i<Suc n. (f i, f (Suc i)) \<in> R))"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   876
    (is "?l = ?r")
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   877
    proof
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   878
      assume ?l
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   879
      then obtain c f where 1: "f 0 = a"  "f n = c"  "\<And>i. i < n \<Longrightarrow> (f i, f (Suc i)) \<in> R"  "(c,b) \<in> R" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   880
      let ?g = "\<lambda> m. if m = Suc n then b else f m"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   881
      show ?r by (rule exI[of _ ?g], simp add: 1)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   882
    next
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   883
      assume ?r
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   884
      then obtain f where 1: "f 0 = a"  "b = f (Suc n)"  "\<And>i. i < Suc n \<Longrightarrow> (f i, f (Suc i)) \<in> R" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   885
      show ?l by (rule exI[of _ "f n"], rule conjI, rule exI[of _ f], insert 1, auto)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   886
    qed
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   887
  qed
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   888
qed
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   889
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   890
lemma relpow_finite_bounded1:
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   891
assumes "finite(R :: ('a*'a)set)" and "k>0"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   892
shows "R^^k \<subseteq> (UN n:{n. 0<n & n <= card R}. R^^n)" (is "_ \<subseteq> ?r")
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   893
proof-
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   894
  { fix a b k
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   895
    have "(a,b) : R^^(Suc k) \<Longrightarrow> EX n. 0<n & n <= card R & (a,b) : R^^n"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   896
    proof(induct k arbitrary: b)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   897
      case 0
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   898
      hence "R \<noteq> {}" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   899
      with card_0_eq[OF `finite R`] have "card R >= Suc 0" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   900
      thus ?case using 0 by force
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   901
    next
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   902
      case (Suc k)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   903
      then obtain a' where "(a,a') : R^^(Suc k)" and "(a',b) : R" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   904
      from Suc(1)[OF `(a,a') : R^^(Suc k)`]
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   905
      obtain n where "n \<le> card R" and "(a,a') \<in> R ^^ n" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   906
      have "(a,b) : R^^(Suc n)" using `(a,a') \<in> R^^n` and `(a',b)\<in> R` by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   907
      { assume "n < card R"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   908
        hence ?case using `(a,b): R^^(Suc n)` Suc_leI[OF `n < card R`] by blast
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   909
      } moreover
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   910
      { assume "n = card R"
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   911
        from `(a,b) \<in> R ^^ (Suc n)`[unfolded relpow_fun_conv]
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   912
        obtain f where "f 0 = a" and "f(Suc n) = b"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   913
          and steps: "\<And>i. i <= n \<Longrightarrow> (f i, f (Suc i)) \<in> R" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   914
        let ?p = "%i. (f i, f(Suc i))"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   915
        let ?N = "{i. i \<le> n}"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   916
        have "?p ` ?N <= R" using steps by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   917
        from card_mono[OF assms(1) this]
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   918
        have "card(?p ` ?N) <= card R" .
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   919
        also have "\<dots> < card ?N" using `n = card R` by simp
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   920
        finally have "~ inj_on ?p ?N" by(rule pigeonhole)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   921
        then obtain i j where i: "i <= n" and j: "j <= n" and ij: "i \<noteq> j" and
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   922
          pij: "?p i = ?p j" by(auto simp: inj_on_def)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   923
        let ?i = "min i j" let ?j = "max i j"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   924
        have i: "?i <= n" and j: "?j <= n" and pij: "?p ?i = ?p ?j" 
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   925
          and ij: "?i < ?j"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   926
          using i j ij pij unfolding min_def max_def by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   927
        from i j pij ij obtain i j where i: "i<=n" and j: "j<=n" and ij: "i<j"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   928
          and pij: "?p i = ?p j" by blast
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   929
        let ?g = "\<lambda> l. if l \<le> i then f l else f (l + (j - i))"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   930
        let ?n = "Suc(n - (j - i))"
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   931
        have abl: "(a,b) \<in> R ^^ ?n" unfolding relpow_fun_conv
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   932
        proof (rule exI[of _ ?g], intro conjI impI allI)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   933
          show "?g ?n = b" using `f(Suc n) = b` j ij by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   934
        next
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   935
          fix k assume "k < ?n"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   936
          show "(?g k, ?g (Suc k)) \<in> R"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   937
          proof (cases "k < i")
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   938
            case True
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   939
            with i have "k <= n" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   940
            from steps[OF this] show ?thesis using True by simp
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   941
          next
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   942
            case False
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   943
            hence "i \<le> k" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   944
            show ?thesis
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   945
            proof (cases "k = i")
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   946
              case True
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   947
              thus ?thesis using ij pij steps[OF i] by simp
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   948
            next
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   949
              case False
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   950
              with `i \<le> k` have "i < k" by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   951
              hence small: "k + (j - i) <= n" using `k<?n` by arith
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   952
              show ?thesis using steps[OF small] `i<k` by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   953
            qed
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   954
          qed
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   955
        qed (simp add: `f 0 = a`)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   956
        moreover have "?n <= n" using i j ij by arith
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   957
        ultimately have ?case using `n = card R` by blast
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   958
      }
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   959
      ultimately show ?case using `n \<le> card R` by force
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   960
    qed
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   961
  }
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   962
  thus ?thesis using gr0_implies_Suc[OF `k>0`] by auto
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   963
qed
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   964
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   965
lemma relpow_finite_bounded:
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   966
assumes "finite(R :: ('a*'a)set)"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   967
shows "R^^k \<subseteq> (UN n:{n. n <= card R}. R^^n)"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   968
apply(cases k)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   969
 apply force
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   970
using relpow_finite_bounded1[OF assms, of k] by auto
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   971
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   972
lemma rtrancl_finite_eq_relpow:
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   973
  "finite R \<Longrightarrow> R^* = (UN n : {n. n <= card R}. R^^n)"
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   974
by(fastforce simp: rtrancl_power dest: relpow_finite_bounded)
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   975
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   976
lemma trancl_finite_eq_relpow:
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   977
  "finite R \<Longrightarrow> R^+ = (UN n : {n. 0 < n & n <= card R}. R^^n)"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   978
apply(auto simp add: trancl_power)
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   979
apply(auto dest: relpow_finite_bounded1)
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   980
done
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   981
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   982
lemma finite_rel_comp[simp,intro]:
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   983
assumes "finite R" and "finite S"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   984
shows "finite(R O S)"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   985
proof-
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   986
  have "R O S = (UN (x,y) : R. \<Union>((%(u,v). if u=y then {(x,v)} else {}) ` S))"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   987
    by(force simp add: split_def)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   988
  thus ?thesis using assms by(clarsimp)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   989
qed
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   990
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   991
lemma finite_relpow[simp,intro]:
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   992
  assumes "finite(R :: ('a*'a)set)" shows "n>0 \<Longrightarrow> finite(R^^n)"
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   993
apply(induct n)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   994
 apply simp
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   995
apply(case_tac n)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   996
 apply(simp_all add: assms)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   997
done
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
   998
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
   999
lemma single_valued_relpow:
30954
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
  1000
  fixes R :: "('a * 'a) set"
cf50e67bc1d1 power operation on functions in theory Nat; power operation on relations in theory Transitive_Closure
haftmann
parents: 30549
diff changeset
  1001
  shows "single_valued R \<Longrightarrow> single_valued (R ^^ n)"
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
  1002
apply (induct n arbitrary: R)
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
  1003
apply simp_all
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
  1004
apply (rule single_valuedI)
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
  1005
apply (fast dest: single_valuedD elim: relpow_Suc_E)
41987
4ad8f1dc2e0b added lemmas
nipkow
parents: 41792
diff changeset
  1006
done
15551
af78481b37bf unfold theorems for trancl and rtrancl
paulson
parents: 15531
diff changeset
  1007
45140
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1008
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1009
subsection {* Bounded transitive closure *}
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1010
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1011
definition ntrancl :: "nat \<Rightarrow> ('a \<times> 'a) set \<Rightarrow> ('a \<times> 'a) set"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1012
where
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1013
  "ntrancl n R = (\<Union>i\<in>{i. 0 < i \<and> i \<le> Suc n}. R ^^ i)"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1014
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1015
lemma ntrancl_Zero [simp, code]:
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1016
  "ntrancl 0 R = R"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1017
proof
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1018
  show "R \<subseteq> ntrancl 0 R"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1019
    unfolding ntrancl_def by fastforce
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1020
next
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1021
  { 
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1022
    fix i have "0 < i \<and> i \<le> Suc 0 \<longleftrightarrow> i = 1" by auto
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1023
  }
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1024
  from this show "ntrancl 0 R \<le> R"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1025
    unfolding ntrancl_def by auto
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1026
qed
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1027
46347
54870ad19af4 new code equation for ntrancl that allows computation of the transitive closure of sets on infinite types as well
bulwahn
parents: 46127
diff changeset
  1028
lemma ntrancl_Suc [simp]:
45140
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1029
  "ntrancl (Suc n) R = ntrancl n R O (Id \<union> R)"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1030
proof
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1031
  {
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1032
    fix a b
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1033
    assume "(a, b) \<in> ntrancl (Suc n) R"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1034
    from this obtain i where "0 < i" "i \<le> Suc (Suc n)" "(a, b) \<in> R ^^ i"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1035
      unfolding ntrancl_def by auto
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1036
    have "(a, b) \<in> ntrancl n R O (Id \<union> R)"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1037
    proof (cases "i = 1")
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1038
      case True
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1039
      from this `(a, b) \<in> R ^^ i` show ?thesis
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1040
        unfolding ntrancl_def by auto
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1041
    next
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1042
      case False
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1043
      from this `0 < i` obtain j where j: "i = Suc j" "0 < j"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1044
        by (cases i) auto
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1045
      from this `(a, b) \<in> R ^^ i` obtain c where c1: "(a, c) \<in> R ^^ j" and c2:"(c, b) \<in> R"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1046
        by auto
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1047
      from c1 j `i \<le> Suc (Suc n)` have "(a, c) \<in> ntrancl n R"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1048
        unfolding ntrancl_def by fastforce
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1049
      from this c2 show ?thesis by fastforce
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1050
    qed
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1051
  }
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1052
  from this show "ntrancl (Suc n) R \<subseteq> ntrancl n R O (Id \<union> R)"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1053
    by auto
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1054
next
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1055
  show "ntrancl n R O (Id \<union> R) \<subseteq> ntrancl (Suc n) R"
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1056
    unfolding ntrancl_def by fastforce
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1057
qed
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1058
46347
54870ad19af4 new code equation for ntrancl that allows computation of the transitive closure of sets on infinite types as well
bulwahn
parents: 46127
diff changeset
  1059
lemma [code]:
54870ad19af4 new code equation for ntrancl that allows computation of the transitive closure of sets on infinite types as well
bulwahn
parents: 46127
diff changeset
  1060
  "ntrancl (Suc n) r = (let r' = ntrancl n r in r' Un r' O r)"
54870ad19af4 new code equation for ntrancl that allows computation of the transitive closure of sets on infinite types as well
bulwahn
parents: 46127
diff changeset
  1061
unfolding Let_def by auto
54870ad19af4 new code equation for ntrancl that allows computation of the transitive closure of sets on infinite types as well
bulwahn
parents: 46127
diff changeset
  1062
45141
b2eb87bd541b avoid very specific code equation for card; corrected spelling
haftmann
parents: 45140
diff changeset
  1063
lemma finite_trancl_ntranl:
45140
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1064
  "finite R \<Longrightarrow> trancl R = ntrancl (card R - 1) R"
46362
b2878f059f91 renaming all lemmas with name rel_pow to relpow
bulwahn
parents: 46360
diff changeset
  1065
  by (cases "card R") (auto simp add: trancl_finite_eq_relpow relpow_empty ntrancl_def)
45140
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1066
339a8b3c4791 bouned transitive closure
haftmann
parents: 45139
diff changeset
  1067
45139
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1068
subsection {* Acyclic relations *}
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1069
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1070
definition acyclic :: "('a * 'a) set => bool" where
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1071
  "acyclic r \<longleftrightarrow> (!x. (x,x) ~: r^+)"
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1072
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1073
abbreviation acyclicP :: "('a => 'a => bool) => bool" where
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1074
  "acyclicP r \<equiv> acyclic {(x, y). r x y}"
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1075
46127
af3b95160b59 cleanup of code declarations
haftmann
parents: 45976
diff changeset
  1076
lemma acyclic_irrefl [code]:
45139
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1077
  "acyclic r \<longleftrightarrow> irrefl (r^+)"
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1078
  by (simp add: acyclic_def irrefl_def)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1079
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1080
lemma acyclicI: "ALL x. (x, x) ~: r^+ ==> acyclic r"
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1081
  by (simp add: acyclic_def)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1082
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1083
lemma acyclic_insert [iff]:
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1084
     "acyclic(insert (y,x) r) = (acyclic r & (x,y) ~: r^*)"
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1085
apply (simp add: acyclic_def trancl_insert)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1086
apply (blast intro: rtrancl_trans)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1087
done
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1088
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1089
lemma acyclic_converse [iff]: "acyclic(r^-1) = acyclic r"
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1090
by (simp add: acyclic_def trancl_converse)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1091
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1092
lemmas acyclicP_converse [iff] = acyclic_converse [to_pred]
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1093
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1094
lemma acyclic_impl_antisym_rtrancl: "acyclic r ==> antisym(r^*)"
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1095
apply (simp add: acyclic_def antisym_def)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1096
apply (blast elim: rtranclE intro: rtrancl_into_trancl1 rtrancl_trancl_trancl)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1097
done
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1098
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1099
(* Other direction:
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1100
acyclic = no loops
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1101
antisym = only self loops
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1102
Goalw [acyclic_def,antisym_def] "antisym( r^* ) ==> acyclic(r - Id)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1103
==> antisym( r^* ) = acyclic(r - Id)";
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1104
*)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1105
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1106
lemma acyclic_subset: "[| acyclic s; r <= s |] ==> acyclic r"
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1107
apply (simp add: acyclic_def)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1108
apply (blast intro: trancl_mono)
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1109
done
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1110
bdcaa3f3a2f4 moved acyclic predicate up in hierarchy
haftmann
parents: 45137
diff changeset
  1111
15076
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1112
subsection {* Setup of transitivity reasoner *}
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1113
26340
a85fe32e7b2f more antiquotations;
wenzelm
parents: 26271
diff changeset
  1114
ML {*
15076
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1115
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1116
structure Trancl_Tac = Trancl_Tac
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1117
(
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1118
  val r_into_trancl = @{thm trancl.r_into_trancl};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1119
  val trancl_trans  = @{thm trancl_trans};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1120
  val rtrancl_refl = @{thm rtrancl.rtrancl_refl};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1121
  val r_into_rtrancl = @{thm r_into_rtrancl};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1122
  val trancl_into_rtrancl = @{thm trancl_into_rtrancl};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1123
  val rtrancl_trancl_trancl = @{thm rtrancl_trancl_trancl};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1124
  val trancl_rtrancl_trancl = @{thm trancl_rtrancl_trancl};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1125
  val rtrancl_trans = @{thm rtrancl_trans};
15096
be1d3b8cfbd5 Documentation added; minor improvements.
ballarin
parents: 15076
diff changeset
  1126
30107
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29609
diff changeset
  1127
  fun decomp (@{const Trueprop} $ t) =
37677
c5a8b612e571 qualified constants Set.member and Set.Collect
haftmann
parents: 37391
diff changeset
  1128
    let fun dec (Const (@{const_name Set.member}, _) $ (Const (@{const_name Pair}, _) $ a $ b) $ rel ) =
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
  1129
        let fun decr (Const ("Transitive_Closure.rtrancl", _ ) $ r) = (r,"r*")
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
  1130
              | decr (Const ("Transitive_Closure.trancl", _ ) $ r)  = (r,"r+")
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
  1131
              | decr r = (r,"r");
26801
244184661a09 - Function dec in Trancl_Tac must eta-contract relation before calling
berghofe
parents: 26340
diff changeset
  1132
            val (rel,r) = decr (Envir.beta_eta_contract rel);
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
  1133
        in SOME (a,b,rel,r) end
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
  1134
      | dec _ =  NONE
30107
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29609
diff changeset
  1135
    in dec t end
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29609
diff changeset
  1136
    | decomp _ = NONE;
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1137
);
15076
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1138
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1139
structure Tranclp_Tac = Trancl_Tac
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1140
(
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1141
  val r_into_trancl = @{thm tranclp.r_into_trancl};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1142
  val trancl_trans  = @{thm tranclp_trans};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1143
  val rtrancl_refl = @{thm rtranclp.rtrancl_refl};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1144
  val r_into_rtrancl = @{thm r_into_rtranclp};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1145
  val trancl_into_rtrancl = @{thm tranclp_into_rtranclp};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1146
  val rtrancl_trancl_trancl = @{thm rtranclp_tranclp_tranclp};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1147
  val trancl_rtrancl_trancl = @{thm tranclp_rtranclp_tranclp};
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1148
  val rtrancl_trans = @{thm rtranclp_trans};
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1149
30107
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29609
diff changeset
  1150
  fun decomp (@{const Trueprop} $ t) =
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1151
    let fun dec (rel $ a $ b) =
23743
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
  1152
        let fun decr (Const ("Transitive_Closure.rtranclp", _ ) $ r) = (r,"r*")
52fbc991039f rtrancl and trancl are now defined using inductive_set.
berghofe
parents: 22422
diff changeset
  1153
              | decr (Const ("Transitive_Closure.tranclp", _ ) $ r)  = (r,"r+")
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1154
              | decr r = (r,"r");
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1155
            val (rel,r) = decr rel;
26801
244184661a09 - Function dec in Trancl_Tac must eta-contract relation before calling
berghofe
parents: 26340
diff changeset
  1156
        in SOME (a, b, rel, r) end
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1157
      | dec _ =  NONE
30107
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29609
diff changeset
  1158
    in dec t end
f3b3b0e3d184 Fixed nonexhaustive match problem in decomp, to make it fail more gracefully
berghofe
parents: 29609
diff changeset
  1159
    | decomp _ = NONE;
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1160
);
26340
a85fe32e7b2f more antiquotations;
wenzelm
parents: 26271
diff changeset
  1161
*}
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1162
42795
66fcc9882784 clarified map_simpset versus Simplifier.map_simpset_global;
wenzelm
parents: 41987
diff changeset
  1163
setup {*
66fcc9882784 clarified map_simpset versus Simplifier.map_simpset_global;
wenzelm
parents: 41987
diff changeset
  1164
  Simplifier.map_simpset_global (fn ss => ss
43596
78211f66cf8d simplified/unified Simplifier.mk_solver;
wenzelm
parents: 42795
diff changeset
  1165
    addSolver (mk_solver "Trancl" (Trancl_Tac.trancl_tac o Simplifier.the_context))
78211f66cf8d simplified/unified Simplifier.mk_solver;
wenzelm
parents: 42795
diff changeset
  1166
    addSolver (mk_solver "Rtrancl" (Trancl_Tac.rtrancl_tac o Simplifier.the_context))
78211f66cf8d simplified/unified Simplifier.mk_solver;
wenzelm
parents: 42795
diff changeset
  1167
    addSolver (mk_solver "Tranclp" (Tranclp_Tac.trancl_tac o Simplifier.the_context))
78211f66cf8d simplified/unified Simplifier.mk_solver;
wenzelm
parents: 42795
diff changeset
  1168
    addSolver (mk_solver "Rtranclp" (Tranclp_Tac.rtrancl_tac o Simplifier.the_context)))
15076
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1169
*}
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1170
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1171
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1172
text {* Optional methods. *}
15076
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1173
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1174
method_setup trancl =
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1175
  {* Scan.succeed (SIMPLE_METHOD' o Trancl_Tac.trancl_tac) *}
18372
2bffdf62fe7f tuned proofs;
wenzelm
parents: 17876
diff changeset
  1176
  {* simple transitivity reasoner *}
15076
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1177
method_setup rtrancl =
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1178
  {* Scan.succeed (SIMPLE_METHOD' o Trancl_Tac.rtrancl_tac) *}
15076
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1179
  {* simple transitivity reasoner *}
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1180
method_setup tranclp =
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1181
  {* Scan.succeed (SIMPLE_METHOD' o Tranclp_Tac.trancl_tac) *}
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1182
  {* simple transitivity reasoner (predicate version) *}
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1183
method_setup rtranclp =
32215
87806301a813 replaced old METAHYPS by FOCUS;
wenzelm
parents: 31970
diff changeset
  1184
  {* Scan.succeed (SIMPLE_METHOD' o Tranclp_Tac.rtrancl_tac) *}
22262
96ba62dff413 Adapted to new inductive definition package.
berghofe
parents: 22172
diff changeset
  1185
  {* simple transitivity reasoner (predicate version) *}
15076
4b3d280ef06a New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents: 14565
diff changeset
  1186
10213
01c2744a3786 *** empty log message ***
nipkow
parents:
diff changeset
  1187
end
46752
e9e7209eb375 more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents: 46664
diff changeset
  1188