src/HOL/Relation.thy
author noschinl
Mon Mar 12 15:12:22 2012 +0100 (2012-03-12)
changeset 46883 eec472dae593
parent 46882 6242b4bc05bc
child 46884 154dc6ec0041
permissions -rw-r--r--
tuned pred_set_conv lemmas. Skipped lemmas changing the lemmas generated by inductive_set
wenzelm@10358
     1
(*  Title:      HOL/Relation.thy
haftmann@46664
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory; Stefan Berghofer, TU Muenchen
nipkow@1128
     3
*)
nipkow@1128
     4
haftmann@46664
     5
header {* Relations – as sets of pairs, and binary predicates *}
berghofe@12905
     6
nipkow@15131
     7
theory Relation
haftmann@32850
     8
imports Datatype Finite_Set
nipkow@15131
     9
begin
paulson@5978
    10
haftmann@46694
    11
text {* A preliminary: classical rules for reasoning on predicates *}
haftmann@46664
    12
noschinl@46882
    13
declare predicate1I [Pure.intro!, intro!]
noschinl@46882
    14
declare predicate1D [Pure.dest, dest]
haftmann@46664
    15
declare predicate2I [Pure.intro!, intro!]
haftmann@46664
    16
declare predicate2D [Pure.dest, dest]
haftmann@46767
    17
declare bot1E [elim!] 
haftmann@46664
    18
declare bot2E [elim!]
haftmann@46664
    19
declare top1I [intro!]
haftmann@46664
    20
declare top2I [intro!]
haftmann@46664
    21
declare inf1I [intro!]
haftmann@46664
    22
declare inf2I [intro!]
haftmann@46664
    23
declare inf1E [elim!]
haftmann@46664
    24
declare inf2E [elim!]
haftmann@46664
    25
declare sup1I1 [intro?]
haftmann@46664
    26
declare sup2I1 [intro?]
haftmann@46664
    27
declare sup1I2 [intro?]
haftmann@46664
    28
declare sup2I2 [intro?]
haftmann@46664
    29
declare sup1E [elim!]
haftmann@46664
    30
declare sup2E [elim!]
haftmann@46664
    31
declare sup1CI [intro!]
haftmann@46664
    32
declare sup2CI [intro!]
haftmann@46664
    33
declare INF1_I [intro!]
haftmann@46664
    34
declare INF2_I [intro!]
haftmann@46664
    35
declare INF1_D [elim]
haftmann@46664
    36
declare INF2_D [elim]
haftmann@46664
    37
declare INF1_E [elim]
haftmann@46664
    38
declare INF2_E [elim]
haftmann@46664
    39
declare SUP1_I [intro]
haftmann@46664
    40
declare SUP2_I [intro]
haftmann@46664
    41
declare SUP1_E [elim!]
haftmann@46664
    42
declare SUP2_E [elim!]
haftmann@46664
    43
haftmann@46694
    44
subsection {* Fundamental *}
haftmann@46664
    45
haftmann@46694
    46
subsubsection {* Relations as sets of pairs *}
haftmann@46694
    47
haftmann@46694
    48
type_synonym 'a rel = "('a * 'a) set"
haftmann@46694
    49
haftmann@46694
    50
lemma subrelI: -- {* Version of @{thm [source] subsetI} for binary relations *}
haftmann@46694
    51
  "(\<And>x y. (x, y) \<in> r \<Longrightarrow> (x, y) \<in> s) \<Longrightarrow> r \<subseteq> s"
haftmann@46694
    52
  by auto
haftmann@46694
    53
haftmann@46694
    54
lemma lfp_induct2: -- {* Version of @{thm [source] lfp_induct} for binary relations *}
haftmann@46694
    55
  "(a, b) \<in> lfp f \<Longrightarrow> mono f \<Longrightarrow>
haftmann@46694
    56
    (\<And>a b. (a, b) \<in> f (lfp f \<inter> {(x, y). P x y}) \<Longrightarrow> P a b) \<Longrightarrow> P a b"
haftmann@46694
    57
  using lfp_induct_set [of "(a, b)" f "prod_case P"] by auto
haftmann@46694
    58
haftmann@46694
    59
haftmann@46694
    60
subsubsection {* Conversions between set and predicate relations *}
haftmann@46664
    61
haftmann@46833
    62
lemma pred_equals_eq [pred_set_conv]: "(\<lambda>x. x \<in> R) = (\<lambda>x. x \<in> S) \<longleftrightarrow> R = S"
haftmann@46664
    63
  by (simp add: set_eq_iff fun_eq_iff)
haftmann@46664
    64
haftmann@46833
    65
lemma pred_equals_eq2 [pred_set_conv]: "(\<lambda>x y. (x, y) \<in> R) = (\<lambda>x y. (x, y) \<in> S) \<longleftrightarrow> R = S"
haftmann@46664
    66
  by (simp add: set_eq_iff fun_eq_iff)
haftmann@46664
    67
haftmann@46833
    68
lemma pred_subset_eq [pred_set_conv]: "(\<lambda>x. x \<in> R) \<le> (\<lambda>x. x \<in> S) \<longleftrightarrow> R \<subseteq> S"
haftmann@46664
    69
  by (simp add: subset_iff le_fun_def)
haftmann@46664
    70
haftmann@46833
    71
lemma pred_subset_eq2 [pred_set_conv]: "(\<lambda>x y. (x, y) \<in> R) \<le> (\<lambda>x y. (x, y) \<in> S) \<longleftrightarrow> R \<subseteq> S"
haftmann@46664
    72
  by (simp add: subset_iff le_fun_def)
haftmann@46664
    73
noschinl@46883
    74
lemma bot_empty_eq [pred_set_conv]: "\<bottom> = (\<lambda>x. x \<in> {})"
haftmann@46689
    75
  by (auto simp add: fun_eq_iff)
haftmann@46689
    76
noschinl@46883
    77
lemma bot_empty_eq2 [pred_set_conv]: "\<bottom> = (\<lambda>x y. (x, y) \<in> {})"
haftmann@46664
    78
  by (auto simp add: fun_eq_iff)
haftmann@46664
    79
noschinl@46883
    80
lemma top_empty_eq [pred_set_conv]: "\<top> = (\<lambda>x. x \<in> UNIV)"
noschinl@46883
    81
  by (auto simp add: fun_eq_iff)
haftmann@46689
    82
noschinl@46883
    83
lemma top_empty_eq2 [pred_set_conv]: "\<top> = (\<lambda>x y. (x, y) \<in> UNIV)"
noschinl@46883
    84
  by (auto simp add: fun_eq_iff)
haftmann@46664
    85
haftmann@46664
    86
lemma inf_Int_eq [pred_set_conv]: "(\<lambda>x. x \<in> R) \<sqinter> (\<lambda>x. x \<in> S) = (\<lambda>x. x \<in> R \<inter> S)"
haftmann@46664
    87
  by (simp add: inf_fun_def)
haftmann@46664
    88
haftmann@46664
    89
lemma inf_Int_eq2 [pred_set_conv]: "(\<lambda>x y. (x, y) \<in> R) \<sqinter> (\<lambda>x y. (x, y) \<in> S) = (\<lambda>x y. (x, y) \<in> R \<inter> S)"
haftmann@46664
    90
  by (simp add: inf_fun_def)
haftmann@46664
    91
haftmann@46664
    92
lemma sup_Un_eq [pred_set_conv]: "(\<lambda>x. x \<in> R) \<squnion> (\<lambda>x. x \<in> S) = (\<lambda>x. x \<in> R \<union> S)"
haftmann@46664
    93
  by (simp add: sup_fun_def)
haftmann@46664
    94
haftmann@46664
    95
lemma sup_Un_eq2 [pred_set_conv]: "(\<lambda>x y. (x, y) \<in> R) \<squnion> (\<lambda>x y. (x, y) \<in> S) = (\<lambda>x y. (x, y) \<in> R \<union> S)"
haftmann@46664
    96
  by (simp add: sup_fun_def)
haftmann@46664
    97
haftmann@46833
    98
lemma Inf_INT_eq [pred_set_conv]: "\<Sqinter>S = (\<lambda>x. x \<in> INTER S Collect)"
haftmann@46833
    99
  by (simp add: fun_eq_iff Inf_apply)
haftmann@46833
   100
haftmann@46833
   101
lemma INF_Int_eq [pred_set_conv]: "(\<Sqinter>i\<in>S. (\<lambda>x. x \<in> i)) = (\<lambda>x. x \<in> \<Inter>S)"
haftmann@46833
   102
  by (simp add: fun_eq_iff INF_apply)
haftmann@46833
   103
haftmann@46833
   104
lemma Inf_INT_eq2 [pred_set_conv]: "\<Sqinter>S = (\<lambda>x y. (x, y) \<in> INTER (prod_case ` S) Collect)"
haftmann@46833
   105
  by (simp add: fun_eq_iff Inf_apply INF_apply)
haftmann@46833
   106
haftmann@46833
   107
