src/HOLCF/Sprod.thy
author huffman
Tue Jul 26 18:27:16 2005 +0200 (2005-07-26)
changeset 16920 ded12c9e88c2
parent 16777 555c8951f05c
child 17817 405fb812e738
permissions -rw-r--r--
cleaned up
huffman@15600
     1
(*  Title:      HOLCF/Sprod.thy
huffman@15576
     2
    ID:         $Id$
huffman@16059
     3
    Author:     Franz Regensburger and Brian Huffman
huffman@15576
     4
huffman@15576
     5
Strict product with typedef.
huffman@15576
     6
*)
huffman@15576
     7
huffman@15576
     8
header {* The type of strict products *}
huffman@15576
     9
huffman@15577
    10
theory Sprod
huffman@16699
    11
imports Cprod
huffman@15577
    12
begin
huffman@15576
    13
huffman@16082
    14
defaultsort pcpo
huffman@16082
    15
huffman@15591
    16
subsection {* Definition of strict product type *}
huffman@15591
    17
huffman@16699
    18
pcpodef (Sprod)  ('a, 'b) "**" (infixr 20) =
huffman@16059
    19
        "{p::'a \<times> 'b. p = \<bottom> \<or> (cfst\<cdot>p \<noteq> \<bottom> \<and> csnd\<cdot>p \<noteq> \<bottom>)}"
huffman@16699
    20
by simp
huffman@15576
    21
huffman@15576
    22
syntax (xsymbols)
huffman@15576
    23
  "**"		:: "[type, type] => type"	 ("(_ \<otimes>/ _)" [21,20] 20)
huffman@15576
    24
syntax (HTML output)
huffman@15576
    25
  "**"		:: "[type, type] => type"	 ("(_ \<otimes>/ _)" [21,20] 20)
huffman@15576
    26
huffman@16059
    27
lemma spair_lemma:
huffman@16059
    28
  "<strictify\<cdot>(\<Lambda> b. a)\<cdot>b, strictify\<cdot>(\<Lambda> a. b)\<cdot>a> \<in> Sprod"
huffman@16212
    29
by (simp add: Sprod_def strictify_conv_if cpair_strict)
huffman@15576
    30
huffman@16059
    31
subsection {* Definitions of constants *}
huffman@15576
    32
huffman@16059
    33
consts
huffman@16059
    34
  sfst :: "('a ** 'b) \<rightarrow> 'a"
huffman@16059
    35
  ssnd :: "('a ** 'b) \<rightarrow> 'b"
huffman@16059
    36
  spair :: "'a \<rightarrow> 'b \<rightarrow> ('a ** 'b)"
huffman@16059
    37
  ssplit :: "('a \<rightarrow> 'b \<rightarrow> 'c) \<rightarrow> ('a ** 'b) \<rightarrow> 'c"
huffman@15576
    38
huffman@16059
    39
defs
huffman@16059
    40
  sfst_def: "sfst \<equiv> \<Lambda> p. cfst\<cdot>(Rep_Sprod p)"
huffman@16059
    41
  ssnd_def: "ssnd \<equiv> \<Lambda> p. csnd\<cdot>(Rep_Sprod p)"
huffman@16059
    42
  spair_def: "spair \<equiv> \<Lambda> a b. Abs_Sprod
huffman@16059
    43
                <strictify\<cdot>(\<Lambda> b. a)\<cdot>b, strictify\<cdot>(\<Lambda> a. b)\<cdot>a>"
huffman@16059
    44
  ssplit_def: "ssplit \<equiv> \<Lambda> f. strictify\<cdot>(\<Lambda> p. f\<cdot>(sfst\<cdot>p)\<cdot>(ssnd\<cdot>p))"
huffman@15576
    45
huffman@15576
    46
syntax  
huffman@15576
    47
  "@stuple"	:: "['a, args] => 'a ** 'b"	("(1'(:_,/ _:'))")
huffman@15576
    48
huffman@15576
    49
translations
huffman@15576
    50
        "(:x, y, z:)"   == "(:x, (:y, z:):)"
huffman@15576
    51
        "(:x, y:)"      == "spair$x$y"
huffman@15576
    52
huffman@16059
    53
subsection {* Case analysis *}
huffman@15576
    54
huffman@16059
    55
lemma spair_Abs_Sprod:
huffman@16059
    56
  "(:a, b:) = Abs_Sprod <strictify\<cdot>(\<Lambda> b. a)\<cdot>b, strictify\<cdot>(\<Lambda> a. b)\<cdot>a>"
huffman@16059
    57
apply (unfold spair_def)
huffman@16059
    58
apply (simp add: cont_Abs_Sprod spair_lemma)
huffman@15576
    59
done
huffman@15576
    60
huffman@16059
    61
lemma Exh_Sprod2:
huffman@16059
    62
  "z = \<bottom> \<or> (\<exists>a b. z = (:a, b:) \<and> a \<noteq> \<bottom> \<and> b \<noteq> \<bottom>)"
