src/HOL/Library/FuncSet.thy
author nipkow
Tue Jun 23 05:57:35 2009 +0200 (2009-06-23)
changeset 31759 1e652c39d617
parent 31754 b5260f5272a4
child 31770 ba52fcfaec28
permissions -rw-r--r--
fixed name
paulson@13586
     1
(*  Title:      HOL/Library/FuncSet.thy
paulson@13586
     2
    Author:     Florian Kammueller and Lawrence C Paulson
paulson@13586
     3
*)
paulson@13586
     4
wenzelm@14706
     5
header {* Pi and Function Sets *}
paulson@13586
     6
nipkow@15131
     7
theory FuncSet
haftmann@30663
     8
imports Hilbert_Choice Main
nipkow@15131
     9
begin
paulson@13586
    10
wenzelm@19736
    11
definition
wenzelm@21404
    12
  Pi :: "['a set, 'a => 'b set] => ('a => 'b) set" where
wenzelm@19736
    13
  "Pi A B = {f. \<forall>x. x \<in> A --> f x \<in> B x}"
paulson@13586
    14
wenzelm@21404
    15
definition
wenzelm@21404
    16
  extensional :: "'a set => ('a => 'b) set" where
haftmann@28524
    17
  "extensional A = {f. \<forall>x. x~:A --> f x = undefined}"
paulson@13586
    18
wenzelm@21404
    19
definition
wenzelm@21404
    20
  "restrict" :: "['a => 'b, 'a set] => ('a => 'b)" where
haftmann@28524
    21
  "restrict f A = (%x. if x \<in> A then f x else undefined)"
paulson@13586
    22
wenzelm@19536
    23
abbreviation
wenzelm@21404
    24
  funcset :: "['a set, 'b set] => ('a => 'b) set"
wenzelm@21404
    25
    (infixr "->" 60) where
wenzelm@19536
    26
  "A -> B == Pi A (%_. B)"
wenzelm@19536
    27
wenzelm@21210
    28
notation (xsymbols)
wenzelm@19656
    29
  funcset  (infixr "\<rightarrow>" 60)
wenzelm@19536
    30
paulson@13586
    31
syntax
wenzelm@19736
    32
  "_Pi"  :: "[pttrn, 'a set, 'b set] => ('a => 'b) set"  ("(3PI _:_./ _)" 10)
wenzelm@19736
    33
  "_lam" :: "[pttrn, 'a set, 'a => 'b] => ('a=>'b)"  ("(3%_:_./ _)" [0,0,3] 3)
paulson@13586
    34
paulson@13586
    35
syntax (xsymbols)
wenzelm@19736
    36
  "_Pi" :: "[pttrn, 'a set, 'b set] => ('a => 'b) set"  ("(3\<Pi> _\<in>_./ _)"   10)
wenzelm@19736
    37
  "_lam" :: "[pttrn, 'a set, 'a => 'b] => ('a=>'b)"  ("(3\<lambda>_\<in>_./ _)" [0,0,3] 3)
paulson@13586
    38
kleing@14565
    39
syntax (HTML output)
wenzelm@19736
    40
  "_Pi" :: "[pttrn, 'a set, 'b set] => ('a => 'b) set"  ("(3\<Pi> _\<in>_./ _)"   10)
wenzelm@19736
    41
  "_lam" :: "[pttrn, 'a set, 'a => 'b] => ('a=>'b)"  ("(3\<lambda>_\<in>_./ _)" [0,0,3] 3)
kleing@14565
    42
paulson@13586
    43
translations
wenzelm@20770
    44
  "PI x:A. B" == "CONST Pi A (%x. B)"
wenzelm@20770
    45
  "%x:A. f" == "CONST restrict (%x. f) A"
paulson@13586
    46
wenzelm@19736
    47
definition
wenzelm@21404
    48
  "compose" :: "['a set, 'b => 'c, 'a => 'b] => ('a => 'c)" where
wenzelm@19736
    49
  "compose A g f = (\<lambda>x\<in>A. g (f x))"
paulson@13586
    50