lemma INF_Int_eq2 [pred_set_conv]: "(\<Sqinter>i\<in>S. (\<lambda>x y. (x, y) \<in> i)) = (\<lambda>x y. (x, y) \<in> \<Inter>S)"
haftmann@46833
   108
  by (simp add: fun_eq_iff INF_apply)
haftmann@46833
   109
haftmann@46833
   110
lemma Sup_SUP_eq [pred_set_conv]: "\<Squnion>S = (\<lambda>x. x \<in> UNION S Collect)"
haftmann@46833
   111
  by (simp add: fun_eq_iff Sup_apply)
haftmann@46833
   112
haftmann@46833
   113
lemma SUP_Sup_eq [pred_set_conv]: "(\<Squnion>i\<in>S. (\<lambda>x. x \<in> i)) = (\<lambda>x. x \<in> \<Union>S)"
haftmann@46833
   114
  by (simp add: fun_eq_iff SUP_apply)
haftmann@46833
   115
haftmann@46833
   116
lemma Sup_SUP_eq2 [pred_set_conv]: "\<Squnion>S = (\<lambda>x y. (x, y) \<in> UNION (prod_case ` S) Collect)"
haftmann@46833
   117
  by (simp add: fun_eq_iff Sup_apply SUP_apply)
haftmann@46833
   118
haftmann@46833
   119
lemma SUP_Sup_eq2 [pred_set_conv]: "(\<Squnion>i\<in>S. (\<lambda>x y. (x, y) \<in> i)) = (\<lambda>x y. (x, y) \<in> \<Union>S)"
haftmann@46833
   120
  by (simp add: fun_eq_iff SUP_apply)
haftmann@46833
   121
noschinl@46883
   122
lemma INF_INT_eq [pred_set_conv]: "(\<Sqinter>i. (\<lambda>x. x \<in> r i)) = (\<lambda>x. x \<in> (\<Inter>i. r i))"
haftmann@46833
   123
  by (simp add: INF_apply fun_eq_iff)
haftmann@46833
   124
haftmann@46833
   125
lemma INF_INT_eq2 [pred_set_conv]: "(\<Sqinter>i\<in>S. (\<lambda>x y. (x, y) \<in> r i)) = (\<lambda>x y. (x, y) \<in> (\<Inter>i\<in>S. r i))"
haftmann@46833
   126
  by (simp add: INF_apply fun_eq_iff)
haftmann@46833
   127
noschinl@46883
   128
lemma SUP_UN_eq [pred_set_conv]: "(\<Squnion>i. (\<lambda>x. x \<in> r i)) = (\<lambda>x. x \<in> (\<Union>i. r i))"
haftmann@46833
   129
  by (simp add: SUP_apply fun_eq_iff)
haftmann@46833
   130
haftmann@46833
   131
lemma SUP_UN_eq2 [pred_set_conv]: "(\<Squnion>i\<in>S. (\<lambda>x y. (x, y) \<in> r i)) = (\<lambda>x y. (x, y) \<in> (\<Union>i\<in>S. r i))"
haftmann@46833
   132
  by (simp add: SUP_apply fun_eq_iff)
haftmann@46833
   133
haftmann@46664
   134
haftmann@46664
   135
haftmann@46694
   136
subsection {* Properties of relations *}
paulson@5978
   137
haftmann@46692
   138
subsubsection {* Reflexivity *}
paulson@10786
   139
haftmann@46752
   140
definition refl_on :: "'a set \<Rightarrow> 'a rel \<Rightarrow> bool"
haftmann@46752
   141
where
haftmann@46752
   142
  "refl_on A r \<longleftrightarrow> r \<subseteq> A \<times> A \<and> (\<forall>x\<in>A. (x, x) \<in> r)"
paulson@6806
   143
haftmann@46752
   144
abbreviation refl :: "'a rel \<Rightarrow> bool"
haftmann@46752
   145
where -- {* reflexivity over a type *}
haftmann@45137
   146
  "refl \<equiv> refl_on UNIV"
nipkow@26297
   147
haftmann@46752
   148
definition reflp :: "('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> bool"
haftmann@46752
   149
where
haftmann@46694
   150
  "reflp r \<longleftrightarrow> refl {(x, y). r x y}"
haftmann@46694
   151
haftmann@46752
   152
lemma reflp_refl_eq [pred_set_conv]:
haftmann@46752
   153
  "reflp (\<lambda>x y. (x, y) \<in> r) \<longleftrightarrow> refl r" 
haftmann@46752
   154
  by (simp add: refl_on_def reflp_def)
haftmann@46752
   155
haftmann@46692
   156
lemma refl_onI: "r \<subseteq> A \<times> A ==> (!!x. x : A ==> (x, x) : r) ==> refl_on A r"
haftmann@46752
   157
  by (unfold refl_on_def) (iprover intro!: ballI)
haftmann@46692
   158
haftmann@46692
   159
lemma refl_onD: "refl_on A r ==> a : A ==> (a, a) : r"
haftmann@46752
   160
  by (unfold refl_on_def) blast
haftmann@46692
   161
haftmann@46692
   162
lemma refl_onD1: "refl_on A r ==> (x, y) : r ==> x : A"
haftmann@46752
   163
  by (unfold refl_on_def) blast
haftmann@46692
   164
haftmann@46692
   165
lemma refl_onD2: "refl_on A r ==> (x, y) : r ==> y : A"
haftmann@46752
   166
  by (unfold refl_on_def) blast
haftmann@46692
   167
haftmann@46694
   168
lemma reflpI:
haftmann@46694
   169
  "(\<And>x. r x x) \<Longrightarrow> reflp r"
haftmann@46694
   170
  by (auto intro: refl_onI simp add: reflp_def)
haftmann@46694
   171
haftmann@46694
   172
lemma reflpE:
haftmann@46694
   173
  assumes "reflp r"
haftmann@46694
   174
  obtains "r x x"
haftmann@46694
   175
  using assms by (auto dest: refl_onD simp add: reflp_def)
haftmann@46694
   176
haftmann@46692
   177
lemma refl_on_Int: "refl_on A r ==> refl_on B s ==> refl_on (A \<inter> B) (r \<inter> s)"
haftmann@46752
   178
  by (unfold refl_on_def) blast
haftmann@46752
   179
haftmann@46752
   180
lemma reflp_inf:
haftmann@46752
   181
  "reflp r \<Longrightarrow> reflp s \<Longrightarrow> reflp (r \<sqinter> s)"
haftmann@46752
   182
  by (auto intro: reflpI elim: reflpE)
haftmann@46692
   183
haftmann@46692
   184
lemma refl_on_Un: "refl_on A r ==> refl_on B s ==> refl_on (A \<union> B) (r \<union> s)"
haftmann@46752
   185
  by (unfold refl_on_def) blast
haftmann@46752
   186
haftmann@46752
   187
lemma reflp_sup:
haftmann@46752
   188
  "reflp r \<Longrightarrow> reflp s \<Longrightarrow> reflp (r \<squnion> s)"
haftmann@46752
   189
  by (auto intro: reflpI elim: reflpE)
haftmann@46692
   190
haftmann@46692
   191
lemma refl_on_INTER:
haftmann@46692
   192
  "ALL x:S. refl_on (A x) (r x) ==> refl_on (INTER S A) (INTER S r)"
haftmann@46752
   193
  by (unfold refl_on_def) fast
haftmann@46692
   194
haftmann@46692
   195
lemma refl_on_UNION:
haftmann@46692
   196
  "ALL x:S. refl_on (A x) (r x) \<Longrightarrow> refl_on (UNION S A) (UNION S r)"
haftmann@46752
   197
  by (unfold refl_on_def) blast
haftmann@46692
   198
haftmann@46752
   199
lemma refl_on_empty [simp]: "refl_on {} {}"
haftmann@46752
   200
  by (simp add:refl_on_def)
haftmann@46692
   201
haftmann@46692
   202
lemma refl_on_def' [nitpick_unfold, code]:
haftmann@46752
   203
  "refl_on A r \<longleftrightarrow> (\<forall>(x, y) \<in> r. x \<in> A \<and> y \<in> A) \<and> (\<forall>x \<in> A. (x, x) \<in> r)"
haftmann@46752
   204
  by (auto intro: refl_onI dest: refl_onD refl_onD1 refl_onD2)
haftmann@46692
   205
haftmann@46692
   206
haftmann@46694
   207
subsubsection {* Irreflexivity *}
paulson@6806
   208
haftmann@46752
   209
definition irrefl :: "'a rel \<Rightarrow> bool"
haftmann@46752
   210
where
haftmann@46752
   211
  "irrefl r \<longleftrightarrow> (\<forall>x. (x, x) \<notin> r)"
haftmann@46692
   212
haftmann@46694
   213
lemma irrefl_distinct [code]:
haftmann@46694
   214
  "irrefl r \<longleftrightarrow> (\<forall>(x, y) \<in> r. x \<noteq> y)"
haftmann@46694
   215
  by (auto simp add: irrefl_def)
haftmann@46692
   216
haftmann@46692
   217
haftmann@46692
   218