huffman@16059
    63
apply (rule_tac x=z in Abs_Sprod_cases)
huffman@16059
    64
apply (simp add: Sprod_def)
huffman@16059
    65
apply (erule disjE)
huffman@16212
    66
apply (simp add: Abs_Sprod_strict)
huffman@16059
    67
apply (rule disjI2)
huffman@16059
    68
apply (rule_tac x="cfst\<cdot>y" in exI)
huffman@16059
    69
apply (rule_tac x="csnd\<cdot>y" in exI)
huffman@16059
    70
apply (simp add: spair_Abs_Sprod Abs_Sprod_inject spair_lemma)
huffman@16059
    71
apply (simp add: surjective_pairing_Cprod2)
huffman@15576
    72
done
huffman@15576
    73
huffman@16059
    74
lemma sprodE:
huffman@16059
    75
  "\<lbrakk>p = \<bottom> \<Longrightarrow> Q; \<And>x y. \<lbrakk>p = (:x, y:); x \<noteq> \<bottom>; y \<noteq> \<bottom>\<rbrakk> \<Longrightarrow> Q\<rbrakk> \<Longrightarrow> Q"
huffman@16059
    76
by (cut_tac z=p in Exh_Sprod2, auto)
huffman@16059
    77
huffman@16059
    78
subsection {* Properties of @{term spair} *}
huffman@16059
    79
huffman@16317
    80
lemma spair_strict1 [simp]: "(:\<bottom>, y:) = \<bottom>"
huffman@16920
    81
by (simp add: spair_Abs_Sprod strictify_conv_if cpair_strict Abs_Sprod_strict)
huffman@15576
    82
huffman@16317
    83
lemma spair_strict2 [simp]: "(:x, \<bottom>:) = \<bottom>"
huffman@16920
    84
by (simp add: spair_Abs_Sprod strictify_conv_if cpair_strict Abs_Sprod_strict)
huffman@15576
    85
huffman@16317
    86
lemma spair_strict: "x = \<bottom> \<or> y = \<bottom> \<Longrightarrow> (:x, y:) = \<bottom>"
huffman@16059
    87
by auto
huffman@16059
    88
huffman@16212
    89
lemma spair_strict_rev: "(:x, y:) \<noteq> \<bottom> \<Longrightarrow> x \<noteq> \<bottom> \<and> y \<noteq> \<bottom>"
huffman@16059
    90
by (erule contrapos_np, auto)
huffman@16059
    91
huffman@16212
    92
lemma spair_defined [simp]: 
huffman@16317
    93
  "\<lbrakk>x \<noteq> \<bottom>; y \<noteq> \<bottom>\<rbrakk> \<Longrightarrow> (:x, y:) \<noteq> \<bottom>"
huffman@16920
    94
by (simp add: spair_Abs_Sprod Abs_Sprod_defined cpair_defined_iff Sprod_def)
huffman@15576
    95
huffman@16317
    96
lemma spair_defined_rev: "(:x, y:) = \<bottom> \<Longrightarrow> x = \<bottom> \<or> y = \<bottom>"
huffman@16059
    97
by (erule contrapos_pp, simp)
huffman@15576
    98
huffman@16317
    99
lemma spair_eq:
huffman@16317
   100
  "\<lbrakk>x \<noteq> \<bottom>; y \<noteq> \<bottom>\<rbrakk> \<Longrightarrow> ((:x, y:) = (:a, b:)) = (x = a \<and> y = b)"
huffman@16317
   101
apply (simp add: spair_Abs_Sprod)
huffman@16317
   102
apply (simp add: Abs_Sprod_inject [OF _ spair_lemma] Sprod_def)
huffman@16317
   103
apply (simp add: strictify_conv_if)
huffman@16317
   104
done
huffman@16317
   105
huffman@16212
   106
lemma spair_inject:
huffman@16317
   107
  "\<lbrakk>x \<noteq> \<bottom>; y \<noteq> \<bottom>; (:x, y:) = (:a, b:)\<rbrakk> \<Longrightarrow> x = a \<and> y = b"
huffman@16317
   108
by (rule spair_eq [THEN iffD1])
huffman@15576
   109
huffman@15576
   110
lemma inst_sprod_pcpo2: "UU = (:UU,UU:)"
huffman@16059
   111
by simp
huffman@15576
   112
huffman@16059
   113
subsection {* Properties of @{term sfst} and @{term ssnd} *}
huffman@15576
   114
huffman@16212
   115
lemma sfst_strict [simp]: "sfst\<cdot>\<bottom> = \<bottom>"
huffman@16212
   116
by (simp add: sfst_def cont_Rep_Sprod Rep_Sprod_strict)
huffman@15576
   117
huffman@16212
   118
lemma ssnd_strict [simp]: "ssnd\<cdot>\<bottom> = \<bottom>"
huffman@16212
   119
by (simp add: ssnd_def cont_Rep_Sprod Rep_Sprod_strict)
huffman@15576
   120