paulson@13586
    51
paulson@13586
    52
subsection{*Basic Properties of @{term Pi}*}
paulson@13586
    53
nipkow@31754
    54
lemma Pi_I[intro!]: "(!!x. x \<in> A ==> f x \<in> B x) ==> f \<in> Pi A B"
wenzelm@14706
    55
  by (simp add: Pi_def)
paulson@13586
    56
nipkow@31731
    57
lemma Pi_I'[simp]: "(!!x. x : A --> f x : B x) ==> f : Pi A B"
nipkow@31731
    58
by(simp add:Pi_def)
nipkow@31731
    59
paulson@13586
    60
lemma funcsetI: "(!!x. x \<in> A ==> f x \<in> B) ==> f \<in> A -> B"
wenzelm@14706
    61
  by (simp add: Pi_def)
paulson@13586
    62
paulson@13586
    63
lemma Pi_mem: "[|f: Pi A B; x \<in> A|] ==> f x \<in> B x"
wenzelm@14706
    64
  by (simp add: Pi_def)
paulson@13586
    65
nipkow@31759
    66
lemma PiE [elim]:
nipkow@31754
    67
  "f : Pi A B ==> (f x : B x ==> Q) ==> (x ~: A ==> Q) ==> Q"
nipkow@31754
    68
by(auto simp: Pi_def)
nipkow@31754
    69
paulson@13586
    70
lemma funcset_mem: "[|f \<in> A -> B; x \<in> A|] ==> f x \<in> B"
wenzelm@14706
    71
  by (simp add: Pi_def)
paulson@13586
    72
paulson@14762
    73
lemma funcset_image: "f \<in> A\<rightarrow>B ==> f ` A \<subseteq> B"
nipkow@31754
    74
by auto
paulson@14762
    75
nipkow@31754
    76
lemma Pi_eq_empty[simp]: "((PI x: A. B x) = {}) = (\<exists>x\<in>A. B(x) = {})"
paulson@13593
    77
apply (simp add: Pi_def, auto)
paulson@13586
    78
txt{*Converse direction requires Axiom of Choice to exhibit a function
paulson@13586
    79
picking an element from each non-empty @{term "B x"}*}
paulson@13593
    80
apply (drule_tac x = "%u. SOME y. y \<in> B u" in spec, auto)
wenzelm@14706
    81
apply (cut_tac P= "%y. y \<in> B x" in some_eq_ex, auto)
paulson@13586
    82
done
paulson@13586
    83
paulson@13593
    84
lemma Pi_empty [simp]: "Pi {} B = UNIV"
nipkow@31754
    85
by (simp add: Pi_def)
paulson@13593
    86
paulson@13593
    87
lemma Pi_UNIV [simp]: "A -> UNIV = UNIV"
nipkow@31754
    88
by (simp add: Pi_def)
nipkow@31727
    89
(*
nipkow@31727
    90
lemma funcset_id [simp]: "(%x. x): A -> A"
nipkow@31727
    91
  by (simp add: Pi_def)
nipkow@31727
    92
*)
paulson@13586
    93
text{*Covariance of Pi-sets in their second argument*}
paulson@13586
    94
lemma Pi_mono: "(!!x. x \<in> A ==> B x <= C x) ==> Pi A B <= Pi A C"
nipkow@31754
    95
by auto
paulson@13586
    96
paulson@13586
    97
text{*Contravariance of Pi-sets in their first argument*}
paulson@13586
    98
lemma Pi_anti_mono: "A' <= A ==> Pi A B <= Pi A' B"
nipkow@31754
    99
by auto
paulson@13586
   100
paulson@13586
   101
paulson@13586
   102
subsection{*Composition With a Restricted Domain: @{term compose}*}
paulson@13586
   103
wenzelm@14706
   104
lemma funcset_compose:
nipkow@31754
   105
  "[| f \<in> A -> B; g \<in> B -> C |]==> compose A g f \<in> A -> C"
nipkow@31754
   106
by (simp add: Pi_def compose_def restrict_def)
paulson@13586
   107
paulson@13586
   108