subsubsection {* Symmetry *}
haftmann@46692
   219
haftmann@46752
   220
definition sym :: "'a rel \<Rightarrow> bool"
haftmann@46752
   221
where
haftmann@46752
   222
  "sym r \<longleftrightarrow> (\<forall>x y. (x, y) \<in> r \<longrightarrow> (y, x) \<in> r)"
haftmann@46752
   223
haftmann@46752
   224
definition symp :: "('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> bool"
haftmann@46752
   225
where
haftmann@46752
   226
  "symp r \<longleftrightarrow> (\<forall>x y. r x y \<longrightarrow> r y x)"
haftmann@46692
   227
haftmann@46752
   228
lemma symp_sym_eq [pred_set_conv]:
haftmann@46752
   229
  "symp (\<lambda>x y. (x, y) \<in> r) \<longleftrightarrow> sym r" 
haftmann@46752
   230
  by (simp add: sym_def symp_def)
haftmann@46692
   231
haftmann@46752
   232
lemma symI:
haftmann@46752
   233
  "(\<And>a b. (a, b) \<in> r \<Longrightarrow> (b, a) \<in> r) \<Longrightarrow> sym r"
haftmann@46752
   234
  by (unfold sym_def) iprover
haftmann@46694
   235
haftmann@46694
   236
lemma sympI:
haftmann@46752
   237
  "(\<And>a b. r a b \<Longrightarrow> r b a) \<Longrightarrow> symp r"
haftmann@46752
   238
  by (fact symI [to_pred])
haftmann@46752
   239
haftmann@46752
   240
lemma symE:
haftmann@46752
   241
  assumes "sym r" and "(b, a) \<in> r"
haftmann@46752
   242
  obtains "(a, b) \<in> r"
haftmann@46752
   243
  using assms by (simp add: sym_def)
haftmann@46694
   244
haftmann@46694
   245
lemma sympE:
haftmann@46752
   246
  assumes "symp r" and "r b a"
haftmann@46752
   247
  obtains "r a b"
haftmann@46752
   248
  using assms by (rule symE [to_pred])
haftmann@46752
   249
haftmann@46752
   250
lemma symD:
haftmann@46752
   251
  assumes "sym r" and "(b, a) \<in> r"
haftmann@46752
   252
  shows "(a, b) \<in> r"
haftmann@46752
   253
  using assms by (rule symE)
haftmann@46694
   254
haftmann@46752
   255
lemma sympD:
haftmann@46752
   256
  assumes "symp r" and "r b a"
haftmann@46752
   257
  shows "r a b"
haftmann@46752
   258
  using assms by (rule symD [to_pred])
haftmann@46752
   259
haftmann@46752
   260
lemma sym_Int:
haftmann@46752
   261
  "sym r \<Longrightarrow> sym s \<Longrightarrow> sym (r \<inter> s)"
haftmann@46752
   262
  by (fast intro: symI elim: symE)
haftmann@46692
   263
haftmann@46752
   264
lemma symp_inf:
haftmann@46752
   265
  "symp r \<Longrightarrow> symp s \<Longrightarrow> symp (r \<sqinter> s)"
haftmann@46752
   266
  by (fact sym_Int [to_pred])
haftmann@46752
   267
haftmann@46752
   268
lemma sym_Un:
haftmann@46752
   269
  "sym r \<Longrightarrow> sym s \<Longrightarrow> sym (r \<union> s)"
haftmann@46752
   270
  by (fast intro: symI elim: symE)
haftmann@46752
   271
haftmann@46752
   272
lemma symp_sup:
haftmann@46752
   273
  "symp r \<Longrightarrow> symp s \<Longrightarrow> symp (r \<squnion> s)"
haftmann@46752
   274
  by (fact sym_Un [to_pred])
haftmann@46692
   275
haftmann@46752
   276
lemma sym_INTER:
haftmann@46752
   277
  "\<forall>x\<in>S. sym (r x) \<Longrightarrow> sym (INTER S r)"
haftmann@46752
   278
  by (fast intro: symI elim: symE)
haftmann@46752
   279
haftmann@46752
   280
(* FIXME thm sym_INTER [to_pred] *)
haftmann@46692
   281
haftmann@46752
   282
lemma sym_UNION:
haftmann@46752
   283
  "\<forall>x\<in>S. sym (r x) \<Longrightarrow> sym (UNION S r)"
haftmann@46752
   284
  by (fast intro: symI elim: symE)
haftmann@46752
   285
haftmann@46752
   286
(* FIXME thm sym_UNION [to_pred] *)
haftmann@46692
   287
haftmann@46692
   288
haftmann@46694
   289
subsubsection {* Antisymmetry *}
haftmann@46694
   290
haftmann@46752
   291
definition antisym :: "'a rel \<Rightarrow> bool"
haftmann@46752
   292
where
haftmann@46752
   293
  "antisym r \<longleftrightarrow> (\<forall>x y. (x, y) \<in> r \<longrightarrow> (y, x) \<in> r \<longrightarrow> x = y)"
haftmann@46752
   294
haftmann@46752
   295
abbreviation antisymP :: "('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> bool"
haftmann@46752
   296
where
haftmann@46752
   297
  "antisymP r \<equiv> antisym {(x, y). r x y}"
haftmann@46694
   298
haftmann@46694
   299
lemma antisymI:
haftmann@46694
   300
  "(!!x y. (x, y) : r ==> (y, x) : r ==> x=y) ==> antisym r"
haftmann@46752
   301
  by (unfold antisym_def) iprover
haftmann@46694
   302
haftmann@46694
   303
lemma antisymD: "antisym r ==> (a, b) : r ==> (b, a) : r ==> a = b"
haftmann@46752
   304
  by (unfold antisym_def) iprover
haftmann@46694
   305
haftmann@46694
   306
lemma antisym_subset: "r \<subseteq> s ==> antisym s ==> antisym r"
haftmann@46752
   307
  by (unfold antisym_def) blast
haftmann@46694
   308
haftmann@46694
   309
lemma antisym_empty [simp]: "antisym {}"
haftmann@46752
   310
  by (unfold antisym_def) blast
haftmann@46694
   311
haftmann@46694
   312
haftmann@46692
   313
subsubsection {* Transitivity *}
haftmann@46692
   314
haftmann@46752
   315
definition trans :: "'a rel \<Rightarrow> bool"
haftmann@46752
   316
where
haftmann@46752
   317
  "trans r \<longleftrightarrow> (\<forall>x y z. (x, y) \<in> r \<longrightarrow> (y, z) \<in> r \<longrightarrow> (x, z) \<in> r)"
haftmann@46752
   318
haftmann@46752
   319
definition transp :: "('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> bool"
haftmann@46752
   320
where
haftmann@46752
   321
  "transp r \<longleftrightarrow> (\<forall>x y z. r x y \<longrightarrow> r y z \<longrightarrow> r x z)"
haftmann@46752
   322
haftmann@46752
   323
lemma transp_trans_eq [pred_set_conv]:
haftmann@46752
   324
  "transp (\<lambda>x y. (x, y) \<in> r) \<longleftrightarrow> trans r" 
haftmann@46752
   325
  by (simp add: trans_def transp_def)
haftmann@46752
   326
haftmann@46752
   327
abbreviation transP :: "('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> bool"
haftmann@46752
   328
where -- {* FIXME drop *}
haftmann@46752
   329
  "transP r \<equiv> trans {(x, y). r x y}"
paulson@5978
   330
haftmann@46692
   331
lemma transI:
haftmann@46752
   332
  "(\<And>x y z. (x, y) \<in> r \<Longrightarrow> (y, z) \<in> r \<Longrightarrow> (x, z) \<in> r) \<Longrightarrow> trans r"
haftmann@46752
   333
  by (unfold trans_def) iprover
haftmann@46694
   334
haftmann@46694
   335
lemma transpI:
haftmann@46694
   336
  "(\<And>x y z. r x y \<Longrightarrow> r y z \<Longrightarrow> r x z) \<Longrightarrow> transp r"
haftmann@46752
   337
  by (fact transI [to_pred])
haftmann@46752
   338
haftmann@46752
   339
lemma transE:
haftmann@46752
   340
  assumes "trans r" and "(x, y) \<in> r" and "(y, z) \<in> r"
haftmann@46752
   341
  obtains "(x, z) \<in> r"
haftmann@46752
   342
  using assms by (unfold trans_def) iprover
haftmann@46752
   343
haftmann@46694
   344
lemma transpE:
haftmann@46694
   345
  assumes "transp r" and "r x y" and "r y z"
haftmann@46694
   346
  obtains "r x z"
haftmann@46752
   347
  using assms by (rule transE [to_pred])
haftmann@46752
   348
haftmann@46752
   349
lemma transD:
haftmann@46752
   350
  assumes "trans r" and "(x, y) \<in> r" and "(y, z) \<in> r"
haftmann@46752
   351
  shows "(x, z) \<in> r"
haftmann@46752
   352
  using assms by (rule transE)
haftmann@46752
   353
haftmann@46752
   354
