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