lemma compose_assoc:
wenzelm@14706
   109
    "[| f \<in> A -> B; g \<in> B -> C; h \<in> C -> D |]
paulson@13586
   110
      ==> compose A h (compose A g f) = compose A (compose B h g) f"
nipkow@31754
   111
by (simp add: expand_fun_eq Pi_def compose_def restrict_def)
paulson@13586
   112
paulson@13586
   113
lemma compose_eq: "x \<in> A ==> compose A g f x = g(f(x))"
nipkow@31754
   114
by (simp add: compose_def restrict_def)
paulson@13586
   115
paulson@13586
   116
lemma surj_compose: "[| f ` A = B; g ` B = C |] ==> compose A g f ` A = C"
wenzelm@14706
   117
  by (auto simp add: image_def compose_eq)
paulson@13586
   118
paulson@13586
   119
paulson@13586
   120
subsection{*Bounded Abstraction: @{term restrict}*}
paulson@13586
   121
paulson@13586
   122
lemma restrict_in_funcset: "(!!x. x \<in> A ==> f x \<in> B) ==> (\<lambda>x\<in>A. f x) \<in> A -> B"
wenzelm@14706
   123
  by (simp add: Pi_def restrict_def)
paulson@13586
   124
nipkow@31754
   125
lemma restrictI[intro!]: "(!!x. x \<in> A ==> f x \<in> B x) ==> (\<lambda>x\<in>A. f x) \<in> Pi A B"
wenzelm@14706
   126
  by (simp add: Pi_def restrict_def)
paulson@13586
   127
paulson@13586
   128
lemma restrict_apply [simp]:
haftmann@28524
   129
    "(\<lambda>y\<in>A. f y) x = (if x \<in> A then f x else undefined)"
wenzelm@14706
   130
  by (simp add: restrict_def)
paulson@13586
   131
wenzelm@14706
   132
lemma restrict_ext:
paulson@13586
   133
    "(!!x. x \<in> A ==> f x = g x) ==> (\<lambda>x\<in>A. f x) = (\<lambda>x\<in>A. g x)"
nipkow@31754
   134
  by (simp add: expand_fun_eq Pi_def restrict_def)
paulson@13586
   135
paulson@14853
   136
lemma inj_on_restrict_eq [simp]: "inj_on (restrict f A) A = inj_on f A"
wenzelm@14706
   137
  by (simp add: inj_on_def restrict_def)
paulson@13586
   138
paulson@13586
   139
lemma Id_compose:
wenzelm@14706
   140
    "[|f \<in> A -> B;  f \<in> extensional A|] ==> compose A (\<lambda>y\<in>B. y) f = f"
wenzelm@14706
   141
  by (auto simp add: expand_fun_eq compose_def extensional_def Pi_def)
paulson@13586
   142
paulson@13586
   143
lemma compose_Id:
wenzelm@14706
   144
    "[|g \<in> A -> B;  g \<in> extensional A|] ==> compose A g (\<lambda>x\<in>A. x) = g"
wenzelm@14706
   145
  by (auto simp add: expand_fun_eq compose_def extensional_def Pi_def)
paulson@13586
   146
paulson@14853
   147
lemma image_restrict_eq [simp]: "(restrict f A) ` A = f ` A"
wenzelm@19736
   148
  by (auto simp add: restrict_def)
paulson@13586
   149
paulson@14745
   150
paulson@14762
   151
subsection{*Bijections Between Sets*}
paulson@14762
   152
nipkow@26106
   153
text{*The definition of @{const bij_betw} is in @{text "Fun.thy"}, but most of
paulson@14762
   154
the theorems belong here, or need at least @{term Hilbert_Choice}.*}
paulson@14762
   155
paulson@14762
   156
lemma bij_betw_imp_funcset: "bij_betw f A B \<Longrightarrow> f \<in> A \<rightarrow> B"
nipkow@31754
   157
by (auto simp add: bij_betw_def inj_on_Inv)
paulson@14762
   158
paulson@14853
   159