lemma transpD:
haftmann@46752
   355
  assumes "transp r" and "r x y" and "r y z"
haftmann@46752
   356
  shows "r x z"
haftmann@46752
   357
  using assms by (rule transD [to_pred])
haftmann@46694
   358
haftmann@46752
   359
lemma trans_Int:
haftmann@46752
   360
  "trans r \<Longrightarrow> trans s \<Longrightarrow> trans (r \<inter> s)"
haftmann@46752
   361
  by (fast intro: transI elim: transE)
haftmann@46692
   362
haftmann@46752
   363
lemma transp_inf:
haftmann@46752
   364
  "transp r \<Longrightarrow> transp s \<Longrightarrow> transp (r \<sqinter> s)"
haftmann@46752
   365
  by (fact trans_Int [to_pred])
haftmann@46752
   366
haftmann@46752
   367
lemma trans_INTER:
haftmann@46752
   368
  "\<forall>x\<in>S. trans (r x) \<Longrightarrow> trans (INTER S r)"
haftmann@46752
   369
  by (fast intro: transI elim: transD)
haftmann@46752
   370
haftmann@46752
   371
(* FIXME thm trans_INTER [to_pred] *)
haftmann@46692
   372
haftmann@46694
   373
lemma trans_join [code]:
haftmann@46694
   374
  "trans r \<longleftrightarrow> (\<forall>(x, y1) \<in> r. \<forall>(y2, z) \<in> r. y1 = y2 \<longrightarrow> (x, z) \<in> r)"
haftmann@46694
   375
  by (auto simp add: trans_def)
haftmann@46692
   376
haftmann@46752
   377
lemma transp_trans:
haftmann@46752
   378
  "transp r \<longleftrightarrow> trans {(x, y). r x y}"
haftmann@46752
   379
  by (simp add: trans_def transp_def)
haftmann@46752
   380
haftmann@46692
   381
haftmann@46692
   382
subsubsection {* Totality *}
haftmann@46692
   383
haftmann@46752
   384
definition total_on :: "'a set \<Rightarrow> 'a rel \<Rightarrow> bool"
haftmann@46752
   385
where
haftmann@46752
   386
  "total_on A r \<longleftrightarrow> (\<forall>x\<in>A. \<forall>y\<in>A. x \<noteq> y \<longrightarrow> (x, y) \<in> r \<or> (y, x) \<in> r)"
nipkow@29859
   387
nipkow@29859
   388
abbreviation "total \<equiv> total_on UNIV"
nipkow@29859
   389
haftmann@46752
   390
lemma total_on_empty [simp]: "total_on {} r"
haftmann@46752
   391
  by (simp add: total_on_def)
haftmann@46692
   392
haftmann@46692
   393
haftmann@46692
   394
subsubsection {* Single valued relations *}
haftmann@46692
   395
haftmann@46752
   396
definition single_valued :: "('a \<times> 'b) set \<Rightarrow> bool"
haftmann@46752
   397
where
haftmann@46752
   398
  "single_valued r \<longleftrightarrow> (\<forall>x y. (x, y) \<in> r \<longrightarrow> (\<forall>z. (x, z) \<in> r \<longrightarrow> y = z))"
haftmann@46692
   399
haftmann@46694
   400
abbreviation single_valuedP :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> bool" where
haftmann@46694
   401
  "single_valuedP r \<equiv> single_valued {(x, y). r x y}"
haftmann@46694
   402
haftmann@46752
   403
lemma single_valuedI:
haftmann@46752
   404
  "ALL x y. (x,y):r --> (ALL z. (x,z):r --> y=z) ==> single_valued r"
haftmann@46752
   405
  by (unfold single_valued_def)
haftmann@46752
   406
haftmann@46752
   407
lemma single_valuedD:
haftmann@46752
   408
  "single_valued r ==> (x, y) : r ==> (x, z) : r ==> y = z"
haftmann@46752
   409
  by (simp add: single_valued_def)
haftmann@46752
   410
haftmann@46692
   411
lemma single_valued_subset:
haftmann@46692
   412
  "r \<subseteq> s ==> single_valued s ==> single_valued r"
haftmann@46752
   413
  by (unfold single_valued_def) blast
oheimb@11136
   414
berghofe@12905
   415
haftmann@46694
   416
subsection {* Relation operations *}
haftmann@46694
   417
haftmann@46664
   418
subsubsection {* The identity relation *}
berghofe@12905
   419
haftmann@46752
   420
definition Id :: "'a rel"
haftmann@46752
   421
where
haftmann@46752
   422
  "Id = {p. \<exists>x. p = (x, x)}"
haftmann@46692
   423
berghofe@12905
   424
lemma IdI [intro]: "(a, a) : Id"
haftmann@46752
   425
  by (simp add: Id_def)
berghofe@12905
   426
berghofe@12905
   427
lemma IdE [elim!]: "p : Id ==> (!!x. p = (x, x) ==> P) ==> P"
haftmann@46752
   428
  by (unfold Id_def) (iprover elim: CollectE)
berghofe@12905
   429
berghofe@12905
   430
lemma pair_in_Id_conv [iff]: "((a, b) : Id) = (a = b)"
haftmann@46752
   431
  by (unfold Id_def) blast
berghofe@12905
   432
nipkow@30198
   433
lemma refl_Id: "refl Id"
haftmann@46752
   434
  by (simp add: refl_on_def)
berghofe@12905
   435
berghofe@12905
   436
lemma antisym_Id: "antisym Id"
berghofe@12905
   437
  -- {* A strange result, since @{text Id} is also symmetric. *}
haftmann@46752
   438
  by (simp add: antisym_def)
berghofe@12905
   439
huffman@19228
   440
lemma sym_Id: "sym Id"
haftmann@46752
   441
  by (simp add: sym_def)
huffman@19228
   442
berghofe@12905
   443
lemma trans_Id: "trans Id"
haftmann@46752
   444
  by (simp add: trans_def)
berghofe@12905
   445
haftmann@46692
   446
lemma single_valued_Id [simp]: "single_valued Id"
haftmann@46692
   447
  by (unfold single_valued_def) blast
haftmann@46692
   448
haftmann@46692
   449
lemma irrefl_diff_Id [simp]: "irrefl (r - Id)"
haftmann@46692
   450
  by (simp add:irrefl_def)
haftmann@46692
   451
haftmann@46692
   452
lemma trans_diff_Id: "trans r \<Longrightarrow> antisym r \<Longrightarrow> trans (r - Id)"
haftmann@46692
   453
  unfolding antisym_def trans_def by blast
haftmann@46692
   454
haftmann@46692
   455
lemma total_on_diff_Id [simp]: "total_on A (r - Id) = total_on A r"
haftmann@46692
   456
  by (simp add: total_on_def)
haftmann@46692
   457
berghofe@12905
   458
haftmann@46664
   459
subsubsection {* Diagonal: identity over a set *}
berghofe@12905
   460
haftmann@46752
   461
definition Id_on  :: "'a set \<Rightarrow> 'a rel"
haftmann@46752
   462
where
haftmann@46752
   463
  "Id_on A = (\<Union>x\<in>A. {(x, x)})"
haftmann@46692
   464
nipkow@30198
   465
lemma Id_on_empty [simp]: "Id_on {} = {}"
haftmann@46752
   466
  by (simp add: Id_on_def) 
paulson@13812
   467
nipkow@30198
   468
lemma Id_on_eqI: "a = b ==> a : A ==> (a, b) : Id_on A"
haftmann@46752
   469
  by (simp add: Id_on_def)
berghofe@12905
   470
blanchet@35828
   471
lemma Id_onI [intro!,no_atp]: "a : A ==> (a, a) : Id_on A"
haftmann@46752
   472
  by (rule Id_on_eqI) (rule refl)
berghofe@12905
   473
nipkow@30198
   474
lemma Id_onE [elim!]:
nipkow@30198
   475
  "c : Id_on A ==> (!!x. x : A ==> c = (x, x) ==> P) ==> P"
wenzelm@12913
   476
  -- {* The general elimination rule. *}
haftmann@46752
   477
  by (unfold Id_on_def) (iprover elim!: UN_E singletonE)
berghofe@12905
   478
nipkow@30198
   479
lemma Id_on_iff: "((x, y) : Id_on A) = (x = y & x : A)"
haftmann@46752
   480
  by blast
berghofe@12905
   481
haftmann@45967
   482
lemma Id_on_def' [nitpick_unfold]:
haftmann@44278
   483
  "Id_on {x. A x} = Collect (\<lambda>(x, y). x = y \<and> A x)"
haftmann@46752
   484
  by auto
bulwahn@40923
   485
nipkow@30198
   486
lemma Id_on_subset_Times: "Id_on A \<subseteq> A \<times> A"
haftmann@46752
   487
  by blast
berghofe@12905
   488
haftmann@46692
   489
lemma refl_on_Id_on: "refl_on A (Id_on A)"
haftmann@46752
   490
  by (rule refl_onI [OF Id_on_subset_Times Id_onI])
haftmann@46692
   491
haftmann@46692
   492