huffman@16059
   121
lemma Rep_Sprod_spair:
huffman@16059
   122
  "Rep_Sprod (:a, b:) = <strictify\<cdot>(\<Lambda> b. a)\<cdot>b, strictify\<cdot>(\<Lambda> a. b)\<cdot>a>"
huffman@15576
   123
apply (unfold spair_def)
huffman@16059
   124
apply (simp add: cont_Abs_Sprod Abs_Sprod_inverse spair_lemma)
huffman@15576
   125
done
huffman@15591
   126
huffman@16212
   127
lemma sfst_spair [simp]: "y \<noteq> \<bottom> \<Longrightarrow> sfst\<cdot>(:x, y:) = x"
huffman@16059
   128
by (simp add: sfst_def cont_Rep_Sprod Rep_Sprod_spair)
huffman@15576
   129
huffman@16212
   130
lemma ssnd_spair [simp]: "x \<noteq> \<bottom> \<Longrightarrow> ssnd\<cdot>(:x, y:) = y"
huffman@16059
   131
by (simp add: ssnd_def cont_Rep_Sprod Rep_Sprod_spair)
huffman@15576
   132
huffman@16777
   133
lemma sfst_defined_iff [simp]: "(sfst\<cdot>p = \<bottom>) = (p = \<bottom>)"
huffman@16777
   134
by (rule_tac p=p in sprodE, simp_all)
huffman@16777
   135
huffman@16777
   136
lemma ssnd_defined_iff [simp]: "(ssnd\<cdot>p = \<bottom>) = (p = \<bottom>)"
huffman@16059
   137
by (rule_tac p=p in sprodE, simp_all)
huffman@16317
   138
huffman@16777
   139
lemma sfst_defined: "p \<noteq> \<bottom> \<Longrightarrow> sfst\<cdot>p \<noteq> \<bottom>"
huffman@16777
   140
by simp
huffman@16777
   141
huffman@16777
   142
lemma ssnd_defined: "p \<noteq> \<bottom> \<Longrightarrow> ssnd\<cdot>p \<noteq> \<bottom>"
huffman@16777
   143
by simp
huffman@16777
   144
huffman@16059
   145
lemma surjective_pairing_Sprod2: "(:sfst\<cdot>p, ssnd\<cdot>p:) = p"
huffman@16059
   146
by (rule_tac p=p in sprodE, simp_all)
huffman@15576
   147
huffman@16751
   148
lemma less_sprod: "x \<sqsubseteq> y = (sfst\<cdot>x \<sqsubseteq> sfst\<cdot>y \<and> ssnd\<cdot>x \<sqsubseteq> ssnd\<cdot>y)"
huffman@16699
   149
apply (simp add: less_Sprod_def sfst_def ssnd_def cont_Rep_Sprod)
huffman@16317
   150
apply (rule less_cprod)
huffman@16317
   151
done
huffman@16317
   152
huffman@16751
   153
lemma eq_sprod: "(x = y) = (sfst\<cdot>x = sfst\<cdot>y \<and> ssnd\<cdot>x = ssnd\<cdot>y)"
huffman@16751
   154
by (auto simp add: po_eq_conv less_sprod)
huffman@16751
   155
huffman@16317
   156
lemma spair_less:
huffman@16317
   157
  "\<lbrakk>x \<noteq> \<bottom>; y \<noteq> \<bottom>\<rbrakk> \<Longrightarrow> (:x, y:) \<sqsubseteq> (:a, b:) = (x \<sqsubseteq> a \<and> y \<sqsubseteq> b)"
huffman@16317
   158
apply (case_tac "a = \<bottom>")
huffman@16317
   159
apply (simp add: eq_UU_iff [symmetric])
huffman@16317
   160
apply (case_tac "b = \<bottom>")
huffman@16317
   161
apply (simp add: eq_UU_iff [symmetric])
huffman@16317
   162
apply (simp add: less_sprod)
huffman@16317
   163
done
huffman@16317
   164
huffman@16317
   165
huffman@16059
   166
subsection {* Properties of @{term ssplit} *}
huffman@15576
   167
huffman@16059
   168
lemma ssplit1 [simp]: "ssplit\<cdot>f\<cdot>\<bottom> = \<bottom>"
huffman@15591
   169
by (simp add: ssplit_def)
huffman@15591
   170
huffman@16920
   171
lemma ssplit2 [simp]: "\<lbrakk>x \<noteq> \<bottom>; y \<noteq> \<bottom>\<rbrakk> \<Longrightarrow> ssplit\<cdot>f\<cdot>(:x, y:) = f\<cdot>x\<cdot>y"
huffman@15591
   172
by (simp add: ssplit_def)
huffman@15591
   173
huffman@16553
   174
lemma ssplit3 [simp]: "ssplit\<cdot>spair\<cdot>z = z"
huffman@16059
   175
by (rule_tac p=z in sprodE, simp_all)
huffman@15576
   176
huffman@15576
   177
end