201
+ − 1
theory LamEx
+ − 2
imports Nominal QuotMain
+ − 3
begin
+ − 4
+ − 5
atom_decl name
+ − 6
243
+ − 7
thm abs_fresh(1)
+ − 8
201
+ − 9
nominal_datatype rlam =
+ − 10
rVar "name"
+ − 11
| rApp "rlam" "rlam"
+ − 12
| rLam "name" "rlam"
+ − 13
259
+ − 14
print_theorems
201
+ − 15
243
+ − 16
function
+ − 17
rfv :: "rlam \<Rightarrow> name set"
+ − 18
where
+ − 19
rfv_var: "rfv (rVar a) = {a}"
+ − 20
| rfv_app: "rfv (rApp t1 t2) = (rfv t1) \<union> (rfv t2)"
+ − 21
| rfv_lam: "rfv (rLam a t) = (rfv t) - {a}"
+ − 22
sorry
+ − 23
247
+ − 24
termination rfv sorry
243
+ − 25
271
+ − 26
inductive
246
+ − 27
alpha :: "rlam \<Rightarrow> rlam \<Rightarrow> bool" ("_ \<approx> _" [100, 100] 100)
+ − 28
where
+ − 29
a1: "a = b \<Longrightarrow> (rVar a) \<approx> (rVar b)"
+ − 30
| a2: "\<lbrakk>t1 \<approx> t2; s1 \<approx> s2\<rbrakk> \<Longrightarrow> rApp t1 s1 \<approx> rApp t2 s2"
+ − 31
| a3: "\<lbrakk>t \<approx> ([(a,b)]\<bullet>s); a \<notin> rfv (rLam b t)\<rbrakk> \<Longrightarrow> rLam a t \<approx> rLam b s"
+ − 32
259
+ − 33
print_theorems
+ − 34
271
+ − 35
lemma alpha_refl:
286
+ − 36
fixes t::"rlam"
+ − 37
shows "t \<approx> t"
+ − 38
apply(induct t rule: rlam.induct)
+ − 39
apply(simp add: a1)
+ − 40
apply(simp add: a2)
+ − 41
apply(rule a3)
+ − 42
apply(subst pt_swap_bij'')
+ − 43
apply(rule pt_name_inst)
+ − 44
apply(rule at_name_inst)
+ − 45
apply(simp)
+ − 46
apply(simp)
+ − 47
done
+ − 48
+ − 49
lemma alpha_EQUIV:
+ − 50
shows "EQUIV alpha"
271
+ − 51
sorry
+ − 52
201
+ − 53
quotient lam = rlam / alpha
286
+ − 54
apply(rule alpha_EQUIV)
+ − 55
done
201
+ − 56
203
+ − 57
print_quotients
+ − 58
268
4d58c02289ca
simplified the quotient_def code; type of the defined constant must now be given; for-part eliminated
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 59
quotient_def
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 60
Var :: "name \<Rightarrow> lam"
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 61
where
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 62
"Var \<equiv> rVar"
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 63
268
4d58c02289ca
simplified the quotient_def code; type of the defined constant must now be given; for-part eliminated
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 64
quotient_def
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 65
App :: "lam \<Rightarrow> lam \<Rightarrow> lam"
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 66
where
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 67
"App \<equiv> rApp"
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 68
268
4d58c02289ca
simplified the quotient_def code; type of the defined constant must now be given; for-part eliminated
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 69
quotient_def
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 70
Lam :: "name \<Rightarrow> lam \<Rightarrow> lam"
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 71
where
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 72
"Lam \<equiv> rLam"
201
+ − 73
218
+ − 74
thm Var_def
+ − 75
thm App_def
+ − 76
thm Lam_def
+ − 77
268
4d58c02289ca
simplified the quotient_def code; type of the defined constant must now be given; for-part eliminated
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 78
quotient_def
243
+ − 79
fv :: "lam \<Rightarrow> name set"
+ − 80
where
+ − 81
"fv \<equiv> rfv"
+ − 82
+ − 83
thm fv_def
+ − 84
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 85
(* definition of overloaded permutation function *)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 86
(* for the lifted type lam *)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 87
overloading
268
4d58c02289ca
simplified the quotient_def code; type of the defined constant must now be given; for-part eliminated
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 88
perm_lam \<equiv> "perm :: 'x prm \<Rightarrow> lam \<Rightarrow> lam" (unchecked)
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 89
begin
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 90
268
4d58c02289ca
simplified the quotient_def code; type of the defined constant must now be given; for-part eliminated
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 91
quotient_def
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 92
perm_lam :: "'x prm \<Rightarrow> lam \<Rightarrow> lam"
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 93
where
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 94
"perm_lam \<equiv> (perm::'x prm \<Rightarrow> rlam \<Rightarrow> rlam)"
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 95
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 96
end
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 97
238
+ − 98
(*quotient_def (for lam)
+ − 99
abs_fun_lam :: "'x prm \<Rightarrow> lam \<Rightarrow> lam"
+ − 100
where
+ − 101
"perm_lam \<equiv> (perm::'x prm \<Rightarrow> rlam \<Rightarrow> rlam)"*)
+ − 102
+ − 103
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 104
thm perm_lam_def
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 105
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 106
(* lemmas that need to lift *)
234
+ − 107
lemma pi_var_com:
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 108
fixes pi::"'x prm"
234
+ − 109
shows "(pi\<bullet>rVar a) \<approx> rVar (pi\<bullet>a)"
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 110
sorry
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 111
234
+ − 112
lemma pi_app_com:
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 113
fixes pi::"'x prm"
234
+ − 114
shows "(pi\<bullet>rApp t1 t2) \<approx> rApp (pi\<bullet>t1) (pi\<bullet>t2)"
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 115
sorry
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 116
234
+ − 117
lemma pi_lam_com:
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 118
fixes pi::"'x prm"
234
+ − 119
shows "(pi\<bullet>rLam a t) \<approx> rLam (pi\<bullet>a) (pi\<bullet>t)"
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 120
sorry
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 121
201
+ − 122
lemma real_alpha:
242
+ − 123
assumes "t = [(a,b)]\<bullet>s" "a\<sharp>[b].s"
201
+ − 124
shows "Lam a t = Lam b s"
217
+ − 125
sorry
+ − 126
286
+ − 127
lemma perm_rsp:
+ − 128
"(op = ===> alpha ===> alpha) op \<bullet> op \<bullet>"
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 129
apply(auto)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 130
(* this is propably true if some type conditions are imposed ;o) *)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 131
sorry
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 132
286
+ − 133
lemma fresh_rsp:
+ − 134
"(op = ===> alpha ===> op =) fresh fresh"
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 135
apply(auto)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 136
(* this is probably only true if some type conditions are imposed *)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 137
sorry
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 138
234
+ − 139
lemma rVar_rsp: "(op = ===> alpha) rVar rVar"
+ − 140
apply(auto)
+ − 141
apply(rule a1)
+ − 142
apply(simp)
+ − 143
done
+ − 144
+ − 145
lemma rApp_rsp: "(alpha ===> alpha ===> alpha) rApp rApp"
+ − 146
apply(auto)
+ − 147
apply(rule a2)
+ − 148
apply (assumption)
+ − 149
apply (assumption)
+ − 150
done
+ − 151
+ − 152
lemma rLam_rsp: "(op = ===> alpha ===> alpha) rLam rLam"
229
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 153
apply(auto)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 154
apply(rule a3)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 155
apply(rule_tac t="[(x,x)]\<bullet>y" and s="y" in subst)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 156
apply(rule sym)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 157
apply(rule trans)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 158
apply(rule pt_name3)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 159
apply(rule at_ds1[OF at_name_inst])
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 160
apply(simp add: pt_name1)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 161
apply(assumption)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 162
apply(simp add: abs_fresh)
13f985a93dbc
fixed the definition of alpha; this *breaks* some of the experiments
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 163
done
217
+ − 164
247
+ − 165
lemma rfv_rsp: "(alpha ===> op =) rfv rfv"
+ − 166
sorry
217
+ − 167
285
+ − 168
lemma rvar_inject: "rVar a \<approx> rVar b = (a = b)"
+ − 169
apply (auto)
+ − 170
apply (erule alpha.cases)
+ − 171
apply (simp_all add: rlam.inject alpha_refl)
+ − 172
done
+ − 173
217
+ − 174
ML {* val qty = @{typ "lam"} *}
247
+ − 175
ML {* val defs = @{thms Var_def App_def Lam_def perm_lam_def fv_def} *}
271
+ − 176
ML {* val rsp_thms = @{thms perm_rsp fresh_rsp rVar_rsp rApp_rsp rLam_rsp rfv_rsp} @
+ − 177
@{thms ho_all_prs ho_ex_prs} *}
+ − 178
370
+ − 179
ML {* val (rty, rel, rel_refl, rel_eqv) = lookup_quot_data @{context} qty *}
+ − 180
ML {* val consts = lookup_quot_consts defs *}
+ − 181
ML {* val (trans2, reps_same, absrep, quot) = lookup_quot_thms @{context} "lam" *}
416
3f3927f793d4
Removing arguments of tactics: absrep, rel_refl, reps_same are computed.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 182
ML {* fun lift_tac_lam lthy t = lift_tac lthy t rel_eqv rel_refl rty [quot] trans2 rsp_thms reps_same absrep defs *}
237
+ − 183
376
+ − 184
lemma pi_var: "(pi\<Colon>('x \<times> 'x) list) \<bullet> Var a = Var (pi \<bullet> a)"
370
+ − 185
apply (tactic {* lift_tac_lam @{context} @{thm pi_var_com} 1 *})
+ − 186
done
+ − 187
376
+ − 188
lemma pi_app: "(pi\<Colon>('x \<times> 'x) list) \<bullet> App (x\<Colon>lam) (xa\<Colon>lam) = App (pi \<bullet> x) (pi \<bullet> xa)"
370
+ − 189
apply (tactic {* lift_tac_lam @{context} @{thm pi_app_com} 1 *})
+ − 190
done
376
+ − 191
+ − 192
lemma pi_lam: "(pi\<Colon>('x \<times> 'x) list) \<bullet> Lam (a\<Colon>name) (x\<Colon>lam) = Lam (pi \<bullet> a) (pi \<bullet> x)"
370
+ − 193
apply (tactic {* lift_tac_lam @{context} @{thm pi_lam_com} 1 *})
+ − 194
done
249
+ − 195
376
+ − 196
lemma fv_var: "fv (Var (a\<Colon>name)) = {a}"
370
+ − 197
apply (tactic {* lift_tac_lam @{context} @{thm rfv_var} 1 *})
+ − 198
done
376
+ − 199
+ − 200
lemma fv_app: "fv (App (x\<Colon>lam) (xa\<Colon>lam)) = fv x \<union> fv xa"
+ − 201
apply (tactic {* lift_tac_lam @{context} @{thm rfv_app} 1 *})
+ − 202
done
249
+ − 203
376
+ − 204
lemma fv_lam: "fv (Lam (a\<Colon>name) (x\<Colon>lam)) = fv x - {a}"
+ − 205
apply (tactic {* lift_tac_lam @{context} @{thm rfv_lam} 1 *})
+ − 206
done
+ − 207
+ − 208
lemma a1: "(a\<Colon>name) = (b\<Colon>name) \<Longrightarrow> Var a = Var b"
370
+ − 209
apply (tactic {* lift_tac_lam @{context} @{thm a1} 1 *})
+ − 210
done
376
+ − 211
+ − 212
lemma a2: "\<lbrakk>(x\<Colon>lam) = (xa\<Colon>lam); (xb\<Colon>lam) = (xc\<Colon>lam)\<rbrakk> \<Longrightarrow> App x xb = App xa xc"
370
+ − 213
apply (tactic {* lift_tac_lam @{context} @{thm a2} 1 *})
+ − 214
done
376
+ − 215
+ − 216
lemma a3: "\<lbrakk>(x\<Colon>lam) = [(a\<Colon>name, b\<Colon>name)] \<bullet> (xa\<Colon>lam); a \<notin> fv (Lam b x)\<rbrakk> \<Longrightarrow> Lam a x = Lam b xa"
+ − 217
apply (tactic {* lift_tac_lam @{context} @{thm a3} 1 *})
+ − 218
done
286
+ − 219
378
+ − 220
lemma alpha_cases: "\<lbrakk>a1 = a2; \<And>a b. \<lbrakk>a1 = Var a; a2 = Var b; a = b\<rbrakk> \<Longrightarrow> P;
+ − 221
\<And>x xa xb xc. \<lbrakk>a1 = App x xb; a2 = App xa xc; x = xa; xb = xc\<rbrakk> \<Longrightarrow> P;
+ − 222
\<And>x a b xa. \<lbrakk>a1 = Lam a x; a2 = Lam b xa; x = [(a, b)] \<bullet> xa; a \<notin> fv (Lam b x)\<rbrakk> \<Longrightarrow> P\<rbrakk>
370
+ − 223
\<Longrightarrow> P"
378
+ − 224
apply (tactic {* lift_tac_lam @{context} @{thm alpha.cases} 1 *})
+ − 225
done
+ − 226
+ − 227
lemma alpha_induct: "\<lbrakk>(qx\<Colon>lam) = (qxa\<Colon>lam); \<And>(a\<Colon>name) b\<Colon>name. a = b \<Longrightarrow> (qxb\<Colon>lam \<Rightarrow> lam \<Rightarrow> bool) (Var a) (Var b);
370
+ − 228
\<And>(x\<Colon>lam) (xa\<Colon>lam) (xb\<Colon>lam) xc\<Colon>lam. \<lbrakk>x = xa; qxb x xa; xb = xc; qxb xb xc\<rbrakk> \<Longrightarrow> qxb (App x xb) (App xa xc);
+ − 229
\<And>(x\<Colon>lam) (a\<Colon>name) (b\<Colon>name) xa\<Colon>lam.
+ − 230
\<lbrakk>x = [(a, b)] \<bullet> xa; qxb x ([(a, b)] \<bullet> xa); a \<notin> fv (Lam b x)\<rbrakk> \<Longrightarrow> qxb (Lam a x) (Lam b xa)\<rbrakk>
+ − 231
\<Longrightarrow> qxb qx qxa"
378
+ − 232
apply (tactic {* lift_tac_lam @{context} @{thm alpha.induct} 1 *})
+ − 233
done
252
e30997c88050
Regularize for equalities and a better tactic. "alpha.cases" now lifts.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 234
376
+ − 235
lemma var_inject: "(Var a = Var b) = (a = b)"
370
+ − 236
apply (tactic {* lift_tac_lam @{context} @{thm rvar_inject} 1 *})
+ − 237
done
285
+ − 238
249
+ − 239
lemma var_supp:
+ − 240
shows "supp (Var a) = ((supp a)::name set)"
+ − 241
apply(simp add: supp_def)
+ − 242
apply(simp add: pi_var)
+ − 243
apply(simp add: var_inject)
+ − 244
done
+ − 245
+ − 246
lemma var_fresh:
+ − 247
fixes a::"name"
+ − 248
shows "(a\<sharp>(Var b)) = (a\<sharp>b)"
+ − 249
apply(simp add: fresh_def)
+ − 250
apply(simp add: var_supp)
+ − 251
done
247
+ − 252
+ − 253
+ − 254
+ − 255
+ − 256
+ − 257
+ − 258
271
+ − 259
+ − 260
+ − 261
+ − 262
+ − 263
+ − 264
(* Construction Site code *)
+ − 265
+ − 266
+ − 267
259
+ − 268
+ − 269
+ − 270
+ − 271
271
+ − 272
237
+ − 273
fun
+ − 274
option_map::"('a \<Rightarrow> 'b) \<Rightarrow> ('a noption) \<Rightarrow> ('b noption)"
+ − 275
where
+ − 276
"option_map f (nSome x) = nSome (f x)"
+ − 277
| "option_map f nNone = nNone"
+ − 278
+ − 279
fun
+ − 280
option_rel
+ − 281
where
+ − 282
"option_rel r (nSome x) (nSome y) = r x y"
+ − 283
| "option_rel r _ _ = False"
+ − 284
+ − 285
declare [[map noption = (option_map, option_rel)]]
+ − 286
379
+ − 287
lemma "option_map id = id"
+ − 288
sorry
+ − 289
237
+ − 290
lemma OPT_QUOTIENT:
+ − 291
assumes q: "QUOTIENT R Abs Rep"
+ − 292
shows "QUOTIENT (option_rel R) (option_map Abs) (option_map Rep)"
+ − 293
apply (unfold QUOTIENT_def)
+ − 294
apply (auto)
+ − 295
using q
+ − 296
apply (unfold QUOTIENT_def)
+ − 297
apply (case_tac "a :: 'b noption")
+ − 298
apply (simp)
+ − 299
apply (simp)
+ − 300
apply (case_tac "a :: 'b noption")
+ − 301
apply (simp only: option_map.simps)
+ − 302
apply (subst option_rel.simps)
+ − 303
(* Simp starts hanging so don't know how to continue *)
+ − 304
sorry
+ − 305