lemma antisym_Id_on [simp]: "antisym (Id_on A)"
haftmann@46752
   493
  by (unfold antisym_def) blast
haftmann@46692
   494
haftmann@46692
   495
lemma sym_Id_on [simp]: "sym (Id_on A)"
haftmann@46752
   496
  by (rule symI) clarify
haftmann@46692
   497
haftmann@46692
   498
lemma trans_Id_on [simp]: "trans (Id_on A)"
haftmann@46752
   499
  by (fast intro: transI elim: transD)
haftmann@46692
   500
haftmann@46692
   501
lemma single_valued_Id_on [simp]: "single_valued (Id_on A)"
haftmann@46692
   502
  by (unfold single_valued_def) blast
haftmann@46692
   503
berghofe@12905
   504
haftmann@46694
   505
subsubsection {* Composition *}
berghofe@12905
   506
haftmann@46752
   507
inductive_set rel_comp  :: "('a \<times> 'b) set \<Rightarrow> ('b \<times> 'c) set \<Rightarrow> ('a \<times> 'c) set" (infixr "O" 75)
haftmann@46752
   508
  for r :: "('a \<times> 'b) set" and s :: "('b \<times> 'c) set"
haftmann@46694
   509
where
haftmann@46752
   510
  rel_compI [intro]: "(a, b) \<in> r \<Longrightarrow> (b, c) \<in> s \<Longrightarrow> (a, c) \<in> r O s"
haftmann@46692
   511
haftmann@46752
   512
abbreviation pred_comp (infixr "OO" 75) where
haftmann@46752
   513
  "pred_comp \<equiv> rel_compp"
berghofe@12905
   514
haftmann@46752
   515
lemmas pred_compI = rel_compp.intros
berghofe@12905
   516
haftmann@46752
   517
text {*
haftmann@46752
   518
  For historic reasons, the elimination rules are not wholly corresponding.
haftmann@46752
   519
  Feel free to consolidate this.
haftmann@46752
   520
*}
haftmann@46694
   521
haftmann@46752
   522
inductive_cases rel_compEpair: "(a, c) \<in> r O s"
haftmann@46694
   523
inductive_cases pred_compE [elim!]: "(r OO s) a c"
haftmann@46694
   524
haftmann@46752
   525
lemma rel_compE [elim!]: "xz \<in> r O s \<Longrightarrow>
haftmann@46752
   526
  (\<And>x y z. xz = (x, z) \<Longrightarrow> (x, y) \<in> r \<Longrightarrow> (y, z) \<in> s  \<Longrightarrow> P) \<Longrightarrow> P"
haftmann@46752
   527
  by (cases xz) (simp, erule rel_compEpair, iprover)
haftmann@46752
   528
haftmann@46752
   529
lemmas pred_comp_rel_comp_eq = rel_compp_rel_comp_eq
haftmann@46752
   530
haftmann@46752
   531
lemma R_O_Id [simp]:
haftmann@46752
   532
  "R O Id = R"
haftmann@46752
   533
  by fast
haftmann@46694
   534
haftmann@46752
   535
lemma Id_O_R [simp]:
haftmann@46752
   536
  "Id O R = R"
haftmann@46752
   537
  by fast
haftmann@46752
   538
haftmann@46752
   539
lemma rel_comp_empty1 [simp]:
haftmann@46752
   540
  "{} O R = {}"
haftmann@46752
   541
  by blast
berghofe@12905
   542
noschinl@46883
   543
lemma prod_comp_bot1 [simp]:
noschinl@46883
   544
  "\<bottom> OO R = \<bottom>"
noschinl@46883
   545
  by (fact rel_comp_empty1 [to_pred])
berghofe@12905
   546
haftmann@46752
   547
lemma rel_comp_empty2 [simp]:
haftmann@46752
   548
  "R O {} = {}"
haftmann@46752
   549
  by blast
berghofe@12905
   550
noschinl@46883
   551
lemma pred_comp_bot2 [simp]:
noschinl@46883
   552
  "R OO \<bottom> = \<bottom>"
noschinl@46883
   553
  by (fact rel_comp_empty2 [to_pred])
krauss@23185
   554
haftmann@46752
   555
lemma O_assoc:
haftmann@46752
   556
  "(R O S) O T = R O (S O T)"
haftmann@46752
   557
  by blast
haftmann@46752
   558
noschinl@46883
   559
haftmann@46752
   560
lemma pred_comp_assoc:
haftmann@46752
   561
  "(r OO s) OO t = r OO (s OO t)"
haftmann@46752
   562
  by (fact O_assoc [to_pred])
krauss@23185
   563
haftmann@46752
   564
lemma trans_O_subset:
haftmann@46752
   565
  "trans r \<Longrightarrow> r O r \<subseteq> r"
haftmann@46752
   566
  by (unfold trans_def) blast
haftmann@46752
   567
haftmann@46752
   568
lemma transp_pred_comp_less_eq:
haftmann@46752
   569
  "transp r \<Longrightarrow> r OO r \<le> r "
haftmann@46752
   570
  by (fact trans_O_subset [to_pred])
berghofe@12905
   571
haftmann@46752
   572
lemma rel_comp_mono:
haftmann@46752
   573
  "r' \<subseteq> r \<Longrightarrow> s' \<subseteq> s \<Longrightarrow> r' O s' \<subseteq> r O s"
haftmann@46752
   574
  by blast
berghofe@12905
   575
haftmann@46752
   576
lemma pred_comp_mono:
haftmann@46752
   577
  "r' \<le> r \<Longrightarrow> s' \<le> s \<Longrightarrow> r' OO s' \<le> r OO s "
haftmann@46752
   578
  by (fact rel_comp_mono [to_pred])
berghofe@12905
   579
berghofe@12905
   580
lemma rel_comp_subset_Sigma:
haftmann@46752
   581
  "r \<subseteq> A \<times> B \<Longrightarrow> s \<subseteq> B \<times> C \<Longrightarrow> r O s \<subseteq> A \<times> C"
haftmann@46752
   582
  by blast
haftmann@46752
   583
haftmann@46752
   584
lemma rel_comp_distrib [simp]:
haftmann@46752
   585
  "R O (S \<union> T) = (R O S) \<union> (R O T)" 
haftmann@46752
   586
  by auto
berghofe@12905
   587
noschinl@46882
   588
lemma pred_comp_distrib [simp]:
haftmann@46752
   589
  "R OO (S \<squnion> T) = R OO S \<squnion> R OO T"
haftmann@46752
   590
  by (fact rel_comp_distrib [to_pred])
haftmann@46752
   591
haftmann@46752
   592
lemma rel_comp_distrib2 [simp]:
haftmann@46752
   593
  "(S \<union> T) O R = (S O R) \<union> (T O R)"
haftmann@46752
   594
  by auto
krauss@28008
   595
noschinl@46882
   596
lemma pred_comp_distrib2 [simp]:
haftmann@46752
   597
  "(S \<squnion> T) OO R = S OO R \<squnion> T OO R"
haftmann@46752
   598
  by (fact rel_comp_distrib2 [to_pred])
haftmann@46752
   599
haftmann@46752
   600
lemma rel_comp_UNION_distrib:
haftmann@46752
   601
  "s O UNION I r = (\<Union>i\<in>I. s O r i) "
haftmann@46752
   602
  by auto
krauss@28008
   603
haftmann@46752
   604
(* FIXME thm rel_comp_UNION_distrib [to_pred] *)
krauss@36772
   605
haftmann@46752
   606
lemma rel_comp_UNION_distrib2:
haftmann@46752
   607
  "UNION I r O s = (\<Union>i\<in>I. r i O s) "
haftmann@46752
   608
  by auto
haftmann@46752
   609
haftmann@46752
   610
(* FIXME thm rel_comp_UNION_distrib2 [to_pred] *)
krauss@36772
   611
haftmann@46692
   612
lemma single_valued_rel_comp:
haftmann@46752
   613
  "single_valued r \<Longrightarrow> single_valued s \<Longrightarrow> single_valued (r O s)"
haftmann@46752
   614
  by (unfold single_valued_def) blast
haftmann@46752
   615
haftmann@46752
   616
lemma rel_comp_unfold:
haftmann@46752
   617
  "r O s = {(x, z). \<exists>y. (x, y) \<in> r \<and> (y, z) \<in> s}"
haftmann@46752
   618
  by (auto simp add: set_eq_iff)
berghofe@12905
   619
haftmann@46664
   620
haftmann@46664
   621
subsubsection {* Converse *}
wenzelm@12913
   622
haftmann@46752
   623
inductive_set converse :: "('a \<times> 'b) set \<Rightarrow> ('b \<times> 'a) set" ("(_^-1)" [1000] 999)
haftmann@46752
   624
  for r :: "('a \<times> 'b) set"
haftmann@46752
   625
where
haftmann@46752
   626
  "(a, b) \<in> r \<Longrightarrow> (b, a) \<in> r^-1"
haftmann@46692
   627
haftmann@46692
   628
notation (xsymbols)
haftmann@46692
   629
  converse  ("(_\<inverse>)" [1000] 999)