lemma inj_on_compose:
nipkow@31754
   160
  "[| bij_betw f A B; inj_on g B |] ==> inj_on (compose A g f) A"
nipkow@31754
   161
by (auto simp add: bij_betw_def inj_on_def compose_eq)
paulson@14853
   162
paulson@14762
   163
lemma bij_betw_compose:
nipkow@31754
   164
  "[| bij_betw f A B; bij_betw g B C |] ==> bij_betw (compose A g f) A C"
nipkow@31754
   165
apply (simp add: bij_betw_def compose_eq inj_on_compose)
nipkow@31754
   166
apply (auto simp add: compose_def image_def)
nipkow@31754
   167
done
paulson@14762
   168
paulson@14853
   169
lemma bij_betw_restrict_eq [simp]:
nipkow@31754
   170
  "bij_betw (restrict f A) A B = bij_betw f A B"
nipkow@31754
   171
by (simp add: bij_betw_def)
paulson@14853
   172
paulson@14853
   173
paulson@14853
   174
subsection{*Extensionality*}
paulson@14853
   175
haftmann@28524
   176
lemma extensional_arb: "[|f \<in> extensional A; x\<notin> A|] ==> f x = undefined"
nipkow@31754
   177
by (simp add: extensional_def)
paulson@14853
   178
paulson@14853
   179
lemma restrict_extensional [simp]: "restrict f A \<in> extensional A"
nipkow@31754
   180
by (simp add: restrict_def extensional_def)
paulson@14853
   181
paulson@14853
   182
lemma compose_extensional [simp]: "compose A f g \<in> extensional A"
nipkow@31754
   183
by (simp add: compose_def)
paulson@14853
   184
paulson@14853
   185
lemma extensionalityI:
nipkow@31754
   186
  "[| f \<in> extensional A; g \<in> extensional A;
paulson@14853
   187
      !!x. x\<in>A ==> f x = g x |] ==> f = g"
nipkow@31754
   188
by (force simp add: expand_fun_eq extensional_def)
paulson@14853
   189
paulson@14853
   190
lemma Inv_funcset: "f ` A = B ==> (\<lambda>x\<in>B. Inv A f x) : B -> A"
nipkow@31754
   191
by (unfold Inv_def) (fast intro: someI2)
paulson@14853
   192
paulson@14853
   193
lemma compose_Inv_id:
nipkow@31754
   194
  "bij_betw f A B ==> compose A (\<lambda>y\<in>B. Inv A f y) f = (\<lambda>x\<in>A. x)"
nipkow@31754
   195
apply (simp add: bij_betw_def compose_def)
nipkow@31754
   196
apply (rule restrict_ext, auto)
nipkow@31754
   197
apply (erule subst)
nipkow@31754
   198
apply (simp add: Inv_f_f)
nipkow@31754
   199
done
paulson@14853
   200
paulson@14853
   201
lemma compose_id_Inv:
nipkow@31754
   202
  "f ` A = B ==> compose B f (\<lambda>y\<in>B. Inv A f y) = (\<lambda>x\<in>B. x)"
nipkow@31754
   203
apply (simp add: compose_def)
nipkow@31754
   204
apply (rule restrict_ext)
nipkow@31754
   205
apply (simp add: f_Inv_f)
nipkow@31754
   206
done
paulson@14853
   207
paulson@14762
   208
paulson@14745
   209
subsection{*Cardinality*}
paulson@14745
   210
paulson@14745
   211
lemma card_inj: "[|f \<in> A\<rightarrow>B; inj_on f A; finite B|] ==> card(A) \<le> card(B)"
nipkow@31754
   212
by (rule card_inj_on_le) auto
paulson@14745
   213
paulson@14745
   214
lemma card_bij:
nipkow@31754
   215
  "[|f \<in> A\<rightarrow>B; inj_on f A;
nipkow@31754
   216
     g \<in> B\<rightarrow>A; inj_on g B; finite A; finite B|] ==> card(A) = card(B)"
nipkow@31754
   217
by (blast intro: card_inj order_antisym)
paulson@14745
   218
paulson@13586
   219
end