haftmann@46692
   630
haftmann@46752
   631
notation
haftmann@46752
   632
  conversep ("(_^--1)" [1000] 1000)
haftmann@46694
   633
haftmann@46694
   634
notation (xsymbols)
haftmann@46694
   635
  conversep  ("(_\<inverse>\<inverse>)" [1000] 1000)
haftmann@46694
   636
haftmann@46752
   637
lemma converseI [sym]:
haftmann@46752
   638
  "(a, b) \<in> r \<Longrightarrow> (b, a) \<in> r\<inverse>"
haftmann@46752
   639
  by (fact converse.intros)
haftmann@46752
   640
haftmann@46752
   641
lemma conversepI (* CANDIDATE [sym] *):
haftmann@46752
   642
  "r a b \<Longrightarrow> r\<inverse>\<inverse> b a"
haftmann@46752
   643
  by (fact conversep.intros)
haftmann@46752
   644
haftmann@46752
   645
lemma converseD [sym]:
haftmann@46752
   646
  "(a, b) \<in> r\<inverse> \<Longrightarrow> (b, a) \<in> r"
haftmann@46752
   647
  by (erule converse.cases) iprover
haftmann@46752
   648
haftmann@46752
   649
lemma conversepD (* CANDIDATE [sym] *):
haftmann@46752
   650
  "r\<inverse>\<inverse> b a \<Longrightarrow> r a b"
haftmann@46752
   651
  by (fact converseD [to_pred])
haftmann@46752
   652
haftmann@46752
   653
lemma converseE [elim!]:
haftmann@46752
   654
  -- {* More general than @{text converseD}, as it ``splits'' the member of the relation. *}
haftmann@46752
   655
  "yx \<in> r\<inverse> \<Longrightarrow> (\<And>x y. yx = (y, x) \<Longrightarrow> (x, y) \<in> r \<Longrightarrow> P) \<Longrightarrow> P"
haftmann@46752
   656
  by (cases yx) (simp, erule converse.cases, iprover)
haftmann@46694
   657
noschinl@46882
   658
lemmas conversepE [elim!] = conversep.cases
haftmann@46752
   659
haftmann@46752
   660
lemma converse_iff [iff]:
haftmann@46752
   661
  "(a, b) \<in> r\<inverse> \<longleftrightarrow> (b, a) \<in> r"
haftmann@46752
   662
  by (auto intro: converseI)
haftmann@46752
   663
haftmann@46752
   664
lemma conversep_iff [iff]:
haftmann@46752
   665
  "r\<inverse>\<inverse> a b = r b a"
haftmann@46752
   666
  by (fact converse_iff [to_pred])
haftmann@46694
   667
haftmann@46752
   668
lemma converse_converse [simp]:
haftmann@46752
   669
  "(r\<inverse>)\<inverse> = r"
haftmann@46752
   670
  by (simp add: set_eq_iff)
haftmann@46694
   671
haftmann@46752
   672
lemma conversep_conversep [simp]:
haftmann@46752
   673
  "(r\<inverse>\<inverse>)\<inverse>\<inverse> = r"
haftmann@46752
   674
  by (fact converse_converse [to_pred])
haftmann@46752
   675
haftmann@46752
   676
lemma converse_rel_comp: "(r O s)^-1 = s^-1 O r^-1"
haftmann@46752
   677
  by blast
haftmann@46694
   678
haftmann@46694
   679
lemma converse_pred_comp: "(r OO s)^--1 = s^--1 OO r^--1"
haftmann@46694
   680
  by (iprover intro: order_antisym conversepI pred_compI
haftmann@46694
   681
    elim: pred_compE dest: conversepD)
haftmann@46694
   682
haftmann@46752
   683
lemma converse_Int: "(r \<inter> s)^-1 = r^-1 \<inter> s^-1"
haftmann@46752
   684
  by blast
haftmann@46752
   685
haftmann@46694
   686
lemma converse_meet: "(r \<sqinter> s)^--1 = r^--1 \<sqinter> s^--1"
haftmann@46694
   687
  by (simp add: inf_fun_def) (iprover intro: conversepI ext dest: conversepD)
haftmann@46694
   688
haftmann@46752
   689
lemma converse_Un: "(r \<union> s)^-1 = r^-1 \<union> s^-1"
haftmann@46752
   690
  by blast
haftmann@46752
   691
haftmann@46694
   692
lemma converse_join: "(r \<squnion> s)^--1 = r^--1 \<squnion> s^--1"
haftmann@46694
   693
  by (simp add: sup_fun_def) (iprover intro: conversepI ext dest: conversepD)
haftmann@46694
   694
huffman@19228
   695
lemma converse_INTER: "(INTER S r)^-1 = (INT x:S. (r x)^-1)"
haftmann@46752
   696
  by fast
huffman@19228
   697
huffman@19228
   698
lemma converse_UNION: "(UNION S r)^-1 = (UN x:S. (r x)^-1)"
haftmann@46752
   699
  by blast
huffman@19228
   700
berghofe@12905
   701
lemma converse_Id [simp]: "Id^-1 = Id"
haftmann@46752
   702
  by blast
berghofe@12905
   703
nipkow@30198
   704
lemma converse_Id_on [simp]: "(Id_on A)^-1 = Id_on A"
haftmann@46752
   705
  by blast
berghofe@12905
   706
nipkow@30198
   707
lemma refl_on_converse [simp]: "refl_on A (converse r) = refl_on A r"
haftmann@46752
   708
  by (unfold refl_on_def) auto
berghofe@12905
   709
huffman@19228
   710
lemma sym_converse [simp]: "sym (converse r) = sym r"
haftmann@46752
   711
  by (unfold sym_def) blast
huffman@19228
   712
huffman@19228
   713
lemma antisym_converse [simp]: "antisym (converse r) = antisym r"
haftmann@46752
   714
  by (unfold antisym_def) blast
berghofe@12905
   715
huffman@19228
   716
lemma trans_converse [simp]: "trans (converse r) = trans r"
haftmann@46752
   717
  by (unfold trans_def) blast
berghofe@12905
   718
huffman@19228
   719
lemma sym_conv_converse_eq: "sym r = (r^-1 = r)"
haftmann@46752
   720
  by (unfold sym_def) fast
huffman@19228
   721
huffman@19228
   722
lemma sym_Un_converse: "sym (r \<union> r^-1)"
haftmann@46752
   723
  by (unfold sym_def) blast
huffman@19228
   724
huffman@19228
   725
lemma sym_Int_converse: "sym (r \<inter> r^-1)"
haftmann@46752
   726
  by (unfold sym_def) blast
huffman@19228
   727
haftmann@46752
   728
lemma total_on_converse [simp]: "total_on A (r^-1) = total_on A r"
haftmann@46752
   729
  by (auto simp: total_on_def)
nipkow@29859
   730
haftmann@46692
   731
lemma finite_converse [iff]: "finite (r^-1) = finite r"
haftmann@46692
   732
  apply (subgoal_tac "r^-1 = (%(x,y). (y,x))`r")
haftmann@46692
   733
   apply simp
haftmann@46692
   734
   apply (rule iffI)
haftmann@46692
   735
    apply (erule finite_imageD [unfolded inj_on_def])
haftmann@46692
   736
    apply (simp split add: split_split)
haftmann@46692
   737
   apply (erule finite_imageI)
haftmann@46752
   738
  apply (simp add: set_eq_iff image_def, auto)
haftmann@46692
   739
  apply (rule bexI)
haftmann@46692
   740
   prefer 2 apply assumption
haftmann@46692
   741
  apply simp
haftmann@46692
   742
  done
wenzelm@12913
   743
haftmann@46752
   744
lemma conversep_noteq [simp]: "(op \<noteq>)^--1 = op \<noteq>"
haftmann@46752
   745
  by (auto simp add: fun_eq_iff)
haftmann@46752
   746
haftmann@46752
   747
lemma conversep_eq [simp]: "(op =)^--1 = op ="
haftmann@46752
   748
  by (auto simp add: fun_eq_iff)
haftmann@46752
   749
haftmann@46752
   750
lemma converse_unfold:
haftmann@46752
   751
  "r\<inverse> = {(y, x). (x, y) \<in> r}"
haftmann@46752
   752
  by (simp add: set_eq_iff)
haftmann@46752
   753
haftmann@46692
   754
haftmann@46692
   755
subsubsection {* Domain, range and field *}
haftmann@46692
   756
haftmann@46767
   757
inductive_set Domain :: "('a \<times> 'b) set \<Rightarrow> 'a set"
haftmann@46767
   758
  for r :: "('a \<times> 'b) set"
haftmann@46752
   759
where
haftmann@46767
   760
  DomainI [intro]: "(a, b) \<in> r \<Longrightarrow> a \<in> Domain r"
haftmann@46767
   761
haftmann@46767
   762
abbreviation (input) "DomainP \<equiv> Domainp"
haftmann@46767
   763
haftmann@46767
   764
lemmas DomainPI = Domainp.DomainI
haftmann@46767
   765
haftmann@46767
   766
inductive_cases DomainE [elim!]: "a \<in> Domain r"
haftmann@46767
   767
inductive_cases DomainpE [elim!]: "Domainp r a"
haftmann@46692
   768
haftmann@46767
   769
inductive_set Range :: "('a \<times> 'b) set \<Rightarrow> 'b set"
haftmann@46767
   770
  for r :: "('a \<times> 'b) set"
haftmann@46752
   771
where
haftmann@46767
   772
  RangeI [intro]: "(a, b) \<in> r \<Longrightarrow> b \<in> Range r"
haftmann@46767
   773
haftmann@46767
   774
abbreviation (input) "RangeP \<equiv> Rangep"
haftmann@46767
   775
haftmann@46767
   776
lemmas RangePI = Rangep.RangeI
haftmann@46767
   777
haftmann@46767
   778
inductive_cases RangeE [elim!]: "b \<in> Range r"
haftmann@46767
   779
inductive_cases RangepE [elim!]: "Rangep r b"
haftmann@46692
   780
haftmann@46752
   781
definition Field :: "'a rel \<Rightarrow> 'a set"
haftmann@46752
   782
where
haftmann@46692
   783
  "Field r = Domain r \<union> Range r"
berghofe@12905
   784
haftmann@46694
   785
lemma Domain_fst [code]:
haftmann@46694
   786
  "Domain r = fst ` r"
haftmann@46767
   787
  by force
haftmann@46767
   788
haftmann@46767
   789
lemma Range_snd [code]:
haftmann@46767
   790
  "Range r = snd ` r"
haftmann@46767
   791
  by force
haftmann@46767
   792
haftmann@46767
   793
lemma fst_eq_Domain: "fst ` R = Domain R"
haftmann@46767
   794
  by force
haftmann@46767
   795
haftmann@46767
   796
lemma snd_eq_Range: "snd ` R = Range R"
haftmann@46767
   797
  by force
haftmann@46694
   798
haftmann@46694
   799
lemma Domain_empty [simp]: "Domain {} = {}"
haftmann@46767
   800
  by auto
haftmann@46767
   801
haftmann@46767
   802
lemma Range_empty [simp]: "Range {} = {}"
haftmann@46767
   803
  by auto
haftmann@46767
   804
haftmann@46767
   805
lemma Field_empty [simp]: "Field {} = {}"
haftmann@46767
   806
  by (simp add: Field_def)
haftmann@46694
   807
haftmann@46694
   808
lemma Domain_empty_iff: "Domain r = {} \<longleftrightarrow> r = {}"
haftmann@46694
   809
  by auto
haftmann@46694
   810
haftmann@46767
   811
lemma Range_empty_iff: "Range r = {} \<longleftrightarrow> r = {}"
haftmann@46767
   812
  by auto
haftmann@46767
   813
noschinl@46882
   814
lemma Domain_insert [simp]: "Domain (insert (a, b) r) = insert a (Domain r)"
haftmann@46767
   815
  by blast
haftmann@46767
   816
noschinl@46882
   817
lemma Range_insert [simp]: "Range (insert (a, b) r) = insert b (Range r)"
haftmann@46767
   818
  by blast
haftmann@46767
   819
haftmann@46767
   820
lemma Field_insert [simp]: "Field (insert (a, b) r) = {a, b} \<union> Field r"
haftmann@46767
   821
  by (auto simp add: Field_def Domain_insert Range_insert)
haftmann@46767
   822
haftmann@46767
   823
lemma Domain_iff: "a \<in> Domain r \<longleftrightarrow> (\<exists>y. (a, y) \<in> r)"
haftmann@46767
   824
  by blast
haftmann@46767
   825
haftmann@46767
   826
lemma Range_iff: "a \<in> Range r \<longleftrightarrow> (\<exists>y. (y, a) \<in> r)"
haftmann@46694
   827
  by blast
haftmann@46694
   828
haftmann@46694
   829
lemma Domain_Id [simp]: "Domain Id = UNIV"
haftmann@46694
   830
  by blast
haftmann@46694
   831
haftmann@46767
   832
lemma Range_Id [simp]: "Range Id = UNIV"
haftmann@46767
   833
  by blast
haftmann@46767
   834
haftmann@46694
   835
lemma Domain_Id_on [simp]: "Domain (Id_on A) = A"
haftmann@46694
   836
  by blast
haftmann@46694
   837
haftmann@46767
   838
lemma Range_Id_on [simp]: "Range (Id_on A) = A"
haftmann@46767
   839
  by blast
haftmann@46767
   840
haftmann@46767
   841
lemma Domain_Un_eq: "Domain (A \<union> B) = Domain A \<union> Domain B"
haftmann@46694
   842
  by blast
haftmann@46694
   843
haftmann@46767
   844
lemma Range_Un_eq: "Range (A \<union> B) = Range A \<union> Range B"
haftmann@46767
   845
  by blast
haftmann@46767
   846
haftmann@46767
   847
lemma Field_Un [simp]: "Field (r \<union> s) = Field r \<union> Field s"
haftmann@46767
   848
  by (auto simp: Field_def)
haftmann@46767
   849
haftmann@46767
   850
lemma Domain_Int_subset: "Domain (A \<inter> B) \<subseteq> Domain A \<inter> Domain B"
haftmann@46694
   851
  by blast
haftmann@46694
   852
haftmann@46767
   853
lemma Range_Int_subset: "Range (A \<inter> B) \<subseteq> Range A \<inter> Range B"
haftmann@46767
   854
  by blast
haftmann@46767
   855
haftmann@46767
   856
lemma Domain_Diff_subset: "Domain A - Domain B \<subseteq> Domain (A - B)"
haftmann@46767
   857
  by blast
haftmann@46767
   858
haftmann@46767
   859
lemma Range_Diff_subset: "Range A - Range B \<subseteq> Range (A - B)"
haftmann@46694
   860
  by blast
haftmann@46694
   861
haftmann@46767
   862
lemma Domain_Union: "Domain (\<Union>S) = (\<Union>A\<in>S. Domain A)"
haftmann@46694
   863
  by blast
haftmann@46694
   864
haftmann@46767
   865
lemma Range_Union: "Range (\<Union>S) = (\<Union>A\<in>S. Range A)"
haftmann@46767
   866
  by blast
haftmann@46767
   867
haftmann@46767
   868
lemma Field_Union [simp]: "Field (\<Union>R) = \<Union>(Field ` R)"
haftmann@46767
   869
  by (auto simp: Field_def)
haftmann@46767
   870
haftmann@46752
   871
lemma Domain_converse [simp]: "Domain (r\<inverse>) = Range r"
haftmann@46752
   872
  by auto
haftmann@46694
   873
haftmann@46767
   874
lemma Range_converse [simp]: "Range (r\<inverse>) = Domain r"
haftmann@46694
   875
  by blast
haftmann@46694
   876
haftmann@46767
   877
lemma Field_converse [simp]: "Field (r\<inverse>) = Field r"
haftmann@46767
   878
  by (auto simp: Field_def)
haftmann@46767
   879
haftmann@46767
   880
lemma Domain_Collect_split [simp]: "Domain {(x, y). P x y} = {x. EX y. P x y}"
haftmann@46767
   881
  by auto
haftmann@46767
   882
haftmann@46767
   883
lemma Range_Collect_split [simp]: "Range {(x, y). P x y} = {y. EX x. P x y}"
haftmann@46767
   884
  by auto
haftmann@46767
   885
haftmann@46767
   886
lemma finite_Domain: "finite r \<Longrightarrow> finite (Domain r)"
haftmann@46767
   887
  by (induct set: finite) (auto simp add: Domain_insert)
haftmann@46767
   888
haftmann@46767
   889
lemma finite_Range: "finite r \<Longrightarrow> finite (Range r)"
haftmann@46767
   890
  by (induct set: finite) (auto simp add: Range_insert)
haftmann@46767
   891
haftmann@46767
   892
lemma finite_Field: "finite r \<Longrightarrow> finite (Field r)"
haftmann@46767
   893
  by (simp add: Field_def finite_Domain finite_Range)
haftmann@46767
   894
haftmann@46767
   895
lemma Domain_mono: "r \<subseteq> s \<Longrightarrow> Domain r \<subseteq> Domain s"
haftmann@46767
   896
  by blast
haftmann@46767
   897
haftmann@46767
   898
lemma Range_mono: "r \<subseteq> s \<Longrightarrow> Range r \<subseteq> Range s"
haftmann@46767
   899
  by blast
haftmann@46767
   900
haftmann@46767
   901
lemma mono_Field: "r \<subseteq> s \<Longrightarrow> Field r \<subseteq> Field s"
haftmann@46767
   902
  by (auto simp: Field_def Domain_def Range_def)
haftmann@46767
   903
haftmann@46767
   904
lemma Domain_unfold:
haftmann@46767
   905
  "Domain r = {x. \<exists>y. (x, y) \<in> r}"
haftmann@46767
   906
  by blast
haftmann@46694
   907
haftmann@46694
   908
lemma Domain_dprod [simp]: "Domain (dprod r s) = uprod (Domain r) (Domain s)"
haftmann@46694
   909
  by auto
haftmann@46694
   910
haftmann@46694
   911
lemma Domain_dsum [simp]: "Domain (dsum r s) = usum (Domain r) (Domain s)"
haftmann@46694
   912
  by auto
haftmann@46694
   913
berghofe@12905
   914
haftmann@46664
   915
subsubsection {* Image of a set under a relation *}
berghofe@12905
   916
haftmann@46752
   917
definition Image :: "('a \<times> 'b) set \<Rightarrow> 'a set \<Rightarrow> 'b set" (infixl "``" 90)
haftmann@46752
   918
where
haftmann@46752
   919
  "r `` s = {y. \<exists>x\<in>s. (x, y) \<in> r}"
haftmann@46692
   920
blanchet@35828
   921
declare Image_def [no_atp]
paulson@24286
   922
wenzelm@12913
   923
lemma Image_iff: "(b : r``A) = (EX x:A. (x, b) : r)"
haftmann@46752
   924
  by (simp add: Image_def)
berghofe@12905
   925
wenzelm@12913
   926
lemma Image_singleton: "r``{a} = {b. (a, b) : r}"
haftmann@46752
   927
  by (simp add: Image_def)
berghofe@12905
   928
wenzelm@12913
   929
lemma Image_singleton_iff [iff]: "(b : r``{a}) = ((a, b) : r)"
haftmann@46752
   930
  by (rule Image_iff [THEN trans]) simp
berghofe@12905
   931
blanchet@35828
   932
lemma ImageI [intro,no_atp]: "(a, b) : r ==> a : A ==> b : r``A"
haftmann@46752
   933
  by (unfold Image_def) blast
berghofe@12905
   934
berghofe@12905
   935
lemma ImageE [elim!]:
haftmann@46752
   936
  "b : r `` A ==> (!!x. (x, b) : r ==> x : A ==> P) ==> P"
haftmann@46752
   937
  by (unfold Image_def) (iprover elim!: CollectE bexE)
berghofe@12905
   938
berghofe@12905
   939
lemma rev_ImageI: "a : A ==> (a, b) : r ==> b : r `` A"
berghofe@12905
   940
  -- {* This version's more effective when we already have the required @{text a} *}
haftmann@46752
   941
  by blast
berghofe@12905
   942
berghofe@12905
   943
lemma Image_empty [simp]: "R``{} = {}"
haftmann@46752
   944
  by blast
berghofe@12905
   945
berghofe@12905
   946
lemma Image_Id [simp]: "Id `` A = A"
haftmann@46752
   947
  by blast
berghofe@12905
   948
nipkow@30198
   949
lemma Image_Id_on [simp]: "Id_on A `` B = A \<inter> B"
haftmann@46752
   950
  by blast
paulson@13830
   951
paulson@13830
   952
lemma Image_Int_subset: "R `` (A \<inter> B) \<subseteq> R `` A \<inter> R `` B"
haftmann@46752
   953
  by blast
berghofe@12905
   954
paulson@13830
   955
lemma Image_Int_eq:
haftmann@46767
   956
  "single_valued (converse R) ==> R `` (A \<inter> B) = R `` A \<inter> R `` B"
haftmann@46767
   957
  by (simp add: single_valued_def, blast) 
berghofe@12905
   958
paulson@13830
   959
lemma Image_Un: "R `` (A \<union> B) = R `` A \<union> R `` B"
haftmann@46752
   960
  by blast
berghofe@12905
   961
paulson@13812
   962
lemma Un_Image: "(R \<union> S) `` A = R `` A \<union> S `` A"
haftmann@46752
   963
  by blast
paulson@13812
   964
wenzelm@12913
   965
lemma Image_subset: "r \<subseteq> A \<times> B ==> r``C \<subseteq> B"
haftmann@46752
   966
  by (iprover intro!: subsetI elim!: ImageE dest!: subsetD SigmaD2)
berghofe@12905
   967
paulson@13830
   968
lemma Image_eq_UN: "r``B = (\<Union>y\<in> B. r``{y})"
berghofe@12905
   969
  -- {* NOT suitable for rewriting *}
haftmann@46752
   970
  by blast
berghofe@12905
   971
wenzelm@12913
   972
lemma Image_mono: "r' \<subseteq> r ==> A' \<subseteq> A ==> (r' `` A') \<subseteq> (r `` A)"
haftmann@46752
   973
  by blast
berghofe@12905
   974
paulson@13830
   975
lemma Image_UN: "(r `` (UNION A B)) = (\<Union>x\<in>A. r `` (B x))"
haftmann@46752
   976
  by blast
paulson@13830
   977
paulson@13830
   978
lemma Image_INT_subset: "(r `` INTER A B) \<subseteq> (\<Inter>x\<in>A. r `` (B x))"
haftmann@46752
   979
  by blast
berghofe@12905
   980
paulson@13830
   981
text{*Converse inclusion requires some assumptions*}
paulson@13830
   982
lemma Image_INT_eq:
paulson@13830
   983
     "[|single_valued (r\<inverse>); A\<noteq>{}|] ==> r `` INTER A B = (\<Inter>x\<in>A. r `` B x)"
paulson@13830
   984
apply (rule equalityI)
paulson@13830
   985
 apply (rule Image_INT_subset) 
paulson@13830
   986
apply  (simp add: single_valued_def, blast)
paulson@13830
   987
done
berghofe@12905
   988
wenzelm@12913
   989
lemma Image_subset_eq: "(r``A \<subseteq> B) = (A \<subseteq> - ((r^-1) `` (-B)))"
haftmann@46752
   990
  by blast
berghofe@12905
   991
haftmann@46692
   992
lemma Image_Collect_split [simp]: "{(x, y). P x y} `` A = {y. EX x:A. P x y}"
haftmann@46752
   993
  by auto
berghofe@12905
   994
berghofe@12905
   995
haftmann@46664
   996
subsubsection {* Inverse image *}
berghofe@12905
   997
haftmann@46752
   998
definition inv_image :: "'b rel \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'a rel"
haftmann@46752
   999
where
haftmann@46752
  1000
  "inv_image r f = {(x, y). (f x, f y) \<in> r}"
haftmann@46692
  1001
haftmann@46752
  1002
definition inv_imagep :: "('b \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> bool"
haftmann@46752
  1003
where
haftmann@46694
  1004
  "inv_imagep r f = (\<lambda>x y. r (f x) (f y))"
haftmann@46694
  1005
haftmann@46694
  1006
lemma [pred_set_conv]: "inv_imagep (\<lambda>x y. (x, y) \<in> r) f = (\<lambda>x y. (x, y) \<in> inv_image r f)"
haftmann@46694
  1007
  by (simp add: inv_image_def inv_imagep_def)
haftmann@46694
  1008
huffman@19228
  1009
lemma sym_inv_image: "sym r ==> sym (inv_image r f)"
haftmann@46752
  1010
  by (unfold sym_def inv_image_def) blast
huffman@19228
  1011
wenzelm@12913
  1012
lemma trans_inv_image: "trans r ==> trans (inv_image r f)"
berghofe@12905
  1013
  apply (unfold trans_def inv_image_def)
berghofe@12905
  1014
  apply (simp (no_asm))
berghofe@12905
  1015
  apply blast
berghofe@12905
  1016
  done
berghofe@12905
  1017
krauss@32463
  1018
lemma in_inv_image[simp]: "((x,y) : inv_image r f) = ((f x, f y) : r)"
krauss@32463
  1019
  by (auto simp:inv_image_def)
krauss@32463
  1020
krauss@33218
  1021
lemma converse_inv_image[simp]: "(inv_image R f)^-1 = inv_image (R^-1) f"
haftmann@46752
  1022
  unfolding inv_image_def converse_unfold by auto
krauss@33218
  1023
haftmann@46664
  1024
lemma in_inv_imagep [simp]: "inv_imagep r f x y = r (f x) (f y)"
haftmann@46664
  1025
  by (simp add: inv_imagep_def)
haftmann@46664
  1026
haftmann@46664
  1027
haftmann@46664
  1028
subsubsection {* Powerset *}
haftmann@46664
  1029
haftmann@46752
  1030
definition Powp :: "('a \<Rightarrow> bool) \<Rightarrow> 'a set \<Rightarrow> bool"
haftmann@46752
  1031
where
haftmann@46664
  1032
  "Powp A = (\<lambda>B. \<forall>x \<in> B. A x)"
haftmann@46664
  1033
haftmann@46664
  1034
lemma Powp_Pow_eq [pred_set_conv]: "Powp (\<lambda>x. x \<in> A) = (\<lambda>x. x \<in> Pow A)"
haftmann@46664
  1035
  by (auto simp add: Powp_def fun_eq_iff)
haftmann@46664
  1036
haftmann@46664
  1037
lemmas Powp_mono [mono] = Pow_mono [to_pred]
haftmann@46664
  1038
nipkow@1128
  1039
end
haftmann@46689
  1040