15647
|
1 |
(* AUTOMATICALLY GENERATED, DO NOT EDIT! *)
|
|
2 |
|
14516
|
3 |
theory HOL4Prob = HOL4Real:
|
|
4 |
|
|
5 |
;setup_theory prob_extra
|
|
6 |
|
|
7 |
lemma BOOL_BOOL_CASES_THM: "ALL f. f = (%b. False) | f = (%b. True) | f = (%b. b) | f = Not"
|
|
8 |
by (import prob_extra BOOL_BOOL_CASES_THM)
|
|
9 |
|
|
10 |
lemma EVEN_ODD_BASIC: "EVEN 0 & ~ EVEN 1 & EVEN 2 & ~ ODD 0 & ODD 1 & ~ ODD 2"
|
|
11 |
by (import prob_extra EVEN_ODD_BASIC)
|
|
12 |
|
|
13 |
lemma EVEN_ODD_EXISTS_EQ: "ALL n. EVEN n = (EX m. n = 2 * m) & ODD n = (EX m. n = Suc (2 * m))"
|
|
14 |
by (import prob_extra EVEN_ODD_EXISTS_EQ)
|
|
15 |
|
|
16 |
lemma DIV_THEN_MULT: "ALL p q. Suc q * (p div Suc q) <= p"
|
|
17 |
by (import prob_extra DIV_THEN_MULT)
|
|
18 |
|
|
19 |
lemma DIV_TWO_UNIQUE: "(All::(nat => bool) => bool)
|
|
20 |
(%n::nat.
|
|
21 |
(All::(nat => bool) => bool)
|
|
22 |
(%q::nat.
|
|
23 |
(All::(nat => bool) => bool)
|
|
24 |
(%r::nat.
|
|
25 |
(op -->::bool => bool => bool)
|
|
26 |
((op &::bool => bool => bool)
|
|
27 |
((op =::nat => nat => bool) n
|
|
28 |
((op +::nat => nat => nat)
|
|
29 |
((op *::nat => nat => nat)
|
|
30 |
((number_of::bin => nat)
|
15647
|
31 |
((op BIT::bin => bit => bin)
|
|
32 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
33 |
(bit.B1::bit))
|
|
34 |
(bit.B0::bit)))
|
14516
|
35 |
q)
|
|
36 |
r))
|
|
37 |
((op |::bool => bool => bool)
|
|
38 |
((op =::nat => nat => bool) r (0::nat))
|
|
39 |
((op =::nat => nat => bool) r (1::nat))))
|
|
40 |
((op &::bool => bool => bool)
|
|
41 |
((op =::nat => nat => bool) q
|
|
42 |
((op div::nat => nat => nat) n
|
|
43 |
((number_of::bin => nat)
|
15647
|
44 |
((op BIT::bin => bit => bin)
|
|
45 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
46 |
(bit.B1::bit))
|
|
47 |
(bit.B0::bit)))))
|
14516
|
48 |
((op =::nat => nat => bool) r
|
|
49 |
((op mod::nat => nat => nat) n
|
|
50 |
((number_of::bin => nat)
|
15647
|
51 |
((op BIT::bin => bit => bin)
|
|
52 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
53 |
(bit.B1::bit))
|
|
54 |
(bit.B0::bit)))))))))"
|
14516
|
55 |
by (import prob_extra DIV_TWO_UNIQUE)
|
|
56 |
|
|
57 |
lemma DIVISION_TWO: "ALL n::nat.
|
|
58 |
n = (2::nat) * (n div (2::nat)) + n mod (2::nat) &
|
|
59 |
(n mod (2::nat) = (0::nat) | n mod (2::nat) = (1::nat))"
|
|
60 |
by (import prob_extra DIVISION_TWO)
|
|
61 |
|
|
62 |
lemma DIV_TWO: "ALL n::nat. n = (2::nat) * (n div (2::nat)) + n mod (2::nat)"
|
|
63 |
by (import prob_extra DIV_TWO)
|
|
64 |
|
|
65 |
lemma MOD_TWO: "ALL n. n mod 2 = (if EVEN n then 0 else 1)"
|
|
66 |
by (import prob_extra MOD_TWO)
|
|
67 |
|
|
68 |
lemma DIV_TWO_BASIC: "(0::nat) div (2::nat) = (0::nat) &
|
|
69 |
(1::nat) div (2::nat) = (0::nat) & (2::nat) div (2::nat) = (1::nat)"
|
|
70 |
by (import prob_extra DIV_TWO_BASIC)
|
|
71 |
|
|
72 |
lemma DIV_TWO_MONO: "(All::(nat => bool) => bool)
|
|
73 |
(%m::nat.
|
|
74 |
(All::(nat => bool) => bool)
|
|
75 |
(%n::nat.
|
|
76 |
(op -->::bool => bool => bool)
|
|
77 |
((op <::nat => nat => bool)
|
|
78 |
((op div::nat => nat => nat) m
|
|
79 |
((number_of::bin => nat)
|
15647
|
80 |
((op BIT::bin => bit => bin)
|
|
81 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
82 |
(bit.B1::bit))
|
|
83 |
(bit.B0::bit))))
|
14516
|
84 |
((op div::nat => nat => nat) n
|
|
85 |
((number_of::bin => nat)
|
15647
|
86 |
((op BIT::bin => bit => bin)
|
|
87 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
88 |
(bit.B1::bit))
|
|
89 |
(bit.B0::bit)))))
|
14516
|
90 |
((op <::nat => nat => bool) m n)))"
|
|
91 |
by (import prob_extra DIV_TWO_MONO)
|
|
92 |
|
|
93 |
lemma DIV_TWO_MONO_EVEN: "(All::(nat => bool) => bool)
|
|
94 |
(%m::nat.
|
|
95 |
(All::(nat => bool) => bool)
|
|
96 |
(%n::nat.
|
|
97 |
(op -->::bool => bool => bool) ((EVEN::nat => bool) n)
|
|
98 |
((op =::bool => bool => bool)
|
|
99 |
((op <::nat => nat => bool)
|
|
100 |
((op div::nat => nat => nat) m
|
|
101 |
((number_of::bin => nat)
|
15647
|
102 |
((op BIT::bin => bit => bin)
|
|
103 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
104 |
(bit.B1::bit))
|
|
105 |
(bit.B0::bit))))
|
14516
|
106 |
((op div::nat => nat => nat) n
|
|
107 |
((number_of::bin => nat)
|
15647
|
108 |
((op BIT::bin => bit => bin)
|
|
109 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
110 |
(bit.B1::bit))
|
|
111 |
(bit.B0::bit)))))
|
14516
|
112 |
((op <::nat => nat => bool) m n))))"
|
|
113 |
by (import prob_extra DIV_TWO_MONO_EVEN)
|
|
114 |
|
|
115 |
lemma DIV_TWO_CANCEL: "ALL n. 2 * n div 2 = n & Suc (2 * n) div 2 = n"
|
|
116 |
by (import prob_extra DIV_TWO_CANCEL)
|
|
117 |
|
|
118 |
lemma EXP_DIV_TWO: "ALL n::nat. (2::nat) ^ Suc n div (2::nat) = (2::nat) ^ n"
|
|
119 |
by (import prob_extra EXP_DIV_TWO)
|
|
120 |
|
|
121 |
lemma EVEN_EXP_TWO: "ALL n. EVEN (2 ^ n) = (n ~= 0)"
|
|
122 |
by (import prob_extra EVEN_EXP_TWO)
|
|
123 |
|
|
124 |
lemma DIV_TWO_EXP: "ALL (n::nat) k::nat.
|
|
125 |
(k div (2::nat) < (2::nat) ^ n) = (k < (2::nat) ^ Suc n)"
|
|
126 |
by (import prob_extra DIV_TWO_EXP)
|
|
127 |
|
|
128 |
consts
|
|
129 |
inf :: "(real => bool) => real"
|
|
130 |
|
|
131 |
defs
|
|
132 |
inf_primdef: "inf == %P. - sup (IMAGE uminus P)"
|
|
133 |
|
|
134 |
lemma inf_def: "ALL P. inf P = - sup (IMAGE uminus P)"
|
|
135 |
by (import prob_extra inf_def)
|
|
136 |
|
|
137 |
lemma INF_DEF_ALT: "ALL P. inf P = - sup (%r. P (- r))"
|
|
138 |
by (import prob_extra INF_DEF_ALT)
|
|
139 |
|
|
140 |
lemma REAL_SUP_EXISTS_UNIQUE: "(All::((real => bool) => bool) => bool)
|
|
141 |
(%P::real => bool.
|
|
142 |
(op -->::bool => bool => bool)
|
|
143 |
((op &::bool => bool => bool) ((Ex::(real => bool) => bool) P)
|
|
144 |
((Ex::(real => bool) => bool)
|
|
145 |
(%z::real.
|
|
146 |
(All::(real => bool) => bool)
|
|
147 |
(%x::real.
|
|
148 |
(op -->::bool => bool => bool) (P x)
|
|
149 |
((op <=::real => real => bool) x z)))))
|
|
150 |
((Ex1::(real => bool) => bool)
|
|
151 |
(%s::real.
|
|
152 |
(All::(real => bool) => bool)
|
|
153 |
(%y::real.
|
|
154 |
(op =::bool => bool => bool)
|
|
155 |
((Ex::(real => bool) => bool)
|
|
156 |
(%x::real.
|
|
157 |
(op &::bool => bool => bool) (P x)
|
|
158 |
((op <::real => real => bool) y x)))
|
|
159 |
((op <::real => real => bool) y s)))))"
|
|
160 |
by (import prob_extra REAL_SUP_EXISTS_UNIQUE)
|
|
161 |
|
|
162 |
lemma REAL_SUP_MAX: "(All::((real => bool) => bool) => bool)
|
|
163 |
(%P::real => bool.
|
|
164 |
(All::(real => bool) => bool)
|
|
165 |
(%z::real.
|
|
166 |
(op -->::bool => bool => bool)
|
|
167 |
((op &::bool => bool => bool) (P z)
|
|
168 |
((All::(real => bool) => bool)
|
|
169 |
(%x::real.
|
|
170 |
(op -->::bool => bool => bool) (P x)
|
|
171 |
((op <=::real => real => bool) x z))))
|
|
172 |
((op =::real => real => bool) ((sup::(real => bool) => real) P)
|
|
173 |
z)))"
|
|
174 |
by (import prob_extra REAL_SUP_MAX)
|
|
175 |
|
|
176 |
lemma REAL_INF_MIN: "(All::((real => bool) => bool) => bool)
|
|
177 |
(%P::real => bool.
|
|
178 |
(All::(real => bool) => bool)
|
|
179 |
(%z::real.
|
|
180 |
(op -->::bool => bool => bool)
|
|
181 |
((op &::bool => bool => bool) (P z)
|
|
182 |
((All::(real => bool) => bool)
|
|
183 |
(%x::real.
|
|
184 |
(op -->::bool => bool => bool) (P x)
|
|
185 |
((op <=::real => real => bool) z x))))
|
|
186 |
((op =::real => real => bool) ((inf::(real => bool) => real) P)
|
|
187 |
z)))"
|
|
188 |
by (import prob_extra REAL_INF_MIN)
|
|
189 |
|
|
190 |
lemma HALF_POS: "(0::real) < (1::real) / (2::real)"
|
|
191 |
by (import prob_extra HALF_POS)
|
|
192 |
|
|
193 |
lemma HALF_CANCEL: "(2::real) * ((1::real) / (2::real)) = (1::real)"
|
|
194 |
by (import prob_extra HALF_CANCEL)
|
|
195 |
|
|
196 |
lemma POW_HALF_POS: "ALL n::nat. (0::real) < ((1::real) / (2::real)) ^ n"
|
|
197 |
by (import prob_extra POW_HALF_POS)
|
|
198 |
|
|
199 |
lemma POW_HALF_MONO: "(All::(nat => bool) => bool)
|
|
200 |
(%m::nat.
|
|
201 |
(All::(nat => bool) => bool)
|
|
202 |
(%n::nat.
|
|
203 |
(op -->::bool => bool => bool) ((op <=::nat => nat => bool) m n)
|
|
204 |
((op <=::real => real => bool)
|
|
205 |
((op ^::real => nat => real)
|
|
206 |
((op /::real => real => real) (1::real)
|
|
207 |
((number_of::bin => real)
|
15647
|
208 |
((op BIT::bin => bit => bin)
|
|
209 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
210 |
(bit.B1::bit))
|
|
211 |
(bit.B0::bit))))
|
14516
|
212 |
n)
|
|
213 |
((op ^::real => nat => real)
|
|
214 |
((op /::real => real => real) (1::real)
|
|
215 |
((number_of::bin => real)
|
15647
|
216 |
((op BIT::bin => bit => bin)
|
|
217 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
218 |
(bit.B1::bit))
|
|
219 |
(bit.B0::bit))))
|
14516
|
220 |
m))))"
|
|
221 |
by (import prob_extra POW_HALF_MONO)
|
|
222 |
|
|
223 |
lemma POW_HALF_TWICE: "ALL n::nat.
|
|
224 |
((1::real) / (2::real)) ^ n = (2::real) * ((1::real) / (2::real)) ^ Suc n"
|
|
225 |
by (import prob_extra POW_HALF_TWICE)
|
|
226 |
|
|
227 |
lemma X_HALF_HALF: "ALL x::real. (1::real) / (2::real) * x + (1::real) / (2::real) * x = x"
|
|
228 |
by (import prob_extra X_HALF_HALF)
|
|
229 |
|
|
230 |
lemma REAL_SUP_LE_X: "(All::((real => bool) => bool) => bool)
|
|
231 |
(%P::real => bool.
|
|
232 |
(All::(real => bool) => bool)
|
|
233 |
(%x::real.
|
|
234 |
(op -->::bool => bool => bool)
|
|
235 |
((op &::bool => bool => bool) ((Ex::(real => bool) => bool) P)
|
|
236 |
((All::(real => bool) => bool)
|
|
237 |
(%r::real.
|
|
238 |
(op -->::bool => bool => bool) (P r)
|
|
239 |
((op <=::real => real => bool) r x))))
|
|
240 |
((op <=::real => real => bool) ((sup::(real => bool) => real) P)
|
|
241 |
x)))"
|
|
242 |
by (import prob_extra REAL_SUP_LE_X)
|
|
243 |
|
|
244 |
lemma REAL_X_LE_SUP: "(All::((real => bool) => bool) => bool)
|
|
245 |
(%P::real => bool.
|
|
246 |
(All::(real => bool) => bool)
|
|
247 |
(%x::real.
|
|
248 |
(op -->::bool => bool => bool)
|
|
249 |
((op &::bool => bool => bool) ((Ex::(real => bool) => bool) P)
|
|
250 |
((op &::bool => bool => bool)
|
|
251 |
((Ex::(real => bool) => bool)
|
|
252 |
(%z::real.
|
|
253 |
(All::(real => bool) => bool)
|
|
254 |
(%r::real.
|
|
255 |
(op -->::bool => bool => bool) (P r)
|
|
256 |
((op <=::real => real => bool) r z))))
|
|
257 |
((Ex::(real => bool) => bool)
|
|
258 |
(%r::real.
|
|
259 |
(op &::bool => bool => bool) (P r)
|
|
260 |
((op <=::real => real => bool) x r)))))
|
|
261 |
((op <=::real => real => bool) x
|
|
262 |
((sup::(real => bool) => real) P))))"
|
|
263 |
by (import prob_extra REAL_X_LE_SUP)
|
|
264 |
|
|
265 |
lemma ABS_BETWEEN_LE: "ALL (x::real) (y::real) d::real.
|
|
266 |
((0::real) <= d & x - d <= y & y <= x + d) = (abs (y - x) <= d)"
|
|
267 |
by (import prob_extra ABS_BETWEEN_LE)
|
|
268 |
|
|
269 |
lemma ONE_MINUS_HALF: "(1::real) - (1::real) / (2::real) = (1::real) / (2::real)"
|
|
270 |
by (import prob_extra ONE_MINUS_HALF)
|
|
271 |
|
|
272 |
lemma HALF_LT_1: "(1::real) / (2::real) < (1::real)"
|
|
273 |
by (import prob_extra HALF_LT_1)
|
|
274 |
|
|
275 |
lemma POW_HALF_EXP: "ALL n::nat. ((1::real) / (2::real)) ^ n = inverse (real ((2::nat) ^ n))"
|
|
276 |
by (import prob_extra POW_HALF_EXP)
|
|
277 |
|
|
278 |
lemma INV_SUC_POS: "ALL n. 0 < 1 / real (Suc n)"
|
|
279 |
by (import prob_extra INV_SUC_POS)
|
|
280 |
|
|
281 |
lemma INV_SUC_MAX: "ALL x. 1 / real (Suc x) <= 1"
|
|
282 |
by (import prob_extra INV_SUC_MAX)
|
|
283 |
|
|
284 |
lemma INV_SUC: "ALL n. 0 < 1 / real (Suc n) & 1 / real (Suc n) <= 1"
|
|
285 |
by (import prob_extra INV_SUC)
|
|
286 |
|
|
287 |
lemma ABS_UNIT_INTERVAL: "(All::(real => bool) => bool)
|
|
288 |
(%x::real.
|
|
289 |
(All::(real => bool) => bool)
|
|
290 |
(%y::real.
|
|
291 |
(op -->::bool => bool => bool)
|
|
292 |
((op &::bool => bool => bool)
|
|
293 |
((op <=::real => real => bool) (0::real) x)
|
|
294 |
((op &::bool => bool => bool)
|
|
295 |
((op <=::real => real => bool) x (1::real))
|
|
296 |
((op &::bool => bool => bool)
|
|
297 |
((op <=::real => real => bool) (0::real) y)
|
|
298 |
((op <=::real => real => bool) y (1::real)))))
|
|
299 |
((op <=::real => real => bool)
|
|
300 |
((abs::real => real) ((op -::real => real => real) x y))
|
|
301 |
(1::real))))"
|
|
302 |
by (import prob_extra ABS_UNIT_INTERVAL)
|
|
303 |
|
|
304 |
lemma MEM_NIL: "ALL l. (ALL x. ~ x mem l) = (l = [])"
|
|
305 |
by (import prob_extra MEM_NIL)
|
|
306 |
|
|
307 |
lemma MAP_MEM: "ALL f l x. x mem map f l = (EX y. y mem l & x = f y)"
|
|
308 |
by (import prob_extra MAP_MEM)
|
|
309 |
|
|
310 |
lemma MEM_NIL_MAP_CONS: "ALL x l. ~ [] mem map (op # x) l"
|
|
311 |
by (import prob_extra MEM_NIL_MAP_CONS)
|
|
312 |
|
|
313 |
lemma FILTER_TRUE: "ALL l. [x:l. True] = l"
|
|
314 |
by (import prob_extra FILTER_TRUE)
|
|
315 |
|
|
316 |
lemma FILTER_FALSE: "ALL l. [x:l. False] = []"
|
|
317 |
by (import prob_extra FILTER_FALSE)
|
|
318 |
|
|
319 |
lemma FILTER_MEM: "(All::(('a => bool) => bool) => bool)
|
|
320 |
(%P::'a => bool.
|
|
321 |
(All::('a => bool) => bool)
|
|
322 |
(%x::'a.
|
|
323 |
(All::('a list => bool) => bool)
|
|
324 |
(%l::'a list.
|
|
325 |
(op -->::bool => bool => bool)
|
|
326 |
((op mem::'a => 'a list => bool) x
|
|
327 |
((filter::('a => bool) => 'a list => 'a list) P l))
|
|
328 |
(P x))))"
|
|
329 |
by (import prob_extra FILTER_MEM)
|
|
330 |
|
|
331 |
lemma MEM_FILTER: "(All::(('a => bool) => bool) => bool)
|
|
332 |
(%P::'a => bool.
|
|
333 |
(All::('a list => bool) => bool)
|
|
334 |
(%l::'a list.
|
|
335 |
(All::('a => bool) => bool)
|
|
336 |
(%x::'a.
|
|
337 |
(op -->::bool => bool => bool)
|
|
338 |
((op mem::'a => 'a list => bool) x
|
|
339 |
((filter::('a => bool) => 'a list => 'a list) P l))
|
|
340 |
((op mem::'a => 'a list => bool) x l))))"
|
|
341 |
by (import prob_extra MEM_FILTER)
|
|
342 |
|
|
343 |
lemma FILTER_OUT_ELT: "ALL x l. x mem l | [y:l. y ~= x] = l"
|
|
344 |
by (import prob_extra FILTER_OUT_ELT)
|
|
345 |
|
|
346 |
lemma IS_PREFIX_NIL: "ALL x. IS_PREFIX x [] & IS_PREFIX [] x = (x = [])"
|
|
347 |
by (import prob_extra IS_PREFIX_NIL)
|
|
348 |
|
|
349 |
lemma IS_PREFIX_REFL: "ALL x. IS_PREFIX x x"
|
|
350 |
by (import prob_extra IS_PREFIX_REFL)
|
|
351 |
|
|
352 |
lemma IS_PREFIX_ANTISYM: "(All::('a list => bool) => bool)
|
|
353 |
(%x::'a list.
|
|
354 |
(All::('a list => bool) => bool)
|
|
355 |
(%y::'a list.
|
|
356 |
(op -->::bool => bool => bool)
|
|
357 |
((op &::bool => bool => bool)
|
|
358 |
((IS_PREFIX::'a list => 'a list => bool) y x)
|
|
359 |
((IS_PREFIX::'a list => 'a list => bool) x y))
|
|
360 |
((op =::'a list => 'a list => bool) x y)))"
|
|
361 |
by (import prob_extra IS_PREFIX_ANTISYM)
|
|
362 |
|
|
363 |
lemma IS_PREFIX_TRANS: "(All::('a list => bool) => bool)
|
|
364 |
(%x::'a list.
|
|
365 |
(All::('a list => bool) => bool)
|
|
366 |
(%y::'a list.
|
|
367 |
(All::('a list => bool) => bool)
|
|
368 |
(%z::'a list.
|
|
369 |
(op -->::bool => bool => bool)
|
|
370 |
((op &::bool => bool => bool)
|
|
371 |
((IS_PREFIX::'a list => 'a list => bool) x y)
|
|
372 |
((IS_PREFIX::'a list => 'a list => bool) y z))
|
|
373 |
((IS_PREFIX::'a list => 'a list => bool) x z))))"
|
|
374 |
by (import prob_extra IS_PREFIX_TRANS)
|
|
375 |
|
|
376 |
lemma IS_PREFIX_BUTLAST: "ALL x y. IS_PREFIX (x # y) (butlast (x # y))"
|
|
377 |
by (import prob_extra IS_PREFIX_BUTLAST)
|
|
378 |
|
|
379 |
lemma IS_PREFIX_LENGTH: "(All::('a list => bool) => bool)
|
|
380 |
(%x::'a list.
|
|
381 |
(All::('a list => bool) => bool)
|
|
382 |
(%y::'a list.
|
|
383 |
(op -->::bool => bool => bool)
|
|
384 |
((IS_PREFIX::'a list => 'a list => bool) y x)
|
|
385 |
((op <=::nat => nat => bool) ((size::'a list => nat) x)
|
|
386 |
((size::'a list => nat) y))))"
|
|
387 |
by (import prob_extra IS_PREFIX_LENGTH)
|
|
388 |
|
|
389 |
lemma IS_PREFIX_LENGTH_ANTI: "(All::('a list => bool) => bool)
|
|
390 |
(%x::'a list.
|
|
391 |
(All::('a list => bool) => bool)
|
|
392 |
(%y::'a list.
|
|
393 |
(op -->::bool => bool => bool)
|
|
394 |
((op &::bool => bool => bool)
|
|
395 |
((IS_PREFIX::'a list => 'a list => bool) y x)
|
|
396 |
((op =::nat => nat => bool) ((size::'a list => nat) x)
|
|
397 |
((size::'a list => nat) y)))
|
|
398 |
((op =::'a list => 'a list => bool) x y)))"
|
|
399 |
by (import prob_extra IS_PREFIX_LENGTH_ANTI)
|
|
400 |
|
|
401 |
lemma IS_PREFIX_SNOC: "ALL x y z. IS_PREFIX (SNOC x y) z = (IS_PREFIX y z | z = SNOC x y)"
|
|
402 |
by (import prob_extra IS_PREFIX_SNOC)
|
|
403 |
|
|
404 |
lemma FOLDR_MAP: "ALL (f::'b => 'c => 'c) (e::'c) (g::'a => 'b) l::'a list.
|
|
405 |
foldr f (map g l) e = foldr (%x::'a. f (g x)) l e"
|
|
406 |
by (import prob_extra FOLDR_MAP)
|
|
407 |
|
|
408 |
lemma LAST_MEM: "ALL h t. last (h # t) mem h # t"
|
|
409 |
by (import prob_extra LAST_MEM)
|
|
410 |
|
|
411 |
lemma LAST_MAP_CONS: "ALL (b::bool) (h::bool list) t::bool list list.
|
|
412 |
EX x::bool list. last (map (op # b) (h # t)) = b # x"
|
|
413 |
by (import prob_extra LAST_MAP_CONS)
|
|
414 |
|
|
415 |
lemma EXISTS_LONGEST: "(All::('a list => bool) => bool)
|
|
416 |
(%x::'a list.
|
|
417 |
(All::('a list list => bool) => bool)
|
|
418 |
(%y::'a list list.
|
|
419 |
(Ex::('a list => bool) => bool)
|
|
420 |
(%z::'a list.
|
|
421 |
(op &::bool => bool => bool)
|
|
422 |
((op mem::'a list => 'a list list => bool) z
|
|
423 |
((op #::'a list => 'a list list => 'a list list) x y))
|
|
424 |
((All::('a list => bool) => bool)
|
|
425 |
(%w::'a list.
|
|
426 |
(op -->::bool => bool => bool)
|
|
427 |
((op mem::'a list => 'a list list => bool) w
|
|
428 |
((op #::'a list => 'a list list => 'a list list) x
|
|
429 |
y))
|
|
430 |
((op <=::nat => nat => bool)
|
|
431 |
((size::'a list => nat) w)
|
|
432 |
((size::'a list => nat) z)))))))"
|
|
433 |
by (import prob_extra EXISTS_LONGEST)
|
|
434 |
|
|
435 |
lemma UNION_DEF_ALT: "ALL s t. pred_set.UNION s t = (%x. s x | t x)"
|
|
436 |
by (import prob_extra UNION_DEF_ALT)
|
|
437 |
|
|
438 |
lemma INTER_UNION_RDISTRIB: "ALL p q r.
|
|
439 |
pred_set.INTER (pred_set.UNION p q) r =
|
|
440 |
pred_set.UNION (pred_set.INTER p r) (pred_set.INTER q r)"
|
|
441 |
by (import prob_extra INTER_UNION_RDISTRIB)
|
|
442 |
|
|
443 |
lemma SUBSET_EQ: "ALL x xa. (x = xa) = (SUBSET x xa & SUBSET xa x)"
|
|
444 |
by (import prob_extra SUBSET_EQ)
|
|
445 |
|
|
446 |
lemma INTER_IS_EMPTY: "ALL s t. (pred_set.INTER s t = EMPTY) = (ALL x. ~ s x | ~ t x)"
|
|
447 |
by (import prob_extra INTER_IS_EMPTY)
|
|
448 |
|
|
449 |
lemma UNION_DISJOINT_SPLIT: "(All::(('a => bool) => bool) => bool)
|
|
450 |
(%s::'a => bool.
|
|
451 |
(All::(('a => bool) => bool) => bool)
|
|
452 |
(%t::'a => bool.
|
|
453 |
(All::(('a => bool) => bool) => bool)
|
|
454 |
(%u::'a => bool.
|
|
455 |
(op -->::bool => bool => bool)
|
|
456 |
((op &::bool => bool => bool)
|
|
457 |
((op =::('a => bool) => ('a => bool) => bool)
|
|
458 |
((pred_set.UNION::('a => bool)
|
|
459 |
=> ('a => bool) => 'a => bool)
|
|
460 |
s t)
|
|
461 |
((pred_set.UNION::('a => bool)
|
|
462 |
=> ('a => bool) => 'a => bool)
|
|
463 |
s u))
|
|
464 |
((op &::bool => bool => bool)
|
|
465 |
((op =::('a => bool) => ('a => bool) => bool)
|
|
466 |
((pred_set.INTER::('a => bool)
|
|
467 |
=> ('a => bool) => 'a => bool)
|
|
468 |
s t)
|
|
469 |
(EMPTY::'a => bool))
|
|
470 |
((op =::('a => bool) => ('a => bool) => bool)
|
|
471 |
((pred_set.INTER::('a => bool)
|
|
472 |
=> ('a => bool) => 'a => bool)
|
|
473 |
s u)
|
|
474 |
(EMPTY::'a => bool))))
|
|
475 |
((op =::('a => bool) => ('a => bool) => bool) t u))))"
|
|
476 |
by (import prob_extra UNION_DISJOINT_SPLIT)
|
|
477 |
|
|
478 |
lemma GSPEC_DEF_ALT: "ALL f. GSPEC f = (%v. EX x. (v, True) = f x)"
|
|
479 |
by (import prob_extra GSPEC_DEF_ALT)
|
|
480 |
|
|
481 |
;end_setup
|
|
482 |
|
|
483 |
;setup_theory prob_canon
|
|
484 |
|
|
485 |
consts
|
|
486 |
alg_twin :: "bool list => bool list => bool"
|
|
487 |
|
|
488 |
defs
|
|
489 |
alg_twin_primdef: "alg_twin == %x y. EX l. x = SNOC True l & y = SNOC False l"
|
|
490 |
|
|
491 |
lemma alg_twin_def: "ALL x y. alg_twin x y = (EX l. x = SNOC True l & y = SNOC False l)"
|
|
492 |
by (import prob_canon alg_twin_def)
|
|
493 |
|
|
494 |
constdefs
|
|
495 |
alg_order_tupled :: "bool list * bool list => bool"
|
|
496 |
"(op ==::(bool list * bool list => bool)
|
|
497 |
=> (bool list * bool list => bool) => prop)
|
|
498 |
(alg_order_tupled::bool list * bool list => bool)
|
|
499 |
((WFREC::(bool list * bool list => bool list * bool list => bool)
|
|
500 |
=> ((bool list * bool list => bool)
|
|
501 |
=> bool list * bool list => bool)
|
|
502 |
=> bool list * bool list => bool)
|
|
503 |
((Eps::((bool list * bool list => bool list * bool list => bool) => bool)
|
|
504 |
=> bool list * bool list => bool list * bool list => bool)
|
|
505 |
(%R::bool list * bool list => bool list * bool list => bool.
|
|
506 |
(op &::bool => bool => bool)
|
|
507 |
((WF::(bool list * bool list => bool list * bool list => bool)
|
|
508 |
=> bool)
|
|
509 |
R)
|
|
510 |
((All::(bool => bool) => bool)
|
|
511 |
(%h'::bool.
|
|
512 |
(All::(bool => bool) => bool)
|
|
513 |
(%h::bool.
|
|
514 |
(All::(bool list => bool) => bool)
|
|
515 |
(%t'::bool list.
|
|
516 |
(All::(bool list => bool) => bool)
|
|
517 |
(%t::bool list.
|
|
518 |
R ((Pair::bool list
|
|
519 |
=> bool list => bool list * bool list)
|
|
520 |
t t')
|
|
521 |
((Pair::bool list
|
|
522 |
=> bool list => bool list * bool list)
|
|
523 |
((op #::bool => bool list => bool list) h
|
|
524 |
t)
|
|
525 |
((op #::bool => bool list => bool list) h'
|
|
526 |
t')))))))))
|
|
527 |
(%alg_order_tupled::bool list * bool list => bool.
|
|
528 |
(split::(bool list => bool list => bool)
|
|
529 |
=> bool list * bool list => bool)
|
|
530 |
(%(v::bool list) v1::bool list.
|
|
531 |
(list_case::bool
|
|
532 |
=> (bool => bool list => bool) => bool list => bool)
|
|
533 |
((list_case::bool
|
|
534 |
=> (bool => bool list => bool)
|
|
535 |
=> bool list => bool)
|
|
536 |
(True::bool) (%(v8::bool) v9::bool list. True::bool) v1)
|
|
537 |
(%(v4::bool) v5::bool list.
|
|
538 |
(list_case::bool
|
|
539 |
=> (bool => bool list => bool)
|
|
540 |
=> bool list => bool)
|
|
541 |
(False::bool)
|
|
542 |
(%(v10::bool) v11::bool list.
|
|
543 |
(op |::bool => bool => bool)
|
|
544 |
((op &::bool => bool => bool)
|
|
545 |
((op =::bool => bool => bool) v4 (True::bool))
|
|
546 |
((op =::bool => bool => bool) v10 (False::bool)))
|
|
547 |
((op &::bool => bool => bool)
|
|
548 |
((op =::bool => bool => bool) v4 v10)
|
|
549 |
(alg_order_tupled
|
|
550 |
((Pair::bool list
|
|
551 |
=> bool list => bool list * bool list)
|
|
552 |
v5 v11))))
|
|
553 |
v1)
|
|
554 |
v)))"
|
|
555 |
|
|
556 |
lemma alg_order_tupled_primitive_def: "(op =::(bool list * bool list => bool)
|
|
557 |
=> (bool list * bool list => bool) => bool)
|
|
558 |
(alg_order_tupled::bool list * bool list => bool)
|
|
559 |
((WFREC::(bool list * bool list => bool list * bool list => bool)
|
|
560 |
=> ((bool list * bool list => bool)
|
|
561 |
=> bool list * bool list => bool)
|
|
562 |
=> bool list * bool list => bool)
|
|
563 |
((Eps::((bool list * bool list => bool list * bool list => bool) => bool)
|
|
564 |
=> bool list * bool list => bool list * bool list => bool)
|
|
565 |
(%R::bool list * bool list => bool list * bool list => bool.
|
|
566 |
(op &::bool => bool => bool)
|
|
567 |
((WF::(bool list * bool list => bool list * bool list => bool)
|
|
568 |
=> bool)
|
|
569 |
R)
|
|
570 |
((All::(bool => bool) => bool)
|
|
571 |
(%h'::bool.
|
|
572 |
(All::(bool => bool) => bool)
|
|
573 |
(%h::bool.
|
|
574 |
(All::(bool list => bool) => bool)
|
|
575 |
(%t'::bool list.
|
|
576 |
(All::(bool list => bool) => bool)
|
|
577 |
(%t::bool list.
|
|
578 |
R ((Pair::bool list
|
|
579 |
=> bool list => bool list * bool list)
|
|
580 |
t t')
|
|
581 |
((Pair::bool list
|
|
582 |
=> bool list => bool list * bool list)
|
|
583 |
((op #::bool => bool list => bool list) h
|
|
584 |
t)
|
|
585 |
((op #::bool => bool list => bool list) h'
|
|
586 |
t')))))))))
|
|
587 |
(%alg_order_tupled::bool list * bool list => bool.
|
|
588 |
(split::(bool list => bool list => bool)
|
|
589 |
=> bool list * bool list => bool)
|
|
590 |
(%(v::bool list) v1::bool list.
|
|
591 |
(list_case::bool
|
|
592 |
=> (bool => bool list => bool) => bool list => bool)
|
|
593 |
((list_case::bool
|
|
594 |
=> (bool => bool list => bool)
|
|
595 |
=> bool list => bool)
|
|
596 |
(True::bool) (%(v8::bool) v9::bool list. True::bool) v1)
|
|
597 |
(%(v4::bool) v5::bool list.
|
|
598 |
(list_case::bool
|
|
599 |
=> (bool => bool list => bool)
|
|
600 |
=> bool list => bool)
|
|
601 |
(False::bool)
|
|
602 |
(%(v10::bool) v11::bool list.
|
|
603 |
(op |::bool => bool => bool)
|
|
604 |
((op &::bool => bool => bool)
|
|
605 |
((op =::bool => bool => bool) v4 (True::bool))
|
|
606 |
((op =::bool => bool => bool) v10 (False::bool)))
|
|
607 |
((op &::bool => bool => bool)
|
|
608 |
((op =::bool => bool => bool) v4 v10)
|
|
609 |
(alg_order_tupled
|
|
610 |
((Pair::bool list
|
|
611 |
=> bool list => bool list * bool list)
|
|
612 |
v5 v11))))
|
|
613 |
v1)
|
|
614 |
v)))"
|
|
615 |
by (import prob_canon alg_order_tupled_primitive_def)
|
|
616 |
|
|
617 |
consts
|
|
618 |
alg_order :: "bool list => bool list => bool"
|
|
619 |
|
|
620 |
defs
|
|
621 |
alg_order_primdef: "alg_order == %x x1. alg_order_tupled (x, x1)"
|
|
622 |
|
|
623 |
lemma alg_order_curried_def: "ALL x x1. alg_order x x1 = alg_order_tupled (x, x1)"
|
|
624 |
by (import prob_canon alg_order_curried_def)
|
|
625 |
|
|
626 |
lemma alg_order_ind: "(All::((bool list => bool list => bool) => bool) => bool)
|
|
627 |
(%P::bool list => bool list => bool.
|
|
628 |
(op -->::bool => bool => bool)
|
|
629 |
((op &::bool => bool => bool)
|
|
630 |
((All::(bool => bool) => bool)
|
|
631 |
(%x::bool.
|
|
632 |
(All::(bool list => bool) => bool)
|
|
633 |
(%xa::bool list.
|
|
634 |
P ([]::bool list)
|
|
635 |
((op #::bool => bool list => bool list) x xa))))
|
|
636 |
((op &::bool => bool => bool) (P ([]::bool list) ([]::bool list))
|
|
637 |
((op &::bool => bool => bool)
|
|
638 |
((All::(bool => bool) => bool)
|
|
639 |
(%x::bool.
|
|
640 |
(All::(bool list => bool) => bool)
|
|
641 |
(%xa::bool list.
|
|
642 |
P ((op #::bool => bool list => bool list) x xa)
|
|
643 |
([]::bool list))))
|
|
644 |
((All::(bool => bool) => bool)
|
|
645 |
(%x::bool.
|
|
646 |
(All::(bool list => bool) => bool)
|
|
647 |
(%xa::bool list.
|
|
648 |
(All::(bool => bool) => bool)
|
|
649 |
(%xb::bool.
|
|
650 |
(All::(bool list => bool) => bool)
|
|
651 |
(%xc::bool list.
|
|
652 |
(op -->::bool => bool => bool) (P xa xc)
|
|
653 |
(P ((op #::bool => bool list => bool list)
|
|
654 |
x xa)
|
|
655 |
((op #::bool => bool list => bool list)
|
|
656 |
xb xc))))))))))
|
|
657 |
((All::(bool list => bool) => bool)
|
|
658 |
(%x::bool list. (All::(bool list => bool) => bool) (P x))))"
|
|
659 |
by (import prob_canon alg_order_ind)
|
|
660 |
|
|
661 |
lemma alg_order_def: "alg_order [] (v6 # v7) = True &
|
|
662 |
alg_order [] [] = True &
|
|
663 |
alg_order (v2 # v3) [] = False &
|
|
664 |
alg_order (h # t) (h' # t') =
|
|
665 |
(h = True & h' = False | h = h' & alg_order t t')"
|
|
666 |
by (import prob_canon alg_order_def)
|
|
667 |
|
|
668 |
consts
|
|
669 |
alg_sorted :: "bool list list => bool"
|
|
670 |
|
|
671 |
defs
|
|
672 |
alg_sorted_primdef: "alg_sorted ==
|
|
673 |
WFREC (SOME R. WF R & (ALL x z y. R (y # z) (x # y # z)))
|
|
674 |
(%alg_sorted.
|
|
675 |
list_case True
|
|
676 |
(%v2. list_case True
|
|
677 |
(%v6 v7. alg_order v2 v6 & alg_sorted (v6 # v7))))"
|
|
678 |
|
|
679 |
lemma alg_sorted_primitive_def: "alg_sorted =
|
|
680 |
WFREC (SOME R. WF R & (ALL x z y. R (y # z) (x # y # z)))
|
|
681 |
(%alg_sorted.
|
|
682 |
list_case True
|
|
683 |
(%v2. list_case True
|
|
684 |
(%v6 v7. alg_order v2 v6 & alg_sorted (v6 # v7))))"
|
|
685 |
by (import prob_canon alg_sorted_primitive_def)
|
|
686 |
|
|
687 |
lemma alg_sorted_ind: "(All::((bool list list => bool) => bool) => bool)
|
|
688 |
(%P::bool list list => bool.
|
|
689 |
(op -->::bool => bool => bool)
|
|
690 |
((op &::bool => bool => bool)
|
|
691 |
((All::(bool list => bool) => bool)
|
|
692 |
(%x::bool list.
|
|
693 |
(All::(bool list => bool) => bool)
|
|
694 |
(%y::bool list.
|
|
695 |
(All::(bool list list => bool) => bool)
|
|
696 |
(%z::bool list list.
|
|
697 |
(op -->::bool => bool => bool)
|
|
698 |
(P ((op #::bool list
|
|
699 |
=> bool list list => bool list list)
|
|
700 |
y z))
|
|
701 |
(P ((op #::bool list
|
|
702 |
=> bool list list => bool list list)
|
|
703 |
x ((op #::bool list
|
|
704 |
=> bool list list => bool list list)
|
|
705 |
y z)))))))
|
|
706 |
((op &::bool => bool => bool)
|
|
707 |
((All::(bool list => bool) => bool)
|
|
708 |
(%v::bool list.
|
|
709 |
P ((op #::bool list => bool list list => bool list list) v
|
|
710 |
([]::bool list list))))
|
|
711 |
(P ([]::bool list list))))
|
|
712 |
((All::(bool list list => bool) => bool) P))"
|
|
713 |
by (import prob_canon alg_sorted_ind)
|
|
714 |
|
|
715 |
lemma alg_sorted_def: "alg_sorted (x # y # z) = (alg_order x y & alg_sorted (y # z)) &
|
|
716 |
alg_sorted [v] = True & alg_sorted [] = True"
|
|
717 |
by (import prob_canon alg_sorted_def)
|
|
718 |
|
|
719 |
consts
|
|
720 |
alg_prefixfree :: "bool list list => bool"
|
|
721 |
|
|
722 |
defs
|
|
723 |
alg_prefixfree_primdef: "alg_prefixfree ==
|
|
724 |
WFREC (SOME R. WF R & (ALL x z y. R (y # z) (x # y # z)))
|
|
725 |
(%alg_prefixfree.
|
|
726 |
list_case True
|
|
727 |
(%v2. list_case True
|
|
728 |
(%v6 v7. ~ IS_PREFIX v6 v2 & alg_prefixfree (v6 # v7))))"
|
|
729 |
|
|
730 |
lemma alg_prefixfree_primitive_def: "alg_prefixfree =
|
|
731 |
WFREC (SOME R. WF R & (ALL x z y. R (y # z) (x # y # z)))
|
|
732 |
(%alg_prefixfree.
|
|
733 |
list_case True
|
|
734 |
(%v2. list_case True
|
|
735 |
(%v6 v7. ~ IS_PREFIX v6 v2 & alg_prefixfree (v6 # v7))))"
|
|
736 |
by (import prob_canon alg_prefixfree_primitive_def)
|
|
737 |
|
|
738 |
lemma alg_prefixfree_ind: "(All::((bool list list => bool) => bool) => bool)
|
|
739 |
(%P::bool list list => bool.
|
|
740 |
(op -->::bool => bool => bool)
|
|
741 |
((op &::bool => bool => bool)
|
|
742 |
((All::(bool list => bool) => bool)
|
|
743 |
(%x::bool list.
|
|
744 |
(All::(bool list => bool) => bool)
|
|
745 |
(%y::bool list.
|
|
746 |
(All::(bool list list => bool) => bool)
|
|
747 |
(%z::bool list list.
|
|
748 |
(op -->::bool => bool => bool)
|
|
749 |
(P ((op #::bool list
|
|
750 |
=> bool list list => bool list list)
|
|
751 |
y z))
|
|
752 |
(P ((op #::bool list
|
|
753 |
=> bool list list => bool list list)
|
|
754 |
x ((op #::bool list
|
|
755 |
=> bool list list => bool list list)
|
|
756 |
y z)))))))
|
|
757 |
((op &::bool => bool => bool)
|
|
758 |
((All::(bool list => bool) => bool)
|
|
759 |
(%v::bool list.
|
|
760 |
P ((op #::bool list => bool list list => bool list list) v
|
|
761 |
([]::bool list list))))
|
|
762 |
(P ([]::bool list list))))
|
|
763 |
((All::(bool list list => bool) => bool) P))"
|
|
764 |
by (import prob_canon alg_prefixfree_ind)
|
|
765 |
|
|
766 |
lemma alg_prefixfree_def: "alg_prefixfree (x # y # z) = (~ IS_PREFIX y x & alg_prefixfree (y # z)) &
|
|
767 |
alg_prefixfree [v] = True & alg_prefixfree [] = True"
|
|
768 |
by (import prob_canon alg_prefixfree_def)
|
|
769 |
|
|
770 |
consts
|
|
771 |
alg_twinfree :: "bool list list => bool"
|
|
772 |
|
|
773 |
defs
|
|
774 |
alg_twinfree_primdef: "alg_twinfree ==
|
|
775 |
WFREC (SOME R. WF R & (ALL x z y. R (y # z) (x # y # z)))
|
|
776 |
(%alg_twinfree.
|
|
777 |
list_case True
|
|
778 |
(%v2. list_case True
|
|
779 |
(%v6 v7. ~ alg_twin v2 v6 & alg_twinfree (v6 # v7))))"
|
|
780 |
|
|
781 |
lemma alg_twinfree_primitive_def: "alg_twinfree =
|
|
782 |
WFREC (SOME R. WF R & (ALL x z y. R (y # z) (x # y # z)))
|
|
783 |
(%alg_twinfree.
|
|
784 |
list_case True
|
|
785 |
(%v2. list_case True
|
|
786 |
(%v6 v7. ~ alg_twin v2 v6 & alg_twinfree (v6 # v7))))"
|
|
787 |
by (import prob_canon alg_twinfree_primitive_def)
|
|
788 |
|
|
789 |
lemma alg_twinfree_ind: "(All::((bool list list => bool) => bool) => bool)
|
|
790 |
(%P::bool list list => bool.
|
|
791 |
(op -->::bool => bool => bool)
|
|
792 |
((op &::bool => bool => bool)
|
|
793 |
((All::(bool list => bool) => bool)
|
|
794 |
(%x::bool list.
|
|
795 |
(All::(bool list => bool) => bool)
|
|
796 |
(%y::bool list.
|
|
797 |
(All::(bool list list => bool) => bool)
|
|
798 |
(%z::bool list list.
|
|
799 |
(op -->::bool => bool => bool)
|
|
800 |
(P ((op #::bool list
|
|
801 |
=> bool list list => bool list list)
|
|
802 |
y z))
|
|
803 |
(P ((op #::bool list
|
|
804 |
=> bool list list => bool list list)
|
|
805 |
x ((op #::bool list
|
|
806 |
=> bool list list => bool list list)
|
|
807 |
y z)))))))
|
|
808 |
((op &::bool => bool => bool)
|
|
809 |
((All::(bool list => bool) => bool)
|
|
810 |
(%v::bool list.
|
|
811 |
P ((op #::bool list => bool list list => bool list list) v
|
|
812 |
([]::bool list list))))
|
|
813 |
(P ([]::bool list list))))
|
|
814 |
((All::(bool list list => bool) => bool) P))"
|
|
815 |
by (import prob_canon alg_twinfree_ind)
|
|
816 |
|
|
817 |
lemma alg_twinfree_def: "alg_twinfree (x # y # z) = (~ alg_twin x y & alg_twinfree (y # z)) &
|
|
818 |
alg_twinfree [v] = True & alg_twinfree [] = True"
|
|
819 |
by (import prob_canon alg_twinfree_def)
|
|
820 |
|
|
821 |
consts
|
|
822 |
alg_longest :: "bool list list => nat"
|
|
823 |
|
|
824 |
defs
|
|
825 |
alg_longest_primdef: "alg_longest == FOLDR (%h t. if t <= length h then length h else t) 0"
|
|
826 |
|
|
827 |
lemma alg_longest_def: "alg_longest = FOLDR (%h t. if t <= length h then length h else t) 0"
|
|
828 |
by (import prob_canon alg_longest_def)
|
|
829 |
|
|
830 |
consts
|
|
831 |
alg_canon_prefs :: "bool list => bool list list => bool list list"
|
|
832 |
|
|
833 |
specification (alg_canon_prefs_primdef: alg_canon_prefs) alg_canon_prefs_def: "(ALL l. alg_canon_prefs l [] = [l]) &
|
|
834 |
(ALL l h t.
|
|
835 |
alg_canon_prefs l (h # t) =
|
|
836 |
(if IS_PREFIX h l then alg_canon_prefs l t else l # h # t))"
|
|
837 |
by (import prob_canon alg_canon_prefs_def)
|
|
838 |
|
|
839 |
consts
|
|
840 |
alg_canon_find :: "bool list => bool list list => bool list list"
|
|
841 |
|
|
842 |
specification (alg_canon_find_primdef: alg_canon_find) alg_canon_find_def: "(ALL l. alg_canon_find l [] = [l]) &
|
|
843 |
(ALL l h t.
|
|
844 |
alg_canon_find l (h # t) =
|
|
845 |
(if alg_order h l
|
|
846 |
then if IS_PREFIX l h then h # t else h # alg_canon_find l t
|
|
847 |
else alg_canon_prefs l (h # t)))"
|
|
848 |
by (import prob_canon alg_canon_find_def)
|
|
849 |
|
|
850 |
consts
|
|
851 |
alg_canon1 :: "bool list list => bool list list"
|
|
852 |
|
|
853 |
defs
|
|
854 |
alg_canon1_primdef: "alg_canon1 == FOLDR alg_canon_find []"
|
|
855 |
|
|
856 |
lemma alg_canon1_def: "alg_canon1 = FOLDR alg_canon_find []"
|
|
857 |
by (import prob_canon alg_canon1_def)
|
|
858 |
|
|
859 |
consts
|
|
860 |
alg_canon_merge :: "bool list => bool list list => bool list list"
|
|
861 |
|
|
862 |
specification (alg_canon_merge_primdef: alg_canon_merge) alg_canon_merge_def: "(ALL l. alg_canon_merge l [] = [l]) &
|
|
863 |
(ALL l h t.
|
|
864 |
alg_canon_merge l (h # t) =
|
|
865 |
(if alg_twin l h then alg_canon_merge (butlast h) t else l # h # t))"
|
|
866 |
by (import prob_canon alg_canon_merge_def)
|
|
867 |
|
|
868 |
consts
|
|
869 |
alg_canon2 :: "bool list list => bool list list"
|
|
870 |
|
|
871 |
defs
|
|
872 |
alg_canon2_primdef: "alg_canon2 == FOLDR alg_canon_merge []"
|
|
873 |
|
|
874 |
lemma alg_canon2_def: "alg_canon2 = FOLDR alg_canon_merge []"
|
|
875 |
by (import prob_canon alg_canon2_def)
|
|
876 |
|
|
877 |
consts
|
|
878 |
alg_canon :: "bool list list => bool list list"
|
|
879 |
|
|
880 |
defs
|
|
881 |
alg_canon_primdef: "alg_canon == %l. alg_canon2 (alg_canon1 l)"
|
|
882 |
|
|
883 |
lemma alg_canon_def: "ALL l. alg_canon l = alg_canon2 (alg_canon1 l)"
|
|
884 |
by (import prob_canon alg_canon_def)
|
|
885 |
|
|
886 |
consts
|
|
887 |
algebra_canon :: "bool list list => bool"
|
|
888 |
|
|
889 |
defs
|
|
890 |
algebra_canon_primdef: "algebra_canon == %l. alg_canon l = l"
|
|
891 |
|
|
892 |
lemma algebra_canon_def: "ALL l. algebra_canon l = (alg_canon l = l)"
|
|
893 |
by (import prob_canon algebra_canon_def)
|
|
894 |
|
|
895 |
lemma ALG_TWIN_NIL: "ALL l. ~ alg_twin l [] & ~ alg_twin [] l"
|
|
896 |
by (import prob_canon ALG_TWIN_NIL)
|
|
897 |
|
|
898 |
lemma ALG_TWIN_SING: "ALL x l.
|
|
899 |
alg_twin [x] l = (x = True & l = [False]) &
|
|
900 |
alg_twin l [x] = (l = [True] & x = False)"
|
|
901 |
by (import prob_canon ALG_TWIN_SING)
|
|
902 |
|
|
903 |
lemma ALG_TWIN_CONS: "ALL x y z h t.
|
|
904 |
alg_twin (x # y # z) (h # t) = (x = h & alg_twin (y # z) t) &
|
|
905 |
alg_twin (h # t) (x # y # z) = (x = h & alg_twin t (y # z))"
|
|
906 |
by (import prob_canon ALG_TWIN_CONS)
|
|
907 |
|
|
908 |
lemma ALG_TWIN_REDUCE: "ALL h t t'. alg_twin (h # t) (h # t') = alg_twin t t'"
|
|
909 |
by (import prob_canon ALG_TWIN_REDUCE)
|
|
910 |
|
|
911 |
lemma ALG_TWINS_PREFIX: "(All::(bool list => bool) => bool)
|
|
912 |
(%x::bool list.
|
|
913 |
(All::(bool list => bool) => bool)
|
|
914 |
(%l::bool list.
|
|
915 |
(op -->::bool => bool => bool)
|
|
916 |
((IS_PREFIX::bool list => bool list => bool) x l)
|
|
917 |
((op |::bool => bool => bool)
|
|
918 |
((op =::bool list => bool list => bool) x l)
|
|
919 |
((op |::bool => bool => bool)
|
|
920 |
((IS_PREFIX::bool list => bool list => bool) x
|
|
921 |
((SNOC::bool => bool list => bool list) (True::bool) l))
|
|
922 |
((IS_PREFIX::bool list => bool list => bool) x
|
|
923 |
((SNOC::bool => bool list => bool list) (False::bool)
|
|
924 |
l))))))"
|
|
925 |
by (import prob_canon ALG_TWINS_PREFIX)
|
|
926 |
|
|
927 |
lemma ALG_ORDER_NIL: "ALL x. alg_order [] x & alg_order x [] = (x = [])"
|
|
928 |
by (import prob_canon ALG_ORDER_NIL)
|
|
929 |
|
|
930 |
lemma ALG_ORDER_REFL: "ALL x. alg_order x x"
|
|
931 |
by (import prob_canon ALG_ORDER_REFL)
|
|
932 |
|
|
933 |
lemma ALG_ORDER_ANTISYM: "(All::(bool list => bool) => bool)
|
|
934 |
(%x::bool list.
|
|
935 |
(All::(bool list => bool) => bool)
|
|
936 |
(%y::bool list.
|
|
937 |
(op -->::bool => bool => bool)
|
|
938 |
((op &::bool => bool => bool)
|
|
939 |
((alg_order::bool list => bool list => bool) x y)
|
|
940 |
((alg_order::bool list => bool list => bool) y x))
|
|
941 |
((op =::bool list => bool list => bool) x y)))"
|
|
942 |
by (import prob_canon ALG_ORDER_ANTISYM)
|
|
943 |
|
|
944 |
lemma ALG_ORDER_TRANS: "(All::(bool list => bool) => bool)
|
|
945 |
(%x::bool list.
|
|
946 |
(All::(bool list => bool) => bool)
|
|
947 |
(%y::bool list.
|
|
948 |
(All::(bool list => bool) => bool)
|
|
949 |
(%z::bool list.
|
|
950 |
(op -->::bool => bool => bool)
|
|
951 |
((op &::bool => bool => bool)
|
|
952 |
((alg_order::bool list => bool list => bool) x y)
|
|
953 |
((alg_order::bool list => bool list => bool) y z))
|
|
954 |
((alg_order::bool list => bool list => bool) x z))))"
|
|
955 |
by (import prob_canon ALG_ORDER_TRANS)
|
|
956 |
|
|
957 |
lemma ALG_ORDER_TOTAL: "ALL x y. alg_order x y | alg_order y x"
|
|
958 |
by (import prob_canon ALG_ORDER_TOTAL)
|
|
959 |
|
|
960 |
lemma ALG_ORDER_PREFIX: "(All::(bool list => bool) => bool)
|
|
961 |
(%x::bool list.
|
|
962 |
(All::(bool list => bool) => bool)
|
|
963 |
(%y::bool list.
|
|
964 |
(op -->::bool => bool => bool)
|
|
965 |
((IS_PREFIX::bool list => bool list => bool) y x)
|
|
966 |
((alg_order::bool list => bool list => bool) x y)))"
|
|
967 |
by (import prob_canon ALG_ORDER_PREFIX)
|
|
968 |
|
|
969 |
lemma ALG_ORDER_PREFIX_ANTI: "(All::(bool list => bool) => bool)
|
|
970 |
(%x::bool list.
|
|
971 |
(All::(bool list => bool) => bool)
|
|
972 |
(%y::bool list.
|
|
973 |
(op -->::bool => bool => bool)
|
|
974 |
((op &::bool => bool => bool)
|
|
975 |
((alg_order::bool list => bool list => bool) x y)
|
|
976 |
((IS_PREFIX::bool list => bool list => bool) x y))
|
|
977 |
((op =::bool list => bool list => bool) x y)))"
|
|
978 |
by (import prob_canon ALG_ORDER_PREFIX_ANTI)
|
|
979 |
|
|
980 |
lemma ALG_ORDER_PREFIX_MONO: "(All::(bool list => bool) => bool)
|
|
981 |
(%x::bool list.
|
|
982 |
(All::(bool list => bool) => bool)
|
|
983 |
(%y::bool list.
|
|
984 |
(All::(bool list => bool) => bool)
|
|
985 |
(%z::bool list.
|
|
986 |
(op -->::bool => bool => bool)
|
|
987 |
((op &::bool => bool => bool)
|
|
988 |
((alg_order::bool list => bool list => bool) x y)
|
|
989 |
((op &::bool => bool => bool)
|
|
990 |
((alg_order::bool list => bool list => bool) y z)
|
|
991 |
((IS_PREFIX::bool list => bool list => bool) z x)))
|
|
992 |
((IS_PREFIX::bool list => bool list => bool) y x))))"
|
|
993 |
by (import prob_canon ALG_ORDER_PREFIX_MONO)
|
|
994 |
|
|
995 |
lemma ALG_ORDER_PREFIX_TRANS: "(All::(bool list => bool) => bool)
|
|
996 |
(%x::bool list.
|
|
997 |
(All::(bool list => bool) => bool)
|
|
998 |
(%y::bool list.
|
|
999 |
(All::(bool list => bool) => bool)
|
|
1000 |
(%z::bool list.
|
|
1001 |
(op -->::bool => bool => bool)
|
|
1002 |
((op &::bool => bool => bool)
|
|
1003 |
((alg_order::bool list => bool list => bool) x y)
|
|
1004 |
((IS_PREFIX::bool list => bool list => bool) y z))
|
|
1005 |
((op |::bool => bool => bool)
|
|
1006 |
((alg_order::bool list => bool list => bool) x z)
|
|
1007 |
((IS_PREFIX::bool list => bool list => bool) x z)))))"
|
|
1008 |
by (import prob_canon ALG_ORDER_PREFIX_TRANS)
|
|
1009 |
|
|
1010 |
lemma ALG_ORDER_SNOC: "ALL x l. ~ alg_order (SNOC x l) l"
|
|
1011 |
by (import prob_canon ALG_ORDER_SNOC)
|
|
1012 |
|
|
1013 |
lemma ALG_SORTED_MIN: "(All::(bool list => bool) => bool)
|
|
1014 |
(%h::bool list.
|
|
1015 |
(All::(bool list list => bool) => bool)
|
|
1016 |
(%t::bool list list.
|
|
1017 |
(op -->::bool => bool => bool)
|
|
1018 |
((alg_sorted::bool list list => bool)
|
|
1019 |
((op #::bool list => bool list list => bool list list) h t))
|
|
1020 |
((All::(bool list => bool) => bool)
|
|
1021 |
(%x::bool list.
|
|
1022 |
(op -->::bool => bool => bool)
|
|
1023 |
((op mem::bool list => bool list list => bool) x t)
|
|
1024 |
((alg_order::bool list => bool list => bool) h x)))))"
|
|
1025 |
by (import prob_canon ALG_SORTED_MIN)
|
|
1026 |
|
|
1027 |
lemma ALG_SORTED_DEF_ALT: "(All::(bool list => bool) => bool)
|
|
1028 |
(%h::bool list.
|
|
1029 |
(All::(bool list list => bool) => bool)
|
|
1030 |
(%t::bool list list.
|
|
1031 |
(op =::bool => bool => bool)
|
|
1032 |
((alg_sorted::bool list list => bool)
|
|
1033 |
((op #::bool list => bool list list => bool list list) h t))
|
|
1034 |
((op &::bool => bool => bool)
|
|
1035 |
((All::(bool list => bool) => bool)
|
|
1036 |
(%x::bool list.
|
|
1037 |
(op -->::bool => bool => bool)
|
|
1038 |
((op mem::bool list => bool list list => bool) x t)
|
|
1039 |
((alg_order::bool list => bool list => bool) h x)))
|
|
1040 |
((alg_sorted::bool list list => bool) t))))"
|
|
1041 |
by (import prob_canon ALG_SORTED_DEF_ALT)
|
|
1042 |
|
|
1043 |
lemma ALG_SORTED_TL: "(All::(bool list => bool) => bool)
|
|
1044 |
(%h::bool list.
|
|
1045 |
(All::(bool list list => bool) => bool)
|
|
1046 |
(%t::bool list list.
|
|
1047 |
(op -->::bool => bool => bool)
|
|
1048 |
((alg_sorted::bool list list => bool)
|
|
1049 |
((op #::bool list => bool list list => bool list list) h t))
|
|
1050 |
((alg_sorted::bool list list => bool) t)))"
|
|
1051 |
by (import prob_canon ALG_SORTED_TL)
|
|
1052 |
|
|
1053 |
lemma ALG_SORTED_MONO: "(All::(bool list => bool) => bool)
|
|
1054 |
(%x::bool list.
|
|
1055 |
(All::(bool list => bool) => bool)
|
|
1056 |
(%y::bool list.
|
|
1057 |
(All::(bool list list => bool) => bool)
|
|
1058 |
(%z::bool list list.
|
|
1059 |
(op -->::bool => bool => bool)
|
|
1060 |
((alg_sorted::bool list list => bool)
|
|
1061 |
((op #::bool list => bool list list => bool list list) x
|
|
1062 |
((op #::bool list => bool list list => bool list list) y
|
|
1063 |
z)))
|
|
1064 |
((alg_sorted::bool list list => bool)
|
|
1065 |
((op #::bool list => bool list list => bool list list) x
|
|
1066 |
z)))))"
|
|
1067 |
by (import prob_canon ALG_SORTED_MONO)
|
|
1068 |
|
|
1069 |
lemma ALG_SORTED_TLS: "ALL l b. alg_sorted (map (op # b) l) = alg_sorted l"
|
|
1070 |
by (import prob_canon ALG_SORTED_TLS)
|
|
1071 |
|
|
1072 |
lemma ALG_SORTED_STEP: "ALL l1 l2.
|
|
1073 |
alg_sorted (map (op # True) l1 @ map (op # False) l2) =
|
|
1074 |
(alg_sorted l1 & alg_sorted l2)"
|
|
1075 |
by (import prob_canon ALG_SORTED_STEP)
|
|
1076 |
|
|
1077 |
lemma ALG_SORTED_APPEND: "ALL h h' t t'.
|
|
1078 |
alg_sorted ((h # t) @ h' # t') =
|
|
1079 |
(alg_sorted (h # t) & alg_sorted (h' # t') & alg_order (last (h # t)) h')"
|
|
1080 |
by (import prob_canon ALG_SORTED_APPEND)
|
|
1081 |
|
|
1082 |
lemma ALG_SORTED_FILTER: "(All::((bool list => bool) => bool) => bool)
|
|
1083 |
(%P::bool list => bool.
|
|
1084 |
(All::(bool list list => bool) => bool)
|
|
1085 |
(%b::bool list list.
|
|
1086 |
(op -->::bool => bool => bool)
|
|
1087 |
((alg_sorted::bool list list => bool) b)
|
|
1088 |
((alg_sorted::bool list list => bool)
|
|
1089 |
((filter::(bool list => bool)
|
|
1090 |
=> bool list list => bool list list)
|
|
1091 |
P b))))"
|
|
1092 |
by (import prob_canon ALG_SORTED_FILTER)
|
|
1093 |
|
|
1094 |
lemma ALG_PREFIXFREE_TL: "(All::(bool list => bool) => bool)
|
|
1095 |
(%h::bool list.
|
|
1096 |
(All::(bool list list => bool) => bool)
|
|
1097 |
(%t::bool list list.
|
|
1098 |
(op -->::bool => bool => bool)
|
|
1099 |
((alg_prefixfree::bool list list => bool)
|
|
1100 |
((op #::bool list => bool list list => bool list list) h t))
|
|
1101 |
((alg_prefixfree::bool list list => bool) t)))"
|
|
1102 |
by (import prob_canon ALG_PREFIXFREE_TL)
|
|
1103 |
|
|
1104 |
lemma ALG_PREFIXFREE_MONO: "(All::(bool list => bool) => bool)
|
|
1105 |
(%x::bool list.
|
|
1106 |
(All::(bool list => bool) => bool)
|
|
1107 |
(%y::bool list.
|
|
1108 |
(All::(bool list list => bool) => bool)
|
|
1109 |
(%z::bool list list.
|
|
1110 |
(op -->::bool => bool => bool)
|
|
1111 |
((op &::bool => bool => bool)
|
|
1112 |
((alg_sorted::bool list list => bool)
|
|
1113 |
((op #::bool list => bool list list => bool list list) x
|
|
1114 |
((op #::bool list => bool list list => bool list list)
|
|
1115 |
y z)))
|
|
1116 |
((alg_prefixfree::bool list list => bool)
|
|
1117 |
((op #::bool list => bool list list => bool list list) x
|
|
1118 |
((op #::bool list => bool list list => bool list list)
|
|
1119 |
y z))))
|
|
1120 |
((alg_prefixfree::bool list list => bool)
|
|
1121 |
((op #::bool list => bool list list => bool list list) x
|
|
1122 |
z)))))"
|
|
1123 |
by (import prob_canon ALG_PREFIXFREE_MONO)
|
|
1124 |
|
|
1125 |
lemma ALG_PREFIXFREE_ELT: "(All::(bool list => bool) => bool)
|
|
1126 |
(%h::bool list.
|
|
1127 |
(All::(bool list list => bool) => bool)
|
|
1128 |
(%t::bool list list.
|
|
1129 |
(op -->::bool => bool => bool)
|
|
1130 |
((op &::bool => bool => bool)
|
|
1131 |
((alg_sorted::bool list list => bool)
|
|
1132 |
((op #::bool list => bool list list => bool list list) h t))
|
|
1133 |
((alg_prefixfree::bool list list => bool)
|
|
1134 |
((op #::bool list => bool list list => bool list list) h t)))
|
|
1135 |
((All::(bool list => bool) => bool)
|
|
1136 |
(%x::bool list.
|
|
1137 |
(op -->::bool => bool => bool)
|
|
1138 |
((op mem::bool list => bool list list => bool) x t)
|
|
1139 |
((op &::bool => bool => bool)
|
|
1140 |
((Not::bool => bool)
|
|
1141 |
((IS_PREFIX::bool list => bool list => bool) x h))
|
|
1142 |
((Not::bool => bool)
|
|
1143 |
((IS_PREFIX::bool list => bool list => bool) h
|
|
1144 |
x)))))))"
|
|
1145 |
by (import prob_canon ALG_PREFIXFREE_ELT)
|
|
1146 |
|
|
1147 |
lemma ALG_PREFIXFREE_TLS: "ALL l b. alg_prefixfree (map (op # b) l) = alg_prefixfree l"
|
|
1148 |
by (import prob_canon ALG_PREFIXFREE_TLS)
|
|
1149 |
|
|
1150 |
lemma ALG_PREFIXFREE_STEP: "ALL l1 l2.
|
|
1151 |
alg_prefixfree (map (op # True) l1 @ map (op # False) l2) =
|
|
1152 |
(alg_prefixfree l1 & alg_prefixfree l2)"
|
|
1153 |
by (import prob_canon ALG_PREFIXFREE_STEP)
|
|
1154 |
|
|
1155 |
lemma ALG_PREFIXFREE_APPEND: "ALL h h' t t'.
|
|
1156 |
alg_prefixfree ((h # t) @ h' # t') =
|
|
1157 |
(alg_prefixfree (h # t) &
|
|
1158 |
alg_prefixfree (h' # t') & ~ IS_PREFIX h' (last (h # t)))"
|
|
1159 |
by (import prob_canon ALG_PREFIXFREE_APPEND)
|
|
1160 |
|
|
1161 |
lemma ALG_PREFIXFREE_FILTER: "(All::((bool list => bool) => bool) => bool)
|
|
1162 |
(%P::bool list => bool.
|
|
1163 |
(All::(bool list list => bool) => bool)
|
|
1164 |
(%b::bool list list.
|
|
1165 |
(op -->::bool => bool => bool)
|
|
1166 |
((op &::bool => bool => bool)
|
|
1167 |
((alg_sorted::bool list list => bool) b)
|
|
1168 |
((alg_prefixfree::bool list list => bool) b))
|
|
1169 |
((alg_prefixfree::bool list list => bool)
|
|
1170 |
((filter::(bool list => bool)
|
|
1171 |
=> bool list list => bool list list)
|
|
1172 |
P b))))"
|
|
1173 |
by (import prob_canon ALG_PREFIXFREE_FILTER)
|
|
1174 |
|
|
1175 |
lemma ALG_TWINFREE_TL: "(All::(bool list => bool) => bool)
|
|
1176 |
(%h::bool list.
|
|
1177 |
(All::(bool list list => bool) => bool)
|
|
1178 |
(%t::bool list list.
|
|
1179 |
(op -->::bool => bool => bool)
|
|
1180 |
((alg_twinfree::bool list list => bool)
|
|
1181 |
((op #::bool list => bool list list => bool list list) h t))
|
|
1182 |
((alg_twinfree::bool list list => bool) t)))"
|
|
1183 |
by (import prob_canon ALG_TWINFREE_TL)
|
|
1184 |
|
|
1185 |
lemma ALG_TWINFREE_TLS: "ALL l b. alg_twinfree (map (op # b) l) = alg_twinfree l"
|
|
1186 |
by (import prob_canon ALG_TWINFREE_TLS)
|
|
1187 |
|
|
1188 |
lemma ALG_TWINFREE_STEP1: "(All::(bool list list => bool) => bool)
|
|
1189 |
(%l1::bool list list.
|
|
1190 |
(All::(bool list list => bool) => bool)
|
|
1191 |
(%l2::bool list list.
|
|
1192 |
(op -->::bool => bool => bool)
|
|
1193 |
((alg_twinfree::bool list list => bool)
|
|
1194 |
((op @::bool list list => bool list list => bool list list)
|
|
1195 |
((map::(bool list => bool list)
|
|
1196 |
=> bool list list => bool list list)
|
|
1197 |
((op #::bool => bool list => bool list) (True::bool)) l1)
|
|
1198 |
((map::(bool list => bool list)
|
|
1199 |
=> bool list list => bool list list)
|
|
1200 |
((op #::bool => bool list => bool list) (False::bool))
|
|
1201 |
l2)))
|
|
1202 |
((op &::bool => bool => bool)
|
|
1203 |
((alg_twinfree::bool list list => bool) l1)
|
|
1204 |
((alg_twinfree::bool list list => bool) l2))))"
|
|
1205 |
by (import prob_canon ALG_TWINFREE_STEP1)
|
|
1206 |
|
|
1207 |
lemma ALG_TWINFREE_STEP2: "(All::(bool list list => bool) => bool)
|
|
1208 |
(%l1::bool list list.
|
|
1209 |
(All::(bool list list => bool) => bool)
|
|
1210 |
(%l2::bool list list.
|
|
1211 |
(op -->::bool => bool => bool)
|
|
1212 |
((op &::bool => bool => bool)
|
|
1213 |
((op |::bool => bool => bool)
|
|
1214 |
((Not::bool => bool)
|
|
1215 |
((op mem::bool list => bool list list => bool)
|
|
1216 |
([]::bool list) l1))
|
|
1217 |
((Not::bool => bool)
|
|
1218 |
((op mem::bool list => bool list list => bool)
|
|
1219 |
([]::bool list) l2)))
|
|
1220 |
((op &::bool => bool => bool)
|
|
1221 |
((alg_twinfree::bool list list => bool) l1)
|
|
1222 |
((alg_twinfree::bool list list => bool) l2)))
|
|
1223 |
((alg_twinfree::bool list list => bool)
|
|
1224 |
((op @::bool list list => bool list list => bool list list)
|
|
1225 |
((map::(bool list => bool list)
|
|
1226 |
=> bool list list => bool list list)
|
|
1227 |
((op #::bool => bool list => bool list) (True::bool)) l1)
|
|
1228 |
((map::(bool list => bool list)
|
|
1229 |
=> bool list list => bool list list)
|
|
1230 |
((op #::bool => bool list => bool list) (False::bool))
|
|
1231 |
l2)))))"
|
|
1232 |
by (import prob_canon ALG_TWINFREE_STEP2)
|
|
1233 |
|
|
1234 |
lemma ALG_TWINFREE_STEP: "(All::(bool list list => bool) => bool)
|
|
1235 |
(%l1::bool list list.
|
|
1236 |
(All::(bool list list => bool) => bool)
|
|
1237 |
(%l2::bool list list.
|
|
1238 |
(op -->::bool => bool => bool)
|
|
1239 |
((op |::bool => bool => bool)
|
|
1240 |
((Not::bool => bool)
|
|
1241 |
((op mem::bool list => bool list list => bool)
|
|
1242 |
([]::bool list) l1))
|
|
1243 |
((Not::bool => bool)
|
|
1244 |
((op mem::bool list => bool list list => bool)
|
|
1245 |
([]::bool list) l2)))
|
|
1246 |
((op =::bool => bool => bool)
|
|
1247 |
((alg_twinfree::bool list list => bool)
|
|
1248 |
((op @::bool list list => bool list list => bool list list)
|
|
1249 |
((map::(bool list => bool list)
|
|
1250 |
=> bool list list => bool list list)
|
|
1251 |
((op #::bool => bool list => bool list) (True::bool)) l1)
|
|
1252 |
((map::(bool list => bool list)
|
|
1253 |
=> bool list list => bool list list)
|
|
1254 |
((op #::bool => bool list => bool list) (False::bool))
|
|
1255 |
l2)))
|
|
1256 |
((op &::bool => bool => bool)
|
|
1257 |
((alg_twinfree::bool list list => bool) l1)
|
|
1258 |
((alg_twinfree::bool list list => bool) l2)))))"
|
|
1259 |
by (import prob_canon ALG_TWINFREE_STEP)
|
|
1260 |
|
|
1261 |
lemma ALG_LONGEST_HD: "ALL h t. length h <= alg_longest (h # t)"
|
|
1262 |
by (import prob_canon ALG_LONGEST_HD)
|
|
1263 |
|
|
1264 |
lemma ALG_LONGEST_TL: "ALL h t. alg_longest t <= alg_longest (h # t)"
|
|
1265 |
by (import prob_canon ALG_LONGEST_TL)
|
|
1266 |
|
|
1267 |
lemma ALG_LONGEST_TLS: "ALL h t b. alg_longest (map (op # b) (h # t)) = Suc (alg_longest (h # t))"
|
|
1268 |
by (import prob_canon ALG_LONGEST_TLS)
|
|
1269 |
|
|
1270 |
lemma ALG_LONGEST_APPEND: "ALL l1 l2.
|
|
1271 |
alg_longest l1 <= alg_longest (l1 @ l2) &
|
|
1272 |
alg_longest l2 <= alg_longest (l1 @ l2)"
|
|
1273 |
by (import prob_canon ALG_LONGEST_APPEND)
|
|
1274 |
|
|
1275 |
lemma ALG_CANON_PREFS_HD: "ALL l b. hd (alg_canon_prefs l b) = l"
|
|
1276 |
by (import prob_canon ALG_CANON_PREFS_HD)
|
|
1277 |
|
|
1278 |
lemma ALG_CANON_PREFS_DELETES: "(All::(bool list => bool) => bool)
|
|
1279 |
(%l::bool list.
|
|
1280 |
(All::(bool list list => bool) => bool)
|
|
1281 |
(%b::bool list list.
|
|
1282 |
(All::(bool list => bool) => bool)
|
|
1283 |
(%x::bool list.
|
|
1284 |
(op -->::bool => bool => bool)
|
|
1285 |
((op mem::bool list => bool list list => bool) x
|
|
1286 |
((alg_canon_prefs::bool list
|
|
1287 |
=> bool list list => bool list list)
|
|
1288 |
l b))
|
|
1289 |
((op mem::bool list => bool list list => bool) x
|
|
1290 |
((op #::bool list => bool list list => bool list list) l
|
|
1291 |
b)))))"
|
|
1292 |
by (import prob_canon ALG_CANON_PREFS_DELETES)
|
|
1293 |
|
|
1294 |
lemma ALG_CANON_PREFS_SORTED: "(All::(bool list => bool) => bool)
|
|
1295 |
(%l::bool list.
|
|
1296 |
(All::(bool list list => bool) => bool)
|
|
1297 |
(%b::bool list list.
|
|
1298 |
(op -->::bool => bool => bool)
|
|
1299 |
((alg_sorted::bool list list => bool)
|
|
1300 |
((op #::bool list => bool list list => bool list list) l b))
|
|
1301 |
((alg_sorted::bool list list => bool)
|
|
1302 |
((alg_canon_prefs::bool list
|
|
1303 |
=> bool list list => bool list list)
|
|
1304 |
l b))))"
|
|
1305 |
by (import prob_canon ALG_CANON_PREFS_SORTED)
|
|
1306 |
|
|
1307 |
lemma ALG_CANON_PREFS_PREFIXFREE: "(All::(bool list => bool) => bool)
|
|
1308 |
(%l::bool list.
|
|
1309 |
(All::(bool list list => bool) => bool)
|
|
1310 |
(%b::bool list list.
|
|
1311 |
(op -->::bool => bool => bool)
|
|
1312 |
((op &::bool => bool => bool)
|
|
1313 |
((alg_sorted::bool list list => bool) b)
|
|
1314 |
((alg_prefixfree::bool list list => bool) b))
|
|
1315 |
((alg_prefixfree::bool list list => bool)
|
|
1316 |
((alg_canon_prefs::bool list
|
|
1317 |
=> bool list list => bool list list)
|
|
1318 |
l b))))"
|
|
1319 |
by (import prob_canon ALG_CANON_PREFS_PREFIXFREE)
|
|
1320 |
|
|
1321 |
lemma ALG_CANON_PREFS_CONSTANT: "(All::(bool list => bool) => bool)
|
|
1322 |
(%l::bool list.
|
|
1323 |
(All::(bool list list => bool) => bool)
|
|
1324 |
(%b::bool list list.
|
|
1325 |
(op -->::bool => bool => bool)
|
|
1326 |
((alg_prefixfree::bool list list => bool)
|
|
1327 |
((op #::bool list => bool list list => bool list list) l b))
|
|
1328 |
((op =::bool list list => bool list list => bool)
|
|
1329 |
((alg_canon_prefs::bool list
|
|
1330 |
=> bool list list => bool list list)
|
|
1331 |
l b)
|
|
1332 |
((op #::bool list => bool list list => bool list list) l b))))"
|
|
1333 |
by (import prob_canon ALG_CANON_PREFS_CONSTANT)
|
|
1334 |
|
|
1335 |
lemma ALG_CANON_FIND_HD: "ALL l h t.
|
|
1336 |
hd (alg_canon_find l (h # t)) = l | hd (alg_canon_find l (h # t)) = h"
|
|
1337 |
by (import prob_canon ALG_CANON_FIND_HD)
|
|
1338 |
|
|
1339 |
lemma ALG_CANON_FIND_DELETES: "(All::(bool list => bool) => bool)
|
|
1340 |
(%l::bool list.
|
|
1341 |
(All::(bool list list => bool) => bool)
|
|
1342 |
(%b::bool list list.
|
|
1343 |
(All::(bool list => bool) => bool)
|
|
1344 |
(%x::bool list.
|
|
1345 |
(op -->::bool => bool => bool)
|
|
1346 |
((op mem::bool list => bool list list => bool) x
|
|
1347 |
((alg_canon_find::bool list
|
|
1348 |
=> bool list list => bool list list)
|
|
1349 |
l b))
|
|
1350 |
((op mem::bool list => bool list list => bool) x
|
|
1351 |
((op #::bool list => bool list list => bool list list) l
|
|
1352 |
b)))))"
|
|
1353 |
by (import prob_canon ALG_CANON_FIND_DELETES)
|
|
1354 |
|
|
1355 |
lemma ALG_CANON_FIND_SORTED: "(All::(bool list => bool) => bool)
|
|
1356 |
(%l::bool list.
|
|
1357 |
(All::(bool list list => bool) => bool)
|
|
1358 |
(%b::bool list list.
|
|
1359 |
(op -->::bool => bool => bool)
|
|
1360 |
((alg_sorted::bool list list => bool) b)
|
|
1361 |
((alg_sorted::bool list list => bool)
|
|
1362 |
((alg_canon_find::bool list
|
|
1363 |
=> bool list list => bool list list)
|
|
1364 |
l b))))"
|
|
1365 |
by (import prob_canon ALG_CANON_FIND_SORTED)
|
|
1366 |
|
|
1367 |
lemma ALG_CANON_FIND_PREFIXFREE: "(All::(bool list => bool) => bool)
|
|
1368 |
(%l::bool list.
|
|
1369 |
(All::(bool list list => bool) => bool)
|
|
1370 |
(%b::bool list list.
|
|
1371 |
(op -->::bool => bool => bool)
|
|
1372 |
((op &::bool => bool => bool)
|
|
1373 |
((alg_sorted::bool list list => bool) b)
|
|
1374 |
((alg_prefixfree::bool list list => bool) b))
|
|
1375 |
((alg_prefixfree::bool list list => bool)
|
|
1376 |
((alg_canon_find::bool list
|
|
1377 |
=> bool list list => bool list list)
|
|
1378 |
l b))))"
|
|
1379 |
by (import prob_canon ALG_CANON_FIND_PREFIXFREE)
|
|
1380 |
|
|
1381 |
lemma ALG_CANON_FIND_CONSTANT: "(All::(bool list => bool) => bool)
|
|
1382 |
(%l::bool list.
|
|
1383 |
(All::(bool list list => bool) => bool)
|
|
1384 |
(%b::bool list list.
|
|
1385 |
(op -->::bool => bool => bool)
|
|
1386 |
((op &::bool => bool => bool)
|
|
1387 |
((alg_sorted::bool list list => bool)
|
|
1388 |
((op #::bool list => bool list list => bool list list) l b))
|
|
1389 |
((alg_prefixfree::bool list list => bool)
|
|
1390 |
((op #::bool list => bool list list => bool list list) l b)))
|
|
1391 |
((op =::bool list list => bool list list => bool)
|
|
1392 |
((alg_canon_find::bool list
|
|
1393 |
=> bool list list => bool list list)
|
|
1394 |
l b)
|
|
1395 |
((op #::bool list => bool list list => bool list list) l b))))"
|
|
1396 |
by (import prob_canon ALG_CANON_FIND_CONSTANT)
|
|
1397 |
|
|
1398 |
lemma ALG_CANON1_SORTED: "ALL x. alg_sorted (alg_canon1 x)"
|
|
1399 |
by (import prob_canon ALG_CANON1_SORTED)
|
|
1400 |
|
|
1401 |
lemma ALG_CANON1_PREFIXFREE: "ALL l. alg_prefixfree (alg_canon1 l)"
|
|
1402 |
by (import prob_canon ALG_CANON1_PREFIXFREE)
|
|
1403 |
|
|
1404 |
lemma ALG_CANON1_CONSTANT: "(All::(bool list list => bool) => bool)
|
|
1405 |
(%l::bool list list.
|
|
1406 |
(op -->::bool => bool => bool)
|
|
1407 |
((op &::bool => bool => bool) ((alg_sorted::bool list list => bool) l)
|
|
1408 |
((alg_prefixfree::bool list list => bool) l))
|
|
1409 |
((op =::bool list list => bool list list => bool)
|
|
1410 |
((alg_canon1::bool list list => bool list list) l) l))"
|
|
1411 |
by (import prob_canon ALG_CANON1_CONSTANT)
|
|
1412 |
|
|
1413 |
lemma ALG_CANON_MERGE_SORTED_PREFIXFREE_TWINFREE: "(All::(bool list => bool) => bool)
|
|
1414 |
(%l::bool list.
|
|
1415 |
(All::(bool list list => bool) => bool)
|
|
1416 |
(%b::bool list list.
|
|
1417 |
(op -->::bool => bool => bool)
|
|
1418 |
((op &::bool => bool => bool)
|
|
1419 |
((alg_sorted::bool list list => bool)
|
|
1420 |
((op #::bool list => bool list list => bool list list) l b))
|
|
1421 |
((op &::bool => bool => bool)
|
|
1422 |
((alg_prefixfree::bool list list => bool)
|
|
1423 |
((op #::bool list => bool list list => bool list list) l
|
|
1424 |
b))
|
|
1425 |
((alg_twinfree::bool list list => bool) b)))
|
|
1426 |
((op &::bool => bool => bool)
|
|
1427 |
((alg_sorted::bool list list => bool)
|
|
1428 |
((alg_canon_merge::bool list
|
|
1429 |
=> bool list list => bool list list)
|
|
1430 |
l b))
|
|
1431 |
((op &::bool => bool => bool)
|
|
1432 |
((alg_prefixfree::bool list list => bool)
|
|
1433 |
((alg_canon_merge::bool list
|
|
1434 |
=> bool list list => bool list list)
|
|
1435 |
l b))
|
|
1436 |
((alg_twinfree::bool list list => bool)
|
|
1437 |
((alg_canon_merge::bool list
|
|
1438 |
=> bool list list => bool list list)
|
|
1439 |
l b))))))"
|
|
1440 |
by (import prob_canon ALG_CANON_MERGE_SORTED_PREFIXFREE_TWINFREE)
|
|
1441 |
|
|
1442 |
lemma ALG_CANON_MERGE_PREFIXFREE_PRESERVE: "(All::(bool list => bool) => bool)
|
|
1443 |
(%l::bool list.
|
|
1444 |
(All::(bool list list => bool) => bool)
|
|
1445 |
(%b::bool list list.
|
|
1446 |
(All::(bool list => bool) => bool)
|
|
1447 |
(%h::bool list.
|
|
1448 |
(op -->::bool => bool => bool)
|
|
1449 |
((All::(bool list => bool) => bool)
|
|
1450 |
(%x::bool list.
|
|
1451 |
(op -->::bool => bool => bool)
|
|
1452 |
((op mem::bool list => bool list list => bool) x
|
|
1453 |
((op #::bool list
|
|
1454 |
=> bool list list => bool list list)
|
|
1455 |
l b))
|
|
1456 |
((op &::bool => bool => bool)
|
|
1457 |
((Not::bool => bool)
|
|
1458 |
((IS_PREFIX::bool list => bool list => bool) h
|
|
1459 |
x))
|
|
1460 |
((Not::bool => bool)
|
|
1461 |
((IS_PREFIX::bool list => bool list => bool) x
|
|
1462 |
h)))))
|
|
1463 |
((All::(bool list => bool) => bool)
|
|
1464 |
(%x::bool list.
|
|
1465 |
(op -->::bool => bool => bool)
|
|
1466 |
((op mem::bool list => bool list list => bool) x
|
|
1467 |
((alg_canon_merge::bool list
|
|
1468 |
=> bool list list => bool list list)
|
|
1469 |
l b))
|
|
1470 |
((op &::bool => bool => bool)
|
|
1471 |
((Not::bool => bool)
|
|
1472 |
((IS_PREFIX::bool list => bool list => bool) h
|
|
1473 |
x))
|
|
1474 |
((Not::bool => bool)
|
|
1475 |
((IS_PREFIX::bool list => bool list => bool) x
|
|
1476 |
h))))))))"
|
|
1477 |
by (import prob_canon ALG_CANON_MERGE_PREFIXFREE_PRESERVE)
|
|
1478 |
|
|
1479 |
lemma ALG_CANON_MERGE_SHORTENS: "(All::(bool list => bool) => bool)
|
|
1480 |
(%l::bool list.
|
|
1481 |
(All::(bool list list => bool) => bool)
|
|
1482 |
(%b::bool list list.
|
|
1483 |
(All::(bool list => bool) => bool)
|
|
1484 |
(%x::bool list.
|
|
1485 |
(op -->::bool => bool => bool)
|
|
1486 |
((op mem::bool list => bool list list => bool) x
|
|
1487 |
((alg_canon_merge::bool list
|
|
1488 |
=> bool list list => bool list list)
|
|
1489 |
l b))
|
|
1490 |
((Ex::(bool list => bool) => bool)
|
|
1491 |
(%y::bool list.
|
|
1492 |
(op &::bool => bool => bool)
|
|
1493 |
((op mem::bool list => bool list list => bool) y
|
|
1494 |
((op #::bool list
|
|
1495 |
=> bool list list => bool list list)
|
|
1496 |
l b))
|
|
1497 |
((IS_PREFIX::bool list => bool list => bool) y
|
|
1498 |
x))))))"
|
|
1499 |
by (import prob_canon ALG_CANON_MERGE_SHORTENS)
|
|
1500 |
|
|
1501 |
lemma ALG_CANON_MERGE_CONSTANT: "(All::(bool list => bool) => bool)
|
|
1502 |
(%l::bool list.
|
|
1503 |
(All::(bool list list => bool) => bool)
|
|
1504 |
(%b::bool list list.
|
|
1505 |
(op -->::bool => bool => bool)
|
|
1506 |
((alg_twinfree::bool list list => bool)
|
|
1507 |
((op #::bool list => bool list list => bool list list) l b))
|
|
1508 |
((op =::bool list list => bool list list => bool)
|
|
1509 |
((alg_canon_merge::bool list
|
|
1510 |
=> bool list list => bool list list)
|
|
1511 |
l b)
|
|
1512 |
((op #::bool list => bool list list => bool list list) l b))))"
|
|
1513 |
by (import prob_canon ALG_CANON_MERGE_CONSTANT)
|
|
1514 |
|
|
1515 |
lemma ALG_CANON2_PREFIXFREE_PRESERVE: "(All::(bool list list => bool) => bool)
|
|
1516 |
(%x::bool list list.
|
|
1517 |
(All::(bool list => bool) => bool)
|
|
1518 |
(%xa::bool list.
|
|
1519 |
(op -->::bool => bool => bool)
|
|
1520 |
((All::(bool list => bool) => bool)
|
|
1521 |
(%xb::bool list.
|
|
1522 |
(op -->::bool => bool => bool)
|
|
1523 |
((op mem::bool list => bool list list => bool) xb x)
|
|
1524 |
((op &::bool => bool => bool)
|
|
1525 |
((Not::bool => bool)
|
|
1526 |
((IS_PREFIX::bool list => bool list => bool) xa xb))
|
|
1527 |
((Not::bool => bool)
|
|
1528 |
((IS_PREFIX::bool list => bool list => bool) xb
|
|
1529 |
xa)))))
|
|
1530 |
((All::(bool list => bool) => bool)
|
|
1531 |
(%xb::bool list.
|
|
1532 |
(op -->::bool => bool => bool)
|
|
1533 |
((op mem::bool list => bool list list => bool) xb
|
|
1534 |
((alg_canon2::bool list list => bool list list) x))
|
|
1535 |
((op &::bool => bool => bool)
|
|
1536 |
((Not::bool => bool)
|
|
1537 |
((IS_PREFIX::bool list => bool list => bool) xa xb))
|
|
1538 |
((Not::bool => bool)
|
|
1539 |
((IS_PREFIX::bool list => bool list => bool) xb
|
|
1540 |
xa)))))))"
|
|
1541 |
by (import prob_canon ALG_CANON2_PREFIXFREE_PRESERVE)
|
|
1542 |
|
|
1543 |
lemma ALG_CANON2_SHORTENS: "(All::(bool list list => bool) => bool)
|
|
1544 |
(%x::bool list list.
|
|
1545 |
(All::(bool list => bool) => bool)
|
|
1546 |
(%xa::bool list.
|
|
1547 |
(op -->::bool => bool => bool)
|
|
1548 |
((op mem::bool list => bool list list => bool) xa
|
|
1549 |
((alg_canon2::bool list list => bool list list) x))
|
|
1550 |
((Ex::(bool list => bool) => bool)
|
|
1551 |
(%y::bool list.
|
|
1552 |
(op &::bool => bool => bool)
|
|
1553 |
((op mem::bool list => bool list list => bool) y x)
|
|
1554 |
((IS_PREFIX::bool list => bool list => bool) y xa)))))"
|
|
1555 |
by (import prob_canon ALG_CANON2_SHORTENS)
|
|
1556 |
|
|
1557 |
lemma ALG_CANON2_SORTED_PREFIXFREE_TWINFREE: "(All::(bool list list => bool) => bool)
|
|
1558 |
(%x::bool list list.
|
|
1559 |
(op -->::bool => bool => bool)
|
|
1560 |
((op &::bool => bool => bool) ((alg_sorted::bool list list => bool) x)
|
|
1561 |
((alg_prefixfree::bool list list => bool) x))
|
|
1562 |
((op &::bool => bool => bool)
|
|
1563 |
((alg_sorted::bool list list => bool)
|
|
1564 |
((alg_canon2::bool list list => bool list list) x))
|
|
1565 |
((op &::bool => bool => bool)
|
|
1566 |
((alg_prefixfree::bool list list => bool)
|
|
1567 |
((alg_canon2::bool list list => bool list list) x))
|
|
1568 |
((alg_twinfree::bool list list => bool)
|
|
1569 |
((alg_canon2::bool list list => bool list list) x)))))"
|
|
1570 |
by (import prob_canon ALG_CANON2_SORTED_PREFIXFREE_TWINFREE)
|
|
1571 |
|
|
1572 |
lemma ALG_CANON2_CONSTANT: "(All::(bool list list => bool) => bool)
|
|
1573 |
(%l::bool list list.
|
|
1574 |
(op -->::bool => bool => bool)
|
|
1575 |
((alg_twinfree::bool list list => bool) l)
|
|
1576 |
((op =::bool list list => bool list list => bool)
|
|
1577 |
((alg_canon2::bool list list => bool list list) l) l))"
|
|
1578 |
by (import prob_canon ALG_CANON2_CONSTANT)
|
|
1579 |
|
|
1580 |
lemma ALG_CANON_SORTED_PREFIXFREE_TWINFREE: "ALL l.
|
|
1581 |
alg_sorted (alg_canon l) &
|
|
1582 |
alg_prefixfree (alg_canon l) & alg_twinfree (alg_canon l)"
|
|
1583 |
by (import prob_canon ALG_CANON_SORTED_PREFIXFREE_TWINFREE)
|
|
1584 |
|
|
1585 |
lemma ALG_CANON_CONSTANT: "(All::(bool list list => bool) => bool)
|
|
1586 |
(%l::bool list list.
|
|
1587 |
(op -->::bool => bool => bool)
|
|
1588 |
((op &::bool => bool => bool) ((alg_sorted::bool list list => bool) l)
|
|
1589 |
((op &::bool => bool => bool)
|
|
1590 |
((alg_prefixfree::bool list list => bool) l)
|
|
1591 |
((alg_twinfree::bool list list => bool) l)))
|
|
1592 |
((op =::bool list list => bool list list => bool)
|
|
1593 |
((alg_canon::bool list list => bool list list) l) l))"
|
|
1594 |
by (import prob_canon ALG_CANON_CONSTANT)
|
|
1595 |
|
|
1596 |
lemma ALG_CANON_IDEMPOT: "ALL l. alg_canon (alg_canon l) = alg_canon l"
|
|
1597 |
by (import prob_canon ALG_CANON_IDEMPOT)
|
|
1598 |
|
|
1599 |
lemma ALGEBRA_CANON_DEF_ALT: "ALL l. algebra_canon l = (alg_sorted l & alg_prefixfree l & alg_twinfree l)"
|
|
1600 |
by (import prob_canon ALGEBRA_CANON_DEF_ALT)
|
|
1601 |
|
|
1602 |
lemma ALGEBRA_CANON_BASIC: "algebra_canon [] & algebra_canon [[]] & (ALL x. algebra_canon [x])"
|
|
1603 |
by (import prob_canon ALGEBRA_CANON_BASIC)
|
|
1604 |
|
|
1605 |
lemma ALG_CANON_BASIC: "alg_canon [] = [] & alg_canon [[]] = [[]] & (ALL x. alg_canon [x] = [x])"
|
|
1606 |
by (import prob_canon ALG_CANON_BASIC)
|
|
1607 |
|
|
1608 |
lemma ALGEBRA_CANON_TL: "(All::(bool list => bool) => bool)
|
|
1609 |
(%h::bool list.
|
|
1610 |
(All::(bool list list => bool) => bool)
|
|
1611 |
(%t::bool list list.
|
|
1612 |
(op -->::bool => bool => bool)
|
|
1613 |
((algebra_canon::bool list list => bool)
|
|
1614 |
((op #::bool list => bool list list => bool list list) h t))
|
|
1615 |
((algebra_canon::bool list list => bool) t)))"
|
|
1616 |
by (import prob_canon ALGEBRA_CANON_TL)
|
|
1617 |
|
|
1618 |
lemma ALGEBRA_CANON_NIL_MEM: "ALL l. (algebra_canon l & [] mem l) = (l = [[]])"
|
|
1619 |
by (import prob_canon ALGEBRA_CANON_NIL_MEM)
|
|
1620 |
|
|
1621 |
lemma ALGEBRA_CANON_TLS: "ALL l b. algebra_canon (map (op # b) l) = algebra_canon l"
|
|
1622 |
by (import prob_canon ALGEBRA_CANON_TLS)
|
|
1623 |
|
|
1624 |
lemma ALGEBRA_CANON_STEP1: "(All::(bool list list => bool) => bool)
|
|
1625 |
(%l1::bool list list.
|
|
1626 |
(All::(bool list list => bool) => bool)
|
|
1627 |
(%l2::bool list list.
|
|
1628 |
(op -->::bool => bool => bool)
|
|
1629 |
((algebra_canon::bool list list => bool)
|
|
1630 |
((op @::bool list list => bool list list => bool list list)
|
|
1631 |
((map::(bool list => bool list)
|
|
1632 |
=> bool list list => bool list list)
|
|
1633 |
((op #::bool => bool list => bool list) (True::bool)) l1)
|
|
1634 |
((map::(bool list => bool list)
|
|
1635 |
=> bool list list => bool list list)
|
|
1636 |
((op #::bool => bool list => bool list) (False::bool))
|
|
1637 |
l2)))
|
|
1638 |
((op &::bool => bool => bool)
|
|
1639 |
((algebra_canon::bool list list => bool) l1)
|
|
1640 |
((algebra_canon::bool list list => bool) l2))))"
|
|
1641 |
by (import prob_canon ALGEBRA_CANON_STEP1)
|
|
1642 |
|
|
1643 |
lemma ALGEBRA_CANON_STEP2: "(All::(bool list list => bool) => bool)
|
|
1644 |
(%l1::bool list list.
|
|
1645 |
(All::(bool list list => bool) => bool)
|
|
1646 |
(%l2::bool list list.
|
|
1647 |
(op -->::bool => bool => bool)
|
|
1648 |
((op &::bool => bool => bool)
|
|
1649 |
((op |::bool => bool => bool)
|
|
1650 |
((Not::bool => bool)
|
|
1651 |
((op =::bool list list => bool list list => bool) l1
|
|
1652 |
((op #::bool list => bool list list => bool list list)
|
|
1653 |
([]::bool list) ([]::bool list list))))
|
|
1654 |
((Not::bool => bool)
|
|
1655 |
((op =::bool list list => bool list list => bool) l2
|
|
1656 |
((op #::bool list => bool list list => bool list list)
|
|
1657 |
([]::bool list) ([]::bool list list)))))
|
|
1658 |
((op &::bool => bool => bool)
|
|
1659 |
((algebra_canon::bool list list => bool) l1)
|
|
1660 |
((algebra_canon::bool list list => bool) l2)))
|
|
1661 |
((algebra_canon::bool list list => bool)
|
|
1662 |
((op @::bool list list => bool list list => bool list list)
|
|
1663 |
((map::(bool list => bool list)
|
|
1664 |
=> bool list list => bool list list)
|
|
1665 |
((op #::bool => bool list => bool list) (True::bool)) l1)
|
|
1666 |
((map::(bool list => bool list)
|
|
1667 |
=> bool list list => bool list list)
|
|
1668 |
((op #::bool => bool list => bool list) (False::bool))
|
|
1669 |
l2)))))"
|
|
1670 |
by (import prob_canon ALGEBRA_CANON_STEP2)
|
|
1671 |
|
|
1672 |
lemma ALGEBRA_CANON_STEP: "(All::(bool list list => bool) => bool)
|
|
1673 |
(%l1::bool list list.
|
|
1674 |
(All::(bool list list => bool) => bool)
|
|
1675 |
(%l2::bool list list.
|
|
1676 |
(op -->::bool => bool => bool)
|
|
1677 |
((op |::bool => bool => bool)
|
|
1678 |
((Not::bool => bool)
|
|
1679 |
((op =::bool list list => bool list list => bool) l1
|
|
1680 |
((op #::bool list => bool list list => bool list list)
|
|
1681 |
([]::bool list) ([]::bool list list))))
|
|
1682 |
((Not::bool => bool)
|
|
1683 |
((op =::bool list list => bool list list => bool) l2
|
|
1684 |
((op #::bool list => bool list list => bool list list)
|
|
1685 |
([]::bool list) ([]::bool list list)))))
|
|
1686 |
((op =::bool => bool => bool)
|
|
1687 |
((algebra_canon::bool list list => bool)
|
|
1688 |
((op @::bool list list => bool list list => bool list list)
|
|
1689 |
((map::(bool list => bool list)
|
|
1690 |
=> bool list list => bool list list)
|
|
1691 |
((op #::bool => bool list => bool list) (True::bool)) l1)
|
|
1692 |
((map::(bool list => bool list)
|
|
1693 |
=> bool list list => bool list list)
|
|
1694 |
((op #::bool => bool list => bool list) (False::bool))
|
|
1695 |
l2)))
|
|
1696 |
((op &::bool => bool => bool)
|
|
1697 |
((algebra_canon::bool list list => bool) l1)
|
|
1698 |
((algebra_canon::bool list list => bool) l2)))))"
|
|
1699 |
by (import prob_canon ALGEBRA_CANON_STEP)
|
|
1700 |
|
|
1701 |
lemma ALGEBRA_CANON_CASES_THM: "(All::(bool list list => bool) => bool)
|
|
1702 |
(%l::bool list list.
|
|
1703 |
(op -->::bool => bool => bool)
|
|
1704 |
((algebra_canon::bool list list => bool) l)
|
|
1705 |
((op |::bool => bool => bool)
|
|
1706 |
((op =::bool list list => bool list list => bool) l
|
|
1707 |
([]::bool list list))
|
|
1708 |
((op |::bool => bool => bool)
|
|
1709 |
((op =::bool list list => bool list list => bool) l
|
|
1710 |
((op #::bool list => bool list list => bool list list)
|
|
1711 |
([]::bool list) ([]::bool list list)))
|
|
1712 |
((Ex::(bool list list => bool) => bool)
|
|
1713 |
(%l1::bool list list.
|
|
1714 |
(Ex::(bool list list => bool) => bool)
|
|
1715 |
(%l2::bool list list.
|
|
1716 |
(op &::bool => bool => bool)
|
|
1717 |
((algebra_canon::bool list list => bool) l1)
|
|
1718 |
((op &::bool => bool => bool)
|
|
1719 |
((algebra_canon::bool list list => bool) l2)
|
|
1720 |
((op =::bool list list => bool list list => bool) l
|
|
1721 |
((op @::bool list list
|
|
1722 |
=> bool list list => bool list list)
|
|
1723 |
((map::(bool list => bool list)
|
|
1724 |
=> bool list list => bool list list)
|
|
1725 |
((op #::bool => bool list => bool list)
|
|
1726 |
(True::bool))
|
|
1727 |
l1)
|
|
1728 |
((map::(bool list => bool list)
|
|
1729 |
=> bool list list => bool list list)
|
|
1730 |
((op #::bool => bool list => bool list)
|
|
1731 |
(False::bool))
|
|
1732 |
l2))))))))))"
|
|
1733 |
by (import prob_canon ALGEBRA_CANON_CASES_THM)
|
|
1734 |
|
|
1735 |
lemma ALGEBRA_CANON_CASES: "(All::((bool list list => bool) => bool) => bool)
|
|
1736 |
(%P::bool list list => bool.
|
|
1737 |
(op -->::bool => bool => bool)
|
|
1738 |
((op &::bool => bool => bool) (P ([]::bool list list))
|
|
1739 |
((op &::bool => bool => bool)
|
|
1740 |
(P ((op #::bool list => bool list list => bool list list)
|
|
1741 |
([]::bool list) ([]::bool list list)))
|
|
1742 |
((All::(bool list list => bool) => bool)
|
|
1743 |
(%l1::bool list list.
|
|
1744 |
(All::(bool list list => bool) => bool)
|
|
1745 |
(%l2::bool list list.
|
|
1746 |
(op -->::bool => bool => bool)
|
|
1747 |
((op &::bool => bool => bool)
|
|
1748 |
((algebra_canon::bool list list => bool) l1)
|
|
1749 |
((op &::bool => bool => bool)
|
|
1750 |
((algebra_canon::bool list list => bool) l2)
|
|
1751 |
((algebra_canon::bool list list => bool)
|
|
1752 |
((op @::bool list list
|
|
1753 |
=> bool list list => bool list list)
|
|
1754 |
((map::(bool list => bool list)
|
|
1755 |
=> bool list list => bool list list)
|
|
1756 |
((op #::bool => bool list => bool list)
|
|
1757 |
(True::bool))
|
|
1758 |
l1)
|
|
1759 |
((map::(bool list => bool list)
|
|
1760 |
=> bool list list => bool list list)
|
|
1761 |
((op #::bool => bool list => bool list)
|
|
1762 |
(False::bool))
|
|
1763 |
l2)))))
|
|
1764 |
(P ((op @::bool list list
|
|
1765 |
=> bool list list => bool list list)
|
|
1766 |
((map::(bool list => bool list)
|
|
1767 |
=> bool list list => bool list list)
|
|
1768 |
((op #::bool => bool list => bool list)
|
|
1769 |
(True::bool))
|
|
1770 |
l1)
|
|
1771 |
((map::(bool list => bool list)
|
|
1772 |
=> bool list list => bool list list)
|
|
1773 |
((op #::bool => bool list => bool list)
|
|
1774 |
(False::bool))
|
|
1775 |
l2))))))))
|
|
1776 |
((All::(bool list list => bool) => bool)
|
|
1777 |
(%l::bool list list.
|
|
1778 |
(op -->::bool => bool => bool)
|
|
1779 |
((algebra_canon::bool list list => bool) l) (P l))))"
|
|
1780 |
by (import prob_canon ALGEBRA_CANON_CASES)
|
|
1781 |
|
|
1782 |
lemma ALGEBRA_CANON_INDUCTION: "(All::((bool list list => bool) => bool) => bool)
|
|
1783 |
(%P::bool list list => bool.
|
|
1784 |
(op -->::bool => bool => bool)
|
|
1785 |
((op &::bool => bool => bool) (P ([]::bool list list))
|
|
1786 |
((op &::bool => bool => bool)
|
|
1787 |
(P ((op #::bool list => bool list list => bool list list)
|
|
1788 |
([]::bool list) ([]::bool list list)))
|
|
1789 |
((All::(bool list list => bool) => bool)
|
|
1790 |
(%l1::bool list list.
|
|
1791 |
(All::(bool list list => bool) => bool)
|
|
1792 |
(%l2::bool list list.
|
|
1793 |
(op -->::bool => bool => bool)
|
|
1794 |
((op &::bool => bool => bool)
|
|
1795 |
((algebra_canon::bool list list => bool) l1)
|
|
1796 |
((op &::bool => bool => bool)
|
|
1797 |
((algebra_canon::bool list list => bool) l2)
|
|
1798 |
((op &::bool => bool => bool) (P l1)
|
|
1799 |
((op &::bool => bool => bool) (P l2)
|
|
1800 |
((algebra_canon::bool list list => bool)
|
|
1801 |
((op @::bool list list
|
|
1802 |
=> bool list list => bool list list)
|
|
1803 |
((map::(bool list => bool list)
|
|
1804 |
=> bool list list => bool list list)
|
|
1805 |
((op #::bool => bool list => bool list)
|
|
1806 |
(True::bool))
|
|
1807 |
l1)
|
|
1808 |
((map::(bool list => bool list)
|
|
1809 |
=> bool list list => bool list list)
|
|
1810 |
((op #::bool => bool list => bool list)
|
|
1811 |
(False::bool))
|
|
1812 |
l2)))))))
|
|
1813 |
(P ((op @::bool list list
|
|
1814 |
=> bool list list => bool list list)
|
|
1815 |
((map::(bool list => bool list)
|
|
1816 |
=> bool list list => bool list list)
|
|
1817 |
((op #::bool => bool list => bool list)
|
|
1818 |
(True::bool))
|
|
1819 |
l1)
|
|
1820 |
((map::(bool list => bool list)
|
|
1821 |
=> bool list list => bool list list)
|
|
1822 |
((op #::bool => bool list => bool list)
|
|
1823 |
(False::bool))
|
|
1824 |
l2))))))))
|
|
1825 |
((All::(bool list list => bool) => bool)
|
|
1826 |
(%l::bool list list.
|
|
1827 |
(op -->::bool => bool => bool)
|
|
1828 |
((algebra_canon::bool list list => bool) l) (P l))))"
|
|
1829 |
by (import prob_canon ALGEBRA_CANON_INDUCTION)
|
|
1830 |
|
|
1831 |
lemma MEM_NIL_STEP: "ALL l1 l2. ~ [] mem map (op # True) l1 @ map (op # False) l2"
|
|
1832 |
by (import prob_canon MEM_NIL_STEP)
|
|
1833 |
|
|
1834 |
lemma ALG_SORTED_PREFIXFREE_MEM_NIL: "ALL l. (alg_sorted l & alg_prefixfree l & [] mem l) = (l = [[]])"
|
|
1835 |
by (import prob_canon ALG_SORTED_PREFIXFREE_MEM_NIL)
|
|
1836 |
|
|
1837 |
lemma ALG_SORTED_PREFIXFREE_EQUALITY: "(All::(bool list list => bool) => bool)
|
|
1838 |
(%l::bool list list.
|
|
1839 |
(All::(bool list list => bool) => bool)
|
|
1840 |
(%l'::bool list list.
|
|
1841 |
(op -->::bool => bool => bool)
|
|
1842 |
((op &::bool => bool => bool)
|
|
1843 |
((All::(bool list => bool) => bool)
|
|
1844 |
(%x::bool list.
|
|
1845 |
(op =::bool => bool => bool)
|
|
1846 |
((op mem::bool list => bool list list => bool) x l)
|
|
1847 |
((op mem::bool list => bool list list => bool) x l')))
|
|
1848 |
((op &::bool => bool => bool)
|
|
1849 |
((alg_sorted::bool list list => bool) l)
|
|
1850 |
((op &::bool => bool => bool)
|
|
1851 |
((alg_sorted::bool list list => bool) l')
|
|
1852 |
((op &::bool => bool => bool)
|
|
1853 |
((alg_prefixfree::bool list list => bool) l)
|
|
1854 |
((alg_prefixfree::bool list list => bool) l')))))
|
|
1855 |
((op =::bool list list => bool list list => bool) l l')))"
|
|
1856 |
by (import prob_canon ALG_SORTED_PREFIXFREE_EQUALITY)
|
|
1857 |
|
|
1858 |
;end_setup
|
|
1859 |
|
|
1860 |
;setup_theory boolean_sequence
|
|
1861 |
|
|
1862 |
consts
|
|
1863 |
SHD :: "(nat => bool) => bool"
|
|
1864 |
|
|
1865 |
defs
|
|
1866 |
SHD_primdef: "SHD == %f. f 0"
|
|
1867 |
|
|
1868 |
lemma SHD_def: "ALL f. SHD f = f 0"
|
|
1869 |
by (import boolean_sequence SHD_def)
|
|
1870 |
|
|
1871 |
consts
|
|
1872 |
STL :: "(nat => bool) => nat => bool"
|
|
1873 |
|
|
1874 |
defs
|
|
1875 |
STL_primdef: "STL == %f n. f (Suc n)"
|
|
1876 |
|
|
1877 |
lemma STL_def: "ALL f n. STL f n = f (Suc n)"
|
|
1878 |
by (import boolean_sequence STL_def)
|
|
1879 |
|
|
1880 |
consts
|
|
1881 |
SCONS :: "bool => (nat => bool) => nat => bool"
|
|
1882 |
|
|
1883 |
specification (SCONS_primdef: SCONS) SCONS_def: "(ALL h t. SCONS h t 0 = h) & (ALL h t n. SCONS h t (Suc n) = t n)"
|
|
1884 |
by (import boolean_sequence SCONS_def)
|
|
1885 |
|
|
1886 |
consts
|
|
1887 |
SDEST :: "(nat => bool) => bool * (nat => bool)"
|
|
1888 |
|
|
1889 |
defs
|
|
1890 |
SDEST_primdef: "SDEST == %s. (SHD s, STL s)"
|
|
1891 |
|
|
1892 |
lemma SDEST_def: "SDEST = (%s. (SHD s, STL s))"
|
|
1893 |
by (import boolean_sequence SDEST_def)
|
|
1894 |
|
|
1895 |
consts
|
|
1896 |
SCONST :: "bool => nat => bool"
|
|
1897 |
|
|
1898 |
defs
|
|
1899 |
SCONST_primdef: "SCONST == K"
|
|
1900 |
|
|
1901 |
lemma SCONST_def: "SCONST = K"
|
|
1902 |
by (import boolean_sequence SCONST_def)
|
|
1903 |
|
|
1904 |
consts
|
|
1905 |
STAKE :: "nat => (nat => bool) => bool list"
|
|
1906 |
|
|
1907 |
specification (STAKE_primdef: STAKE) STAKE_def: "(ALL s. STAKE 0 s = []) &
|
|
1908 |
(ALL n s. STAKE (Suc n) s = SHD s # STAKE n (STL s))"
|
|
1909 |
by (import boolean_sequence STAKE_def)
|
|
1910 |
|
|
1911 |
consts
|
|
1912 |
SDROP :: "nat => (nat => bool) => nat => bool"
|
|
1913 |
|
|
1914 |
specification (SDROP_primdef: SDROP) SDROP_def: "SDROP 0 = I & (ALL n. SDROP (Suc n) = SDROP n o STL)"
|
|
1915 |
by (import boolean_sequence SDROP_def)
|
|
1916 |
|
|
1917 |
lemma SCONS_SURJ: "ALL x. EX xa t. x = SCONS xa t"
|
|
1918 |
by (import boolean_sequence SCONS_SURJ)
|
|
1919 |
|
|
1920 |
lemma SHD_STL_ISO: "ALL h t. EX x. SHD x = h & STL x = t"
|
|
1921 |
by (import boolean_sequence SHD_STL_ISO)
|
|
1922 |
|
|
1923 |
lemma SHD_SCONS: "ALL h t. SHD (SCONS h t) = h"
|
|
1924 |
by (import boolean_sequence SHD_SCONS)
|
|
1925 |
|
|
1926 |
lemma STL_SCONS: "ALL h t. STL (SCONS h t) = t"
|
|
1927 |
by (import boolean_sequence STL_SCONS)
|
|
1928 |
|
|
1929 |
lemma SHD_SCONST: "ALL b. SHD (SCONST b) = b"
|
|
1930 |
by (import boolean_sequence SHD_SCONST)
|
|
1931 |
|
|
1932 |
lemma STL_SCONST: "ALL b. STL (SCONST b) = SCONST b"
|
|
1933 |
by (import boolean_sequence STL_SCONST)
|
|
1934 |
|
|
1935 |
;end_setup
|
|
1936 |
|
|
1937 |
;setup_theory prob_algebra
|
|
1938 |
|
|
1939 |
consts
|
|
1940 |
alg_embed :: "bool list => (nat => bool) => bool"
|
|
1941 |
|
|
1942 |
specification (alg_embed_primdef: alg_embed) alg_embed_def: "(ALL s. alg_embed [] s = True) &
|
|
1943 |
(ALL h t s. alg_embed (h # t) s = (h = SHD s & alg_embed t (STL s)))"
|
|
1944 |
by (import prob_algebra alg_embed_def)
|
|
1945 |
|
|
1946 |
consts
|
|
1947 |
algebra_embed :: "bool list list => (nat => bool) => bool"
|
|
1948 |
|
|
1949 |
specification (algebra_embed_primdef: algebra_embed) algebra_embed_def: "algebra_embed [] = EMPTY &
|
|
1950 |
(ALL h t.
|
|
1951 |
algebra_embed (h # t) = pred_set.UNION (alg_embed h) (algebra_embed t))"
|
|
1952 |
by (import prob_algebra algebra_embed_def)
|
|
1953 |
|
|
1954 |
consts
|
|
1955 |
measurable :: "((nat => bool) => bool) => bool"
|
|
1956 |
|
|
1957 |
defs
|
|
1958 |
measurable_primdef: "measurable == %s. EX b. s = algebra_embed b"
|
|
1959 |
|
|
1960 |
lemma measurable_def: "ALL s. measurable s = (EX b. s = algebra_embed b)"
|
|
1961 |
by (import prob_algebra measurable_def)
|
|
1962 |
|
|
1963 |
lemma HALVES_INTER: "pred_set.INTER (%x. SHD x = True) (%x. SHD x = False) = EMPTY"
|
|
1964 |
by (import prob_algebra HALVES_INTER)
|
|
1965 |
|
|
1966 |
lemma INTER_STL: "ALL p q. pred_set.INTER p q o STL = pred_set.INTER (p o STL) (q o STL)"
|
|
1967 |
by (import prob_algebra INTER_STL)
|
|
1968 |
|
|
1969 |
lemma COMPL_SHD: "ALL b. COMPL (%x. SHD x = b) = (%x. SHD x = (~ b))"
|
|
1970 |
by (import prob_algebra COMPL_SHD)
|
|
1971 |
|
|
1972 |
lemma ALG_EMBED_BASIC: "alg_embed [] = pred_set.UNIV &
|
|
1973 |
(ALL h t.
|
|
1974 |
alg_embed (h # t) = pred_set.INTER (%x. SHD x = h) (alg_embed t o STL))"
|
|
1975 |
by (import prob_algebra ALG_EMBED_BASIC)
|
|
1976 |
|
|
1977 |
lemma ALG_EMBED_NIL: "ALL c. All (alg_embed c) = (c = [])"
|
|
1978 |
by (import prob_algebra ALG_EMBED_NIL)
|
|
1979 |
|
|
1980 |
lemma ALG_EMBED_POPULATED: "ALL b. Ex (alg_embed b)"
|
|
1981 |
by (import prob_algebra ALG_EMBED_POPULATED)
|
|
1982 |
|
|
1983 |
lemma ALG_EMBED_PREFIX: "(All::(bool list => bool) => bool)
|
|
1984 |
(%b::bool list.
|
|
1985 |
(All::(bool list => bool) => bool)
|
|
1986 |
(%c::bool list.
|
|
1987 |
(All::((nat => bool) => bool) => bool)
|
|
1988 |
(%s::nat => bool.
|
|
1989 |
(op -->::bool => bool => bool)
|
|
1990 |
((op &::bool => bool => bool)
|
|
1991 |
((alg_embed::bool list => (nat => bool) => bool) b s)
|
|
1992 |
((alg_embed::bool list => (nat => bool) => bool) c s))
|
|
1993 |
((op |::bool => bool => bool)
|
|
1994 |
((IS_PREFIX::bool list => bool list => bool) b c)
|
|
1995 |
((IS_PREFIX::bool list => bool list => bool) c b)))))"
|
|
1996 |
by (import prob_algebra ALG_EMBED_PREFIX)
|
|
1997 |
|
|
1998 |
lemma ALG_EMBED_PREFIX_SUBSET: "ALL b c. SUBSET (alg_embed b) (alg_embed c) = IS_PREFIX b c"
|
|
1999 |
by (import prob_algebra ALG_EMBED_PREFIX_SUBSET)
|
|
2000 |
|
|
2001 |
lemma ALG_EMBED_TWINS: "ALL l.
|
|
2002 |
pred_set.UNION (alg_embed (SNOC True l)) (alg_embed (SNOC False l)) =
|
|
2003 |
alg_embed l"
|
|
2004 |
by (import prob_algebra ALG_EMBED_TWINS)
|
|
2005 |
|
|
2006 |
lemma ALGEBRA_EMBED_BASIC: "algebra_embed [] = EMPTY &
|
|
2007 |
algebra_embed [[]] = pred_set.UNIV &
|
|
2008 |
(ALL b. algebra_embed [[b]] = (%s. SHD s = b))"
|
|
2009 |
by (import prob_algebra ALGEBRA_EMBED_BASIC)
|
|
2010 |
|
|
2011 |
lemma ALGEBRA_EMBED_MEM: "(All::(bool list list => bool) => bool)
|
|
2012 |
(%b::bool list list.
|
|
2013 |
(All::((nat => bool) => bool) => bool)
|
|
2014 |
(%x::nat => bool.
|
|
2015 |
(op -->::bool => bool => bool)
|
|
2016 |
((algebra_embed::bool list list => (nat => bool) => bool) b x)
|
|
2017 |
((Ex::(bool list => bool) => bool)
|
|
2018 |
(%l::bool list.
|
|
2019 |
(op &::bool => bool => bool)
|
|
2020 |
((op mem::bool list => bool list list => bool) l b)
|
|
2021 |
((alg_embed::bool list => (nat => bool) => bool) l x)))))"
|
|
2022 |
by (import prob_algebra ALGEBRA_EMBED_MEM)
|
|
2023 |
|
|
2024 |
lemma ALGEBRA_EMBED_APPEND: "ALL l1 l2.
|
|
2025 |
algebra_embed (l1 @ l2) =
|
|
2026 |
pred_set.UNION (algebra_embed l1) (algebra_embed l2)"
|
|
2027 |
by (import prob_algebra ALGEBRA_EMBED_APPEND)
|
|
2028 |
|
|
2029 |
lemma ALGEBRA_EMBED_TLS: "ALL l b.
|
|
2030 |
algebra_embed (map (op # b) l) (SCONS h t) = (h = b & algebra_embed l t)"
|
|
2031 |
by (import prob_algebra ALGEBRA_EMBED_TLS)
|
|
2032 |
|
|
2033 |
lemma ALG_CANON_PREFS_EMBED: "ALL l b. algebra_embed (alg_canon_prefs l b) = algebra_embed (l # b)"
|
|
2034 |
by (import prob_algebra ALG_CANON_PREFS_EMBED)
|
|
2035 |
|
|
2036 |
lemma ALG_CANON_FIND_EMBED: "ALL l b. algebra_embed (alg_canon_find l b) = algebra_embed (l # b)"
|
|
2037 |
by (import prob_algebra ALG_CANON_FIND_EMBED)
|
|
2038 |
|
|
2039 |
lemma ALG_CANON1_EMBED: "ALL x. algebra_embed (alg_canon1 x) = algebra_embed x"
|
|
2040 |
by (import prob_algebra ALG_CANON1_EMBED)
|
|
2041 |
|
|
2042 |
lemma ALG_CANON_MERGE_EMBED: "ALL l b. algebra_embed (alg_canon_merge l b) = algebra_embed (l # b)"
|
|
2043 |
by (import prob_algebra ALG_CANON_MERGE_EMBED)
|
|
2044 |
|
|
2045 |
lemma ALG_CANON2_EMBED: "ALL x. algebra_embed (alg_canon2 x) = algebra_embed x"
|
|
2046 |
by (import prob_algebra ALG_CANON2_EMBED)
|
|
2047 |
|
|
2048 |
lemma ALG_CANON_EMBED: "ALL l. algebra_embed (alg_canon l) = algebra_embed l"
|
|
2049 |
by (import prob_algebra ALG_CANON_EMBED)
|
|
2050 |
|
|
2051 |
lemma ALGEBRA_CANON_UNIV: "(All::(bool list list => bool) => bool)
|
|
2052 |
(%l::bool list list.
|
|
2053 |
(op -->::bool => bool => bool)
|
|
2054 |
((algebra_canon::bool list list => bool) l)
|
|
2055 |
((op -->::bool => bool => bool)
|
|
2056 |
((op =::((nat => bool) => bool) => ((nat => bool) => bool) => bool)
|
|
2057 |
((algebra_embed::bool list list => (nat => bool) => bool) l)
|
|
2058 |
(pred_set.UNIV::(nat => bool) => bool))
|
|
2059 |
((op =::bool list list => bool list list => bool) l
|
|
2060 |
((op #::bool list => bool list list => bool list list)
|
|
2061 |
([]::bool list) ([]::bool list list)))))"
|
|
2062 |
by (import prob_algebra ALGEBRA_CANON_UNIV)
|
|
2063 |
|
|
2064 |
lemma ALG_CANON_REP: "ALL b c. (alg_canon b = alg_canon c) = (algebra_embed b = algebra_embed c)"
|
|
2065 |
by (import prob_algebra ALG_CANON_REP)
|
|
2066 |
|
|
2067 |
lemma ALGEBRA_CANON_EMBED_EMPTY: "(All::(bool list list => bool) => bool)
|
|
2068 |
(%l::bool list list.
|
|
2069 |
(op -->::bool => bool => bool)
|
|
2070 |
((algebra_canon::bool list list => bool) l)
|
|
2071 |
((op =::bool => bool => bool)
|
|
2072 |
((All::((nat => bool) => bool) => bool)
|
|
2073 |
(%v::nat => bool.
|
|
2074 |
(Not::bool => bool)
|
|
2075 |
((algebra_embed::bool list list => (nat => bool) => bool) l
|
|
2076 |
v)))
|
|
2077 |
((op =::bool list list => bool list list => bool) l
|
|
2078 |
([]::bool list list))))"
|
|
2079 |
by (import prob_algebra ALGEBRA_CANON_EMBED_EMPTY)
|
|
2080 |
|
|
2081 |
lemma ALGEBRA_CANON_EMBED_UNIV: "(All::(bool list list => bool) => bool)
|
|
2082 |
(%l::bool list list.
|
|
2083 |
(op -->::bool => bool => bool)
|
|
2084 |
((algebra_canon::bool list list => bool) l)
|
|
2085 |
((op =::bool => bool => bool)
|
|
2086 |
((All::((nat => bool) => bool) => bool)
|
|
2087 |
((algebra_embed::bool list list => (nat => bool) => bool) l))
|
|
2088 |
((op =::bool list list => bool list list => bool) l
|
|
2089 |
((op #::bool list => bool list list => bool list list)
|
|
2090 |
([]::bool list) ([]::bool list list)))))"
|
|
2091 |
by (import prob_algebra ALGEBRA_CANON_EMBED_UNIV)
|
|
2092 |
|
|
2093 |
lemma MEASURABLE_ALGEBRA: "ALL b. measurable (algebra_embed b)"
|
|
2094 |
by (import prob_algebra MEASURABLE_ALGEBRA)
|
|
2095 |
|
|
2096 |
lemma MEASURABLE_BASIC: "measurable EMPTY &
|
|
2097 |
measurable pred_set.UNIV & (ALL b. measurable (%s. SHD s = b))"
|
|
2098 |
by (import prob_algebra MEASURABLE_BASIC)
|
|
2099 |
|
|
2100 |
lemma MEASURABLE_SHD: "ALL b. measurable (%s. SHD s = b)"
|
|
2101 |
by (import prob_algebra MEASURABLE_SHD)
|
|
2102 |
|
|
2103 |
lemma ALGEBRA_EMBED_COMPL: "ALL l. EX l'. COMPL (algebra_embed l) = algebra_embed l'"
|
|
2104 |
by (import prob_algebra ALGEBRA_EMBED_COMPL)
|
|
2105 |
|
|
2106 |
lemma MEASURABLE_COMPL: "ALL s. measurable (COMPL s) = measurable s"
|
|
2107 |
by (import prob_algebra MEASURABLE_COMPL)
|
|
2108 |
|
|
2109 |
lemma MEASURABLE_UNION: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2110 |
(%s::(nat => bool) => bool.
|
|
2111 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
2112 |
(%t::(nat => bool) => bool.
|
|
2113 |
(op -->::bool => bool => bool)
|
|
2114 |
((op &::bool => bool => bool)
|
|
2115 |
((measurable::((nat => bool) => bool) => bool) s)
|
|
2116 |
((measurable::((nat => bool) => bool) => bool) t))
|
|
2117 |
((measurable::((nat => bool) => bool) => bool)
|
|
2118 |
((pred_set.UNION::((nat => bool) => bool)
|
|
2119 |
=> ((nat => bool) => bool)
|
|
2120 |
=> (nat => bool) => bool)
|
|
2121 |
s t))))"
|
|
2122 |
by (import prob_algebra MEASURABLE_UNION)
|
|
2123 |
|
|
2124 |
lemma MEASURABLE_INTER: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2125 |
(%s::(nat => bool) => bool.
|
|
2126 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
2127 |
(%t::(nat => bool) => bool.
|
|
2128 |
(op -->::bool => bool => bool)
|
|
2129 |
((op &::bool => bool => bool)
|
|
2130 |
((measurable::((nat => bool) => bool) => bool) s)
|
|
2131 |
((measurable::((nat => bool) => bool) => bool) t))
|
|
2132 |
((measurable::((nat => bool) => bool) => bool)
|
|
2133 |
((pred_set.INTER::((nat => bool) => bool)
|
|
2134 |
=> ((nat => bool) => bool)
|
|
2135 |
=> (nat => bool) => bool)
|
|
2136 |
s t))))"
|
|
2137 |
by (import prob_algebra MEASURABLE_INTER)
|
|
2138 |
|
|
2139 |
lemma MEASURABLE_STL: "ALL p. measurable (p o STL) = measurable p"
|
|
2140 |
by (import prob_algebra MEASURABLE_STL)
|
|
2141 |
|
|
2142 |
lemma MEASURABLE_SDROP: "ALL n p. measurable (p o SDROP n) = measurable p"
|
|
2143 |
by (import prob_algebra MEASURABLE_SDROP)
|
|
2144 |
|
|
2145 |
lemma MEASURABLE_INTER_HALVES: "ALL p.
|
|
2146 |
(measurable (pred_set.INTER (%x. SHD x = True) p) &
|
|
2147 |
measurable (pred_set.INTER (%x. SHD x = False) p)) =
|
|
2148 |
measurable p"
|
|
2149 |
by (import prob_algebra MEASURABLE_INTER_HALVES)
|
|
2150 |
|
|
2151 |
lemma MEASURABLE_HALVES: "ALL p q.
|
|
2152 |
measurable
|
|
2153 |
(pred_set.UNION (pred_set.INTER (%x. SHD x = True) p)
|
|
2154 |
(pred_set.INTER (%x. SHD x = False) q)) =
|
|
2155 |
(measurable (pred_set.INTER (%x. SHD x = True) p) &
|
|
2156 |
measurable (pred_set.INTER (%x. SHD x = False) q))"
|
|
2157 |
by (import prob_algebra MEASURABLE_HALVES)
|
|
2158 |
|
|
2159 |
lemma MEASURABLE_INTER_SHD: "ALL b p.
|
|
2160 |
measurable (pred_set.INTER (%x. SHD x = b) (p o STL)) = measurable p"
|
|
2161 |
by (import prob_algebra MEASURABLE_INTER_SHD)
|
|
2162 |
|
|
2163 |
;end_setup
|
|
2164 |
|
|
2165 |
;setup_theory prob
|
|
2166 |
|
|
2167 |
consts
|
|
2168 |
alg_measure :: "bool list list => real"
|
|
2169 |
|
|
2170 |
specification (alg_measure_primdef: alg_measure) alg_measure_def: "alg_measure [] = 0 &
|
|
2171 |
(ALL l rest. alg_measure (l # rest) = (1 / 2) ^ length l + alg_measure rest)"
|
|
2172 |
by (import prob alg_measure_def)
|
|
2173 |
|
|
2174 |
consts
|
|
2175 |
algebra_measure :: "bool list list => real"
|
|
2176 |
|
|
2177 |
defs
|
|
2178 |
algebra_measure_primdef: "algebra_measure ==
|
|
2179 |
%b. inf (%r. EX c. algebra_embed b = algebra_embed c & alg_measure c = r)"
|
|
2180 |
|
|
2181 |
lemma algebra_measure_def: "ALL b.
|
|
2182 |
algebra_measure b =
|
|
2183 |
inf (%r. EX c. algebra_embed b = algebra_embed c & alg_measure c = r)"
|
|
2184 |
by (import prob algebra_measure_def)
|
|
2185 |
|
|
2186 |
consts
|
|
2187 |
prob :: "((nat => bool) => bool) => real"
|
|
2188 |
|
|
2189 |
defs
|
|
2190 |
prob_primdef: "prob ==
|
|
2191 |
%s. sup (%r. EX b. algebra_measure b = r & SUBSET (algebra_embed b) s)"
|
|
2192 |
|
|
2193 |
lemma prob_def: "ALL s.
|
|
2194 |
prob s =
|
|
2195 |
sup (%r. EX b. algebra_measure b = r & SUBSET (algebra_embed b) s)"
|
|
2196 |
by (import prob prob_def)
|
|
2197 |
|
|
2198 |
lemma ALG_TWINS_MEASURE: "ALL l::bool list.
|
|
2199 |
((1::real) / (2::real)) ^ length (SNOC True l) +
|
|
2200 |
((1::real) / (2::real)) ^ length (SNOC False l) =
|
|
2201 |
((1::real) / (2::real)) ^ length l"
|
|
2202 |
by (import prob ALG_TWINS_MEASURE)
|
|
2203 |
|
|
2204 |
lemma ALG_MEASURE_BASIC: "alg_measure [] = 0 &
|
|
2205 |
alg_measure [[]] = 1 & (ALL b. alg_measure [[b]] = 1 / 2)"
|
|
2206 |
by (import prob ALG_MEASURE_BASIC)
|
|
2207 |
|
|
2208 |
lemma ALG_MEASURE_POS: "ALL l. 0 <= alg_measure l"
|
|
2209 |
by (import prob ALG_MEASURE_POS)
|
|
2210 |
|
|
2211 |
lemma ALG_MEASURE_APPEND: "ALL l1 l2. alg_measure (l1 @ l2) = alg_measure l1 + alg_measure l2"
|
|
2212 |
by (import prob ALG_MEASURE_APPEND)
|
|
2213 |
|
|
2214 |
lemma ALG_MEASURE_TLS: "ALL l b. 2 * alg_measure (map (op # b) l) = alg_measure l"
|
|
2215 |
by (import prob ALG_MEASURE_TLS)
|
|
2216 |
|
|
2217 |
lemma ALG_CANON_PREFS_MONO: "ALL l b. alg_measure (alg_canon_prefs l b) <= alg_measure (l # b)"
|
|
2218 |
by (import prob ALG_CANON_PREFS_MONO)
|
|
2219 |
|
|
2220 |
lemma ALG_CANON_FIND_MONO: "ALL l b. alg_measure (alg_canon_find l b) <= alg_measure (l # b)"
|
|
2221 |
by (import prob ALG_CANON_FIND_MONO)
|
|
2222 |
|
|
2223 |
lemma ALG_CANON1_MONO: "ALL x. alg_measure (alg_canon1 x) <= alg_measure x"
|
|
2224 |
by (import prob ALG_CANON1_MONO)
|
|
2225 |
|
|
2226 |
lemma ALG_CANON_MERGE_MONO: "ALL l b. alg_measure (alg_canon_merge l b) <= alg_measure (l # b)"
|
|
2227 |
by (import prob ALG_CANON_MERGE_MONO)
|
|
2228 |
|
|
2229 |
lemma ALG_CANON2_MONO: "ALL x. alg_measure (alg_canon2 x) <= alg_measure x"
|
|
2230 |
by (import prob ALG_CANON2_MONO)
|
|
2231 |
|
|
2232 |
lemma ALG_CANON_MONO: "ALL l. alg_measure (alg_canon l) <= alg_measure l"
|
|
2233 |
by (import prob ALG_CANON_MONO)
|
|
2234 |
|
|
2235 |
lemma ALGEBRA_MEASURE_DEF_ALT: "ALL l. algebra_measure l = alg_measure (alg_canon l)"
|
|
2236 |
by (import prob ALGEBRA_MEASURE_DEF_ALT)
|
|
2237 |
|
|
2238 |
lemma ALGEBRA_MEASURE_BASIC: "algebra_measure [] = 0 &
|
|
2239 |
algebra_measure [[]] = 1 & (ALL b. algebra_measure [[b]] = 1 / 2)"
|
|
2240 |
by (import prob ALGEBRA_MEASURE_BASIC)
|
|
2241 |
|
|
2242 |
lemma ALGEBRA_CANON_MEASURE_MAX: "(All::(bool list list => bool) => bool)
|
|
2243 |
(%l::bool list list.
|
|
2244 |
(op -->::bool => bool => bool)
|
|
2245 |
((algebra_canon::bool list list => bool) l)
|
|
2246 |
((op <=::real => real => bool)
|
|
2247 |
((alg_measure::bool list list => real) l) (1::real)))"
|
|
2248 |
by (import prob ALGEBRA_CANON_MEASURE_MAX)
|
|
2249 |
|
|
2250 |
lemma ALGEBRA_MEASURE_MAX: "ALL l. algebra_measure l <= 1"
|
|
2251 |
by (import prob ALGEBRA_MEASURE_MAX)
|
|
2252 |
|
|
2253 |
lemma ALGEBRA_MEASURE_MONO_EMBED: "(All::(bool list list => bool) => bool)
|
|
2254 |
(%x::bool list list.
|
|
2255 |
(All::(bool list list => bool) => bool)
|
|
2256 |
(%xa::bool list list.
|
|
2257 |
(op -->::bool => bool => bool)
|
|
2258 |
((SUBSET::((nat => bool) => bool)
|
|
2259 |
=> ((nat => bool) => bool) => bool)
|
|
2260 |
((algebra_embed::bool list list => (nat => bool) => bool) x)
|
|
2261 |
((algebra_embed::bool list list => (nat => bool) => bool) xa))
|
|
2262 |
((op <=::real => real => bool)
|
|
2263 |
((algebra_measure::bool list list => real) x)
|
|
2264 |
((algebra_measure::bool list list => real) xa))))"
|
|
2265 |
by (import prob ALGEBRA_MEASURE_MONO_EMBED)
|
|
2266 |
|
|
2267 |
lemma ALG_MEASURE_COMPL: "(All::(bool list list => bool) => bool)
|
|
2268 |
(%l::bool list list.
|
|
2269 |
(op -->::bool => bool => bool)
|
|
2270 |
((algebra_canon::bool list list => bool) l)
|
|
2271 |
((All::(bool list list => bool) => bool)
|
|
2272 |
(%c::bool list list.
|
|
2273 |
(op -->::bool => bool => bool)
|
|
2274 |
((algebra_canon::bool list list => bool) c)
|
|
2275 |
((op -->::bool => bool => bool)
|
|
2276 |
((op =::((nat => bool) => bool)
|
|
2277 |
=> ((nat => bool) => bool) => bool)
|
|
2278 |
((COMPL::((nat => bool) => bool) => (nat => bool) => bool)
|
|
2279 |
((algebra_embed::bool list list => (nat => bool) => bool)
|
|
2280 |
l))
|
|
2281 |
((algebra_embed::bool list list => (nat => bool) => bool)
|
|
2282 |
c))
|
|
2283 |
((op =::real => real => bool)
|
|
2284 |
((op +::real => real => real)
|
|
2285 |
((alg_measure::bool list list => real) l)
|
|
2286 |
((alg_measure::bool list list => real) c))
|
|
2287 |
(1::real))))))"
|
|
2288 |
by (import prob ALG_MEASURE_COMPL)
|
|
2289 |
|
|
2290 |
lemma ALG_MEASURE_ADDITIVE: "(All::(bool list list => bool) => bool)
|
|
2291 |
(%l::bool list list.
|
|
2292 |
(op -->::bool => bool => bool)
|
|
2293 |
((algebra_canon::bool list list => bool) l)
|
|
2294 |
((All::(bool list list => bool) => bool)
|
|
2295 |
(%c::bool list list.
|
|
2296 |
(op -->::bool => bool => bool)
|
|
2297 |
((algebra_canon::bool list list => bool) c)
|
|
2298 |
((All::(bool list list => bool) => bool)
|
|
2299 |
(%d::bool list list.
|
|
2300 |
(op -->::bool => bool => bool)
|
|
2301 |
((algebra_canon::bool list list => bool) d)
|
|
2302 |
((op -->::bool => bool => bool)
|
|
2303 |
((op &::bool => bool => bool)
|
|
2304 |
((op =::((nat => bool) => bool)
|
|
2305 |
=> ((nat => bool) => bool) => bool)
|
|
2306 |
((pred_set.INTER::((nat => bool) => bool)
|
|
2307 |
=> ((nat => bool) => bool) => (nat => bool) => bool)
|
|
2308 |
((algebra_embed::bool list list
|
|
2309 |
=> (nat => bool) => bool)
|
|
2310 |
c)
|
|
2311 |
((algebra_embed::bool list list
|
|
2312 |
=> (nat => bool) => bool)
|
|
2313 |
d))
|
|
2314 |
(EMPTY::(nat => bool) => bool))
|
|
2315 |
((op =::((nat => bool) => bool)
|
|
2316 |
=> ((nat => bool) => bool) => bool)
|
|
2317 |
((algebra_embed::bool list list
|
|
2318 |
=> (nat => bool) => bool)
|
|
2319 |
l)
|
|
2320 |
((pred_set.UNION::((nat => bool) => bool)
|
|
2321 |
=> ((nat => bool) => bool) => (nat => bool) => bool)
|
|
2322 |
((algebra_embed::bool list list
|
|
2323 |
=> (nat => bool) => bool)
|
|
2324 |
c)
|
|
2325 |
((algebra_embed::bool list list
|
|
2326 |
=> (nat => bool) => bool)
|
|
2327 |
d))))
|
|
2328 |
((op =::real => real => bool)
|
|
2329 |
((alg_measure::bool list list => real) l)
|
|
2330 |
((op +::real => real => real)
|
|
2331 |
((alg_measure::bool list list => real) c)
|
|
2332 |
((alg_measure::bool list list => real) d)))))))))"
|
|
2333 |
by (import prob ALG_MEASURE_ADDITIVE)
|
|
2334 |
|
|
2335 |
lemma PROB_ALGEBRA: "ALL l. prob (algebra_embed l) = algebra_measure l"
|
|
2336 |
by (import prob PROB_ALGEBRA)
|
|
2337 |
|
|
2338 |
lemma PROB_BASIC: "prob EMPTY = 0 &
|
|
2339 |
prob pred_set.UNIV = 1 & (ALL b. prob (%s. SHD s = b) = 1 / 2)"
|
|
2340 |
by (import prob PROB_BASIC)
|
|
2341 |
|
|
2342 |
lemma PROB_ADDITIVE: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2343 |
(%s::(nat => bool) => bool.
|
|
2344 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
2345 |
(%t::(nat => bool) => bool.
|
|
2346 |
(op -->::bool => bool => bool)
|
|
2347 |
((op &::bool => bool => bool)
|
|
2348 |
((measurable::((nat => bool) => bool) => bool) s)
|
|
2349 |
((op &::bool => bool => bool)
|
|
2350 |
((measurable::((nat => bool) => bool) => bool) t)
|
|
2351 |
((op =::((nat => bool) => bool)
|
|
2352 |
=> ((nat => bool) => bool) => bool)
|
|
2353 |
((pred_set.INTER::((nat => bool) => bool)
|
|
2354 |
=> ((nat => bool) => bool)
|
|
2355 |
=> (nat => bool) => bool)
|
|
2356 |
s t)
|
|
2357 |
(EMPTY::(nat => bool) => bool))))
|
|
2358 |
((op =::real => real => bool)
|
|
2359 |
((prob::((nat => bool) => bool) => real)
|
|
2360 |
((pred_set.UNION::((nat => bool) => bool)
|
|
2361 |
=> ((nat => bool) => bool)
|
|
2362 |
=> (nat => bool) => bool)
|
|
2363 |
s t))
|
|
2364 |
((op +::real => real => real)
|
|
2365 |
((prob::((nat => bool) => bool) => real) s)
|
|
2366 |
((prob::((nat => bool) => bool) => real) t)))))"
|
|
2367 |
by (import prob PROB_ADDITIVE)
|
|
2368 |
|
|
2369 |
lemma PROB_COMPL: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2370 |
(%s::(nat => bool) => bool.
|
|
2371 |
(op -->::bool => bool => bool)
|
|
2372 |
((measurable::((nat => bool) => bool) => bool) s)
|
|
2373 |
((op =::real => real => bool)
|
|
2374 |
((prob::((nat => bool) => bool) => real)
|
|
2375 |
((COMPL::((nat => bool) => bool) => (nat => bool) => bool) s))
|
|
2376 |
((op -::real => real => real) (1::real)
|
|
2377 |
((prob::((nat => bool) => bool) => real) s))))"
|
|
2378 |
by (import prob PROB_COMPL)
|
|
2379 |
|
|
2380 |
lemma PROB_SUP_EXISTS1: "ALL s. EX x b. algebra_measure b = x & SUBSET (algebra_embed b) s"
|
|
2381 |
by (import prob PROB_SUP_EXISTS1)
|
|
2382 |
|
|
2383 |
lemma PROB_SUP_EXISTS2: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2384 |
(%s::(nat => bool) => bool.
|
|
2385 |
(Ex::(real => bool) => bool)
|
|
2386 |
(%x::real.
|
|
2387 |
(All::(real => bool) => bool)
|
|
2388 |
(%r::real.
|
|
2389 |
(op -->::bool => bool => bool)
|
|
2390 |
((Ex::(bool list list => bool) => bool)
|
|
2391 |
(%b::bool list list.
|
|
2392 |
(op &::bool => bool => bool)
|
|
2393 |
((op =::real => real => bool)
|
|
2394 |
((algebra_measure::bool list list => real) b) r)
|
|
2395 |
((SUBSET::((nat => bool) => bool)
|
|
2396 |
=> ((nat => bool) => bool) => bool)
|
|
2397 |
((algebra_embed::bool list list
|
|
2398 |
=> (nat => bool) => bool)
|
|
2399 |
b)
|
|
2400 |
s)))
|
|
2401 |
((op <=::real => real => bool) r x))))"
|
|
2402 |
by (import prob PROB_SUP_EXISTS2)
|
|
2403 |
|
|
2404 |
lemma PROB_LE_X: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2405 |
(%s::(nat => bool) => bool.
|
|
2406 |
(All::(real => bool) => bool)
|
|
2407 |
(%x::real.
|
|
2408 |
(op -->::bool => bool => bool)
|
|
2409 |
((All::(((nat => bool) => bool) => bool) => bool)
|
|
2410 |
(%s'::(nat => bool) => bool.
|
|
2411 |
(op -->::bool => bool => bool)
|
|
2412 |
((op &::bool => bool => bool)
|
|
2413 |
((measurable::((nat => bool) => bool) => bool) s')
|
|
2414 |
((SUBSET::((nat => bool) => bool)
|
|
2415 |
=> ((nat => bool) => bool) => bool)
|
|
2416 |
s' s))
|
|
2417 |
((op <=::real => real => bool)
|
|
2418 |
((prob::((nat => bool) => bool) => real) s') x)))
|
|
2419 |
((op <=::real => real => bool)
|
|
2420 |
((prob::((nat => bool) => bool) => real) s) x)))"
|
|
2421 |
by (import prob PROB_LE_X)
|
|
2422 |
|
|
2423 |
lemma X_LE_PROB: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2424 |
(%s::(nat => bool) => bool.
|
|
2425 |
(All::(real => bool) => bool)
|
|
2426 |
(%x::real.
|
|
2427 |
(op -->::bool => bool => bool)
|
|
2428 |
((Ex::(((nat => bool) => bool) => bool) => bool)
|
|
2429 |
(%s'::(nat => bool) => bool.
|
|
2430 |
(op &::bool => bool => bool)
|
|
2431 |
((measurable::((nat => bool) => bool) => bool) s')
|
|
2432 |
((op &::bool => bool => bool)
|
|
2433 |
((SUBSET::((nat => bool) => bool)
|
|
2434 |
=> ((nat => bool) => bool) => bool)
|
|
2435 |
s' s)
|
|
2436 |
((op <=::real => real => bool) x
|
|
2437 |
((prob::((nat => bool) => bool) => real) s')))))
|
|
2438 |
((op <=::real => real => bool) x
|
|
2439 |
((prob::((nat => bool) => bool) => real) s))))"
|
|
2440 |
by (import prob X_LE_PROB)
|
|
2441 |
|
|
2442 |
lemma PROB_SUBSET_MONO: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2443 |
(%s::(nat => bool) => bool.
|
|
2444 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
2445 |
(%t::(nat => bool) => bool.
|
|
2446 |
(op -->::bool => bool => bool)
|
|
2447 |
((SUBSET::((nat => bool) => bool)
|
|
2448 |
=> ((nat => bool) => bool) => bool)
|
|
2449 |
s t)
|
|
2450 |
((op <=::real => real => bool)
|
|
2451 |
((prob::((nat => bool) => bool) => real) s)
|
|
2452 |
((prob::((nat => bool) => bool) => real) t))))"
|
|
2453 |
by (import prob PROB_SUBSET_MONO)
|
|
2454 |
|
|
2455 |
lemma PROB_ALG: "ALL x. prob (alg_embed x) = (1 / 2) ^ length x"
|
|
2456 |
by (import prob PROB_ALG)
|
|
2457 |
|
|
2458 |
lemma PROB_STL: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2459 |
(%p::(nat => bool) => bool.
|
|
2460 |
(op -->::bool => bool => bool)
|
|
2461 |
((measurable::((nat => bool) => bool) => bool) p)
|
|
2462 |
((op =::real => real => bool)
|
|
2463 |
((prob::((nat => bool) => bool) => real)
|
|
2464 |
((op o::((nat => bool) => bool)
|
|
2465 |
=> ((nat => bool) => nat => bool)
|
|
2466 |
=> (nat => bool) => bool)
|
|
2467 |
p (STL::(nat => bool) => nat => bool)))
|
|
2468 |
((prob::((nat => bool) => bool) => real) p)))"
|
|
2469 |
by (import prob PROB_STL)
|
|
2470 |
|
|
2471 |
lemma PROB_SDROP: "(All::(nat => bool) => bool)
|
|
2472 |
(%n::nat.
|
|
2473 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
2474 |
(%p::(nat => bool) => bool.
|
|
2475 |
(op -->::bool => bool => bool)
|
|
2476 |
((measurable::((nat => bool) => bool) => bool) p)
|
|
2477 |
((op =::real => real => bool)
|
|
2478 |
((prob::((nat => bool) => bool) => real)
|
|
2479 |
((op o::((nat => bool) => bool)
|
|
2480 |
=> ((nat => bool) => nat => bool)
|
|
2481 |
=> (nat => bool) => bool)
|
|
2482 |
p ((SDROP::nat => (nat => bool) => nat => bool) n)))
|
|
2483 |
((prob::((nat => bool) => bool) => real) p))))"
|
|
2484 |
by (import prob PROB_SDROP)
|
|
2485 |
|
|
2486 |
lemma PROB_INTER_HALVES: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2487 |
(%p::(nat => bool) => bool.
|
|
2488 |
(op -->::bool => bool => bool)
|
|
2489 |
((measurable::((nat => bool) => bool) => bool) p)
|
|
2490 |
((op =::real => real => bool)
|
|
2491 |
((op +::real => real => real)
|
|
2492 |
((prob::((nat => bool) => bool) => real)
|
|
2493 |
((pred_set.INTER::((nat => bool) => bool)
|
|
2494 |
=> ((nat => bool) => bool)
|
|
2495 |
=> (nat => bool) => bool)
|
|
2496 |
(%x::nat => bool.
|
|
2497 |
(op =::bool => bool => bool)
|
|
2498 |
((SHD::(nat => bool) => bool) x) (True::bool))
|
|
2499 |
p))
|
|
2500 |
((prob::((nat => bool) => bool) => real)
|
|
2501 |
((pred_set.INTER::((nat => bool) => bool)
|
|
2502 |
=> ((nat => bool) => bool)
|
|
2503 |
=> (nat => bool) => bool)
|
|
2504 |
(%x::nat => bool.
|
|
2505 |
(op =::bool => bool => bool)
|
|
2506 |
((SHD::(nat => bool) => bool) x) (False::bool))
|
|
2507 |
p)))
|
|
2508 |
((prob::((nat => bool) => bool) => real) p)))"
|
|
2509 |
by (import prob PROB_INTER_HALVES)
|
|
2510 |
|
|
2511 |
lemma PROB_INTER_SHD: "(All::(bool => bool) => bool)
|
|
2512 |
(%b::bool.
|
|
2513 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
2514 |
(%p::(nat => bool) => bool.
|
|
2515 |
(op -->::bool => bool => bool)
|
|
2516 |
((measurable::((nat => bool) => bool) => bool) p)
|
|
2517 |
((op =::real => real => bool)
|
|
2518 |
((prob::((nat => bool) => bool) => real)
|
|
2519 |
((pred_set.INTER::((nat => bool) => bool)
|
|
2520 |
=> ((nat => bool) => bool)
|
|
2521 |
=> (nat => bool) => bool)
|
|
2522 |
(%x::nat => bool.
|
|
2523 |
(op =::bool => bool => bool)
|
|
2524 |
((SHD::(nat => bool) => bool) x) b)
|
|
2525 |
((op o::((nat => bool) => bool)
|
|
2526 |
=> ((nat => bool) => nat => bool)
|
|
2527 |
=> (nat => bool) => bool)
|
|
2528 |
p (STL::(nat => bool) => nat => bool))))
|
|
2529 |
((op *::real => real => real)
|
|
2530 |
((op /::real => real => real) (1::real)
|
|
2531 |
((number_of::bin => real)
|
15647
|
2532 |
((op BIT::bin => bit => bin)
|
|
2533 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
2534 |
(bit.B1::bit))
|
|
2535 |
(bit.B0::bit))))
|
14516
|
2536 |
((prob::((nat => bool) => bool) => real) p)))))"
|
|
2537 |
by (import prob PROB_INTER_SHD)
|
|
2538 |
|
|
2539 |
lemma ALGEBRA_MEASURE_POS: "ALL l. 0 <= algebra_measure l"
|
|
2540 |
by (import prob ALGEBRA_MEASURE_POS)
|
|
2541 |
|
|
2542 |
lemma ALGEBRA_MEASURE_RANGE: "ALL l. 0 <= algebra_measure l & algebra_measure l <= 1"
|
|
2543 |
by (import prob ALGEBRA_MEASURE_RANGE)
|
|
2544 |
|
|
2545 |
lemma PROB_POS: "ALL p. 0 <= prob p"
|
|
2546 |
by (import prob PROB_POS)
|
|
2547 |
|
|
2548 |
lemma PROB_MAX: "ALL p. prob p <= 1"
|
|
2549 |
by (import prob PROB_MAX)
|
|
2550 |
|
|
2551 |
lemma PROB_RANGE: "ALL p. 0 <= prob p & prob p <= 1"
|
|
2552 |
by (import prob PROB_RANGE)
|
|
2553 |
|
|
2554 |
lemma ABS_PROB: "ALL p. abs (prob p) = prob p"
|
|
2555 |
by (import prob ABS_PROB)
|
|
2556 |
|
|
2557 |
lemma PROB_SHD: "ALL b. prob (%s. SHD s = b) = 1 / 2"
|
|
2558 |
by (import prob PROB_SHD)
|
|
2559 |
|
|
2560 |
lemma PROB_COMPL_LE1: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2561 |
(%p::(nat => bool) => bool.
|
|
2562 |
(All::(real => bool) => bool)
|
|
2563 |
(%r::real.
|
|
2564 |
(op -->::bool => bool => bool)
|
|
2565 |
((measurable::((nat => bool) => bool) => bool) p)
|
|
2566 |
((op =::bool => bool => bool)
|
|
2567 |
((op <=::real => real => bool)
|
|
2568 |
((prob::((nat => bool) => bool) => real)
|
|
2569 |
((COMPL::((nat => bool) => bool) => (nat => bool) => bool)
|
|
2570 |
p))
|
|
2571 |
r)
|
|
2572 |
((op <=::real => real => bool)
|
|
2573 |
((op -::real => real => real) (1::real) r)
|
|
2574 |
((prob::((nat => bool) => bool) => real) p)))))"
|
|
2575 |
by (import prob PROB_COMPL_LE1)
|
|
2576 |
|
|
2577 |
;end_setup
|
|
2578 |
|
|
2579 |
;setup_theory prob_pseudo
|
|
2580 |
|
|
2581 |
consts
|
|
2582 |
pseudo_linear_hd :: "nat => bool"
|
|
2583 |
|
|
2584 |
defs
|
|
2585 |
pseudo_linear_hd_primdef: "pseudo_linear_hd == EVEN"
|
|
2586 |
|
|
2587 |
lemma pseudo_linear_hd_def: "pseudo_linear_hd = EVEN"
|
|
2588 |
by (import prob_pseudo pseudo_linear_hd_def)
|
|
2589 |
|
|
2590 |
consts
|
|
2591 |
pseudo_linear_tl :: "nat => nat => nat => nat => nat"
|
|
2592 |
|
|
2593 |
defs
|
|
2594 |
pseudo_linear_tl_primdef: "pseudo_linear_tl == %a b n x. (a * x + b) mod (2 * n + 1)"
|
|
2595 |
|
|
2596 |
lemma pseudo_linear_tl_def: "ALL a b n x. pseudo_linear_tl a b n x = (a * x + b) mod (2 * n + 1)"
|
|
2597 |
by (import prob_pseudo pseudo_linear_tl_def)
|
|
2598 |
|
|
2599 |
lemma PSEUDO_LINEAR1_EXECUTE: "EX x. (ALL xa. SHD (x xa) = pseudo_linear_hd xa) &
|
|
2600 |
(ALL xa.
|
|
2601 |
STL (x xa) =
|
|
2602 |
x (pseudo_linear_tl
|
|
2603 |
(NUMERAL
|
|
2604 |
(NUMERAL_BIT1
|
|
2605 |
(NUMERAL_BIT1
|
|
2606 |
(NUMERAL_BIT1
|
|
2607 |
(NUMERAL_BIT2
|
|
2608 |
(NUMERAL_BIT1 (NUMERAL_BIT2 ALT_ZERO)))))))
|
|
2609 |
(NUMERAL
|
|
2610 |
(NUMERAL_BIT1
|
|
2611 |
(NUMERAL_BIT1
|
|
2612 |
(NUMERAL_BIT1
|
|
2613 |
(NUMERAL_BIT1
|
|
2614 |
(NUMERAL_BIT1 (NUMERAL_BIT2 ALT_ZERO)))))))
|
|
2615 |
(NUMERAL
|
|
2616 |
(NUMERAL_BIT1
|
|
2617 |
(NUMERAL_BIT1
|
|
2618 |
(NUMERAL_BIT1
|
|
2619 |
(NUMERAL_BIT1
|
|
2620 |
(NUMERAL_BIT2 (NUMERAL_BIT1 ALT_ZERO)))))))
|
|
2621 |
xa))"
|
|
2622 |
by (import prob_pseudo PSEUDO_LINEAR1_EXECUTE)
|
|
2623 |
|
|
2624 |
consts
|
|
2625 |
pseudo_linear1 :: "nat => nat => bool"
|
|
2626 |
|
|
2627 |
specification (pseudo_linear1_primdef: pseudo_linear1) pseudo_linear1_def: "(ALL x. SHD (pseudo_linear1 x) = pseudo_linear_hd x) &
|
|
2628 |
(ALL x.
|
|
2629 |
STL (pseudo_linear1 x) =
|
|
2630 |
pseudo_linear1
|
|
2631 |
(pseudo_linear_tl
|
|
2632 |
(NUMERAL
|
|
2633 |
(NUMERAL_BIT1
|
|
2634 |
(NUMERAL_BIT1
|
|
2635 |
(NUMERAL_BIT1
|
|
2636 |
(NUMERAL_BIT2 (NUMERAL_BIT1 (NUMERAL_BIT2 ALT_ZERO)))))))
|
|
2637 |
(NUMERAL
|
|
2638 |
(NUMERAL_BIT1
|
|
2639 |
(NUMERAL_BIT1
|
|
2640 |
(NUMERAL_BIT1
|
|
2641 |
(NUMERAL_BIT1 (NUMERAL_BIT1 (NUMERAL_BIT2 ALT_ZERO)))))))
|
|
2642 |
(NUMERAL
|
|
2643 |
(NUMERAL_BIT1
|
|
2644 |
(NUMERAL_BIT1
|
|
2645 |
(NUMERAL_BIT1
|
|
2646 |
(NUMERAL_BIT1 (NUMERAL_BIT2 (NUMERAL_BIT1 ALT_ZERO)))))))
|
|
2647 |
x))"
|
|
2648 |
by (import prob_pseudo pseudo_linear1_def)
|
|
2649 |
|
|
2650 |
consts
|
|
2651 |
pseudo :: "nat => nat => bool"
|
|
2652 |
|
|
2653 |
defs
|
|
2654 |
pseudo_primdef: "pseudo == pseudo_linear1"
|
|
2655 |
|
|
2656 |
lemma pseudo_def: "pseudo = pseudo_linear1"
|
|
2657 |
by (import prob_pseudo pseudo_def)
|
|
2658 |
|
|
2659 |
;end_setup
|
|
2660 |
|
|
2661 |
;setup_theory prob_indep
|
|
2662 |
|
|
2663 |
consts
|
|
2664 |
indep_set :: "((nat => bool) => bool) => ((nat => bool) => bool) => bool"
|
|
2665 |
|
|
2666 |
defs
|
|
2667 |
indep_set_primdef: "indep_set ==
|
|
2668 |
%p q. measurable p &
|
|
2669 |
measurable q & prob (pred_set.INTER p q) = prob p * prob q"
|
|
2670 |
|
|
2671 |
lemma indep_set_def: "ALL p q.
|
|
2672 |
indep_set p q =
|
|
2673 |
(measurable p &
|
|
2674 |
measurable q & prob (pred_set.INTER p q) = prob p * prob q)"
|
|
2675 |
by (import prob_indep indep_set_def)
|
|
2676 |
|
|
2677 |
consts
|
|
2678 |
alg_cover_set :: "bool list list => bool"
|
|
2679 |
|
|
2680 |
defs
|
|
2681 |
alg_cover_set_primdef: "alg_cover_set ==
|
|
2682 |
%l. alg_sorted l & alg_prefixfree l & algebra_embed l = pred_set.UNIV"
|
|
2683 |
|
|
2684 |
lemma alg_cover_set_def: "ALL l.
|
|
2685 |
alg_cover_set l =
|
|
2686 |
(alg_sorted l & alg_prefixfree l & algebra_embed l = pred_set.UNIV)"
|
|
2687 |
by (import prob_indep alg_cover_set_def)
|
|
2688 |
|
|
2689 |
consts
|
|
2690 |
alg_cover :: "bool list list => (nat => bool) => bool list"
|
|
2691 |
|
|
2692 |
defs
|
|
2693 |
alg_cover_primdef: "alg_cover == %l x. SOME b. b mem l & alg_embed b x"
|
|
2694 |
|
|
2695 |
lemma alg_cover_def: "ALL l x. alg_cover l x = (SOME b. b mem l & alg_embed b x)"
|
|
2696 |
by (import prob_indep alg_cover_def)
|
|
2697 |
|
|
2698 |
consts
|
|
2699 |
indep :: "((nat => bool) => 'a * (nat => bool)) => bool"
|
|
2700 |
|
|
2701 |
defs
|
|
2702 |
indep_primdef: "indep ==
|
|
2703 |
%f. EX l r.
|
|
2704 |
alg_cover_set l &
|
|
2705 |
(ALL s. f s = (let c = alg_cover l s in (r c, SDROP (length c) s)))"
|
|
2706 |
|
|
2707 |
lemma indep_def: "ALL f.
|
|
2708 |
indep f =
|
|
2709 |
(EX l r.
|
|
2710 |
alg_cover_set l &
|
|
2711 |
(ALL s. f s = (let c = alg_cover l s in (r c, SDROP (length c) s))))"
|
|
2712 |
by (import prob_indep indep_def)
|
|
2713 |
|
|
2714 |
lemma INDEP_SET_BASIC: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2715 |
(%p::(nat => bool) => bool.
|
|
2716 |
(op -->::bool => bool => bool)
|
|
2717 |
((measurable::((nat => bool) => bool) => bool) p)
|
|
2718 |
((op &::bool => bool => bool)
|
|
2719 |
((indep_set::((nat => bool) => bool)
|
|
2720 |
=> ((nat => bool) => bool) => bool)
|
|
2721 |
(EMPTY::(nat => bool) => bool) p)
|
|
2722 |
((indep_set::((nat => bool) => bool)
|
|
2723 |
=> ((nat => bool) => bool) => bool)
|
|
2724 |
(pred_set.UNIV::(nat => bool) => bool) p)))"
|
|
2725 |
by (import prob_indep INDEP_SET_BASIC)
|
|
2726 |
|
|
2727 |
lemma INDEP_SET_SYM: "ALL p q. indep_set p q = indep_set p q"
|
|
2728 |
by (import prob_indep INDEP_SET_SYM)
|
|
2729 |
|
|
2730 |
lemma INDEP_SET_DISJOINT_DECOMP: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
2731 |
(%p::(nat => bool) => bool.
|
|
2732 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
2733 |
(%q::(nat => bool) => bool.
|
|
2734 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
2735 |
(%r::(nat => bool) => bool.
|
|
2736 |
(op -->::bool => bool => bool)
|
|
2737 |
((op &::bool => bool => bool)
|
|
2738 |
((indep_set::((nat => bool) => bool)
|
|
2739 |
=> ((nat => bool) => bool) => bool)
|
|
2740 |
p r)
|
|
2741 |
((op &::bool => bool => bool)
|
|
2742 |
((indep_set::((nat => bool) => bool)
|
|
2743 |
=> ((nat => bool) => bool) => bool)
|
|
2744 |
q r)
|
|
2745 |
((op =::((nat => bool) => bool)
|
|
2746 |
=> ((nat => bool) => bool) => bool)
|
|
2747 |
((pred_set.INTER::((nat => bool) => bool)
|
|
2748 |
=> ((nat => bool) => bool) => (nat => bool) => bool)
|
|
2749 |
p q)
|
|
2750 |
(EMPTY::(nat => bool) => bool))))
|
|
2751 |
((indep_set::((nat => bool) => bool)
|
|
2752 |
=> ((nat => bool) => bool) => bool)
|
|
2753 |
((pred_set.UNION::((nat => bool) => bool)
|
|
2754 |
=> ((nat => bool) => bool)
|
|
2755 |
=> (nat => bool) => bool)
|
|
2756 |
p q)
|
|
2757 |
r))))"
|
|
2758 |
by (import prob_indep INDEP_SET_DISJOINT_DECOMP)
|
|
2759 |
|
|
2760 |
lemma ALG_COVER_SET_BASIC: "~ alg_cover_set [] & alg_cover_set [[]] & alg_cover_set [[True], [False]]"
|
|
2761 |
by (import prob_indep ALG_COVER_SET_BASIC)
|
|
2762 |
|
|
2763 |
lemma ALG_COVER_WELL_DEFINED: "(All::(bool list list => bool) => bool)
|
|
2764 |
(%l::bool list list.
|
|
2765 |
(All::((nat => bool) => bool) => bool)
|
|
2766 |
(%x::nat => bool.
|
|
2767 |
(op -->::bool => bool => bool)
|
|
2768 |
((alg_cover_set::bool list list => bool) l)
|
|
2769 |
((op &::bool => bool => bool)
|
|
2770 |
((op mem::bool list => bool list list => bool)
|
|
2771 |
((alg_cover::bool list list => (nat => bool) => bool list) l
|
|
2772 |
x)
|
|
2773 |
l)
|
|
2774 |
((alg_embed::bool list => (nat => bool) => bool)
|
|
2775 |
((alg_cover::bool list list => (nat => bool) => bool list) l
|
|
2776 |
x)
|
|
2777 |
x))))"
|
|
2778 |
by (import prob_indep ALG_COVER_WELL_DEFINED)
|
|
2779 |
|
|
2780 |
lemma ALG_COVER_UNIV: "alg_cover [[]] = K []"
|
|
2781 |
by (import prob_indep ALG_COVER_UNIV)
|
|
2782 |
|
|
2783 |
lemma MAP_CONS_TL_FILTER: "(All::(bool list list => bool) => bool)
|
|
2784 |
(%l::bool list list.
|
|
2785 |
(All::(bool => bool) => bool)
|
|
2786 |
(%b::bool.
|
|
2787 |
(op -->::bool => bool => bool)
|
|
2788 |
((Not::bool => bool)
|
|
2789 |
((op mem::bool list => bool list list => bool) ([]::bool list)
|
|
2790 |
l))
|
|
2791 |
((op =::bool list list => bool list list => bool)
|
|
2792 |
((map::(bool list => bool list)
|
|
2793 |
=> bool list list => bool list list)
|
|
2794 |
((op #::bool => bool list => bool list) b)
|
|
2795 |
((map::(bool list => bool list)
|
|
2796 |
=> bool list list => bool list list)
|
|
2797 |
(tl::bool list => bool list)
|
|
2798 |
((filter::(bool list => bool)
|
|
2799 |
=> bool list list => bool list list)
|
|
2800 |
(%x::bool list.
|
|
2801 |
(op =::bool => bool => bool)
|
|
2802 |
((hd::bool list => bool) x) b)
|
|
2803 |
l)))
|
|
2804 |
((filter::(bool list => bool)
|
|
2805 |
=> bool list list => bool list list)
|
|
2806 |
(%x::bool list.
|
|
2807 |
(op =::bool => bool => bool) ((hd::bool list => bool) x)
|
|
2808 |
b)
|
|
2809 |
l))))"
|
|
2810 |
by (import prob_indep MAP_CONS_TL_FILTER)
|
|
2811 |
|
|
2812 |
lemma ALG_COVER_SET_CASES_THM: "ALL l.
|
|
2813 |
alg_cover_set l =
|
|
2814 |
(l = [[]] |
|
|
2815 |
(EX x xa.
|
|
2816 |
alg_cover_set x &
|
|
2817 |
alg_cover_set xa & l = map (op # True) x @ map (op # False) xa))"
|
|
2818 |
by (import prob_indep ALG_COVER_SET_CASES_THM)
|
|
2819 |
|
|
2820 |
lemma ALG_COVER_SET_CASES: "(All::((bool list list => bool) => bool) => bool)
|
|
2821 |
(%P::bool list list => bool.
|
|
2822 |
(op -->::bool => bool => bool)
|
|
2823 |
((op &::bool => bool => bool)
|
|
2824 |
(P ((op #::bool list => bool list list => bool list list)
|
|
2825 |
([]::bool list) ([]::bool list list)))
|
|
2826 |
((All::(bool list list => bool) => bool)
|
|
2827 |
(%l1::bool list list.
|
|
2828 |
(All::(bool list list => bool) => bool)
|
|
2829 |
(%l2::bool list list.
|
|
2830 |
(op -->::bool => bool => bool)
|
|
2831 |
((op &::bool => bool => bool)
|
|
2832 |
((alg_cover_set::bool list list => bool) l1)
|
|
2833 |
((op &::bool => bool => bool)
|
|
2834 |
((alg_cover_set::bool list list => bool) l2)
|
|
2835 |
((alg_cover_set::bool list list => bool)
|
|
2836 |
((op @::bool list list
|
|
2837 |
=> bool list list => bool list list)
|
|
2838 |
((map::(bool list => bool list)
|
|
2839 |
=> bool list list => bool list list)
|
|
2840 |
((op #::bool => bool list => bool list)
|
|
2841 |
(True::bool))
|
|
2842 |
l1)
|
|
2843 |
((map::(bool list => bool list)
|
|
2844 |
=> bool list list => bool list list)
|
|
2845 |
((op #::bool => bool list => bool list)
|
|
2846 |
(False::bool))
|
|
2847 |
l2)))))
|
|
2848 |
(P ((op @::bool list list
|
|
2849 |
=> bool list list => bool list list)
|
|
2850 |
((map::(bool list => bool list)
|
|
2851 |
=> bool list list => bool list list)
|
|
2852 |
((op #::bool => bool list => bool list)
|
|
2853 |
(True::bool))
|
|
2854 |
l1)
|
|
2855 |
((map::(bool list => bool list)
|
|
2856 |
=> bool list list => bool list list)
|
|
2857 |
((op #::bool => bool list => bool list)
|
|
2858 |
(False::bool))
|
|
2859 |
l2)))))))
|
|
2860 |
((All::(bool list list => bool) => bool)
|
|
2861 |
(%l::bool list list.
|
|
2862 |
(op -->::bool => bool => bool)
|
|
2863 |
((alg_cover_set::bool list list => bool) l) (P l))))"
|
|
2864 |
by (import prob_indep ALG_COVER_SET_CASES)
|
|
2865 |
|
|
2866 |
lemma ALG_COVER_SET_INDUCTION: "(All::((bool list list => bool) => bool) => bool)
|
|
2867 |
(%P::bool list list => bool.
|
|
2868 |
(op -->::bool => bool => bool)
|
|
2869 |
((op &::bool => bool => bool)
|
|
2870 |
(P ((op #::bool list => bool list list => bool list list)
|
|
2871 |
([]::bool list) ([]::bool list list)))
|
|
2872 |
((All::(bool list list => bool) => bool)
|
|
2873 |
(%l1::bool list list.
|
|
2874 |
(All::(bool list list => bool) => bool)
|
|
2875 |
(%l2::bool list list.
|
|
2876 |
(op -->::bool => bool => bool)
|
|
2877 |
((op &::bool => bool => bool)
|
|
2878 |
((alg_cover_set::bool list list => bool) l1)
|
|
2879 |
((op &::bool => bool => bool)
|
|
2880 |
((alg_cover_set::bool list list => bool) l2)
|
|
2881 |
((op &::bool => bool => bool) (P l1)
|
|
2882 |
((op &::bool => bool => bool) (P l2)
|
|
2883 |
((alg_cover_set::bool list list => bool)
|
|
2884 |
((op @::bool list list
|
|
2885 |
=> bool list list => bool list list)
|
|
2886 |
((map::(bool list => bool list)
|
|
2887 |
=> bool list list => bool list list)
|
|
2888 |
((op #::bool => bool list => bool list)
|
|
2889 |
(True::bool))
|
|
2890 |
l1)
|
|
2891 |
((map::(bool list => bool list)
|
|
2892 |
=> bool list list => bool list list)
|
|
2893 |
((op #::bool => bool list => bool list)
|
|
2894 |
(False::bool))
|
|
2895 |
l2)))))))
|
|
2896 |
(P ((op @::bool list list
|
|
2897 |
=> bool list list => bool list list)
|
|
2898 |
((map::(bool list => bool list)
|
|
2899 |
=> bool list list => bool list list)
|
|
2900 |
((op #::bool => bool list => bool list)
|
|
2901 |
(True::bool))
|
|
2902 |
l1)
|
|
2903 |
((map::(bool list => bool list)
|
|
2904 |
=> bool list list => bool list list)
|
|
2905 |
((op #::bool => bool list => bool list)
|
|
2906 |
(False::bool))
|
|
2907 |
l2)))))))
|
|
2908 |
((All::(bool list list => bool) => bool)
|
|
2909 |
(%l::bool list list.
|
|
2910 |
(op -->::bool => bool => bool)
|
|
2911 |
((alg_cover_set::bool list list => bool) l) (P l))))"
|
|
2912 |
by (import prob_indep ALG_COVER_SET_INDUCTION)
|
|
2913 |
|
|
2914 |
lemma ALG_COVER_EXISTS_UNIQUE: "(All::(bool list list => bool) => bool)
|
|
2915 |
(%l::bool list list.
|
|
2916 |
(op -->::bool => bool => bool)
|
|
2917 |
((alg_cover_set::bool list list => bool) l)
|
|
2918 |
((All::((nat => bool) => bool) => bool)
|
|
2919 |
(%s::nat => bool.
|
|
2920 |
(Ex1::(bool list => bool) => bool)
|
|
2921 |
(%x::bool list.
|
|
2922 |
(op &::bool => bool => bool)
|
|
2923 |
((op mem::bool list => bool list list => bool) x l)
|
|
2924 |
((alg_embed::bool list => (nat => bool) => bool) x s)))))"
|
|
2925 |
by (import prob_indep ALG_COVER_EXISTS_UNIQUE)
|
|
2926 |
|
|
2927 |
lemma ALG_COVER_UNIQUE: "(All::(bool list list => bool) => bool)
|
|
2928 |
(%l::bool list list.
|
|
2929 |
(All::(bool list => bool) => bool)
|
|
2930 |
(%x::bool list.
|
|
2931 |
(All::((nat => bool) => bool) => bool)
|
|
2932 |
(%s::nat => bool.
|
|
2933 |
(op -->::bool => bool => bool)
|
|
2934 |
((op &::bool => bool => bool)
|
|
2935 |
((alg_cover_set::bool list list => bool) l)
|
|
2936 |
((op &::bool => bool => bool)
|
|
2937 |
((op mem::bool list => bool list list => bool) x l)
|
|
2938 |
((alg_embed::bool list => (nat => bool) => bool) x s)))
|
|
2939 |
((op =::bool list => bool list => bool)
|
|
2940 |
((alg_cover::bool list list => (nat => bool) => bool list)
|
|
2941 |
l s)
|
|
2942 |
x))))"
|
|
2943 |
by (import prob_indep ALG_COVER_UNIQUE)
|
|
2944 |
|
|
2945 |
lemma ALG_COVER_STEP: "(All::(bool list list => bool) => bool)
|
|
2946 |
(%l1::bool list list.
|
|
2947 |
(All::(bool list list => bool) => bool)
|
|
2948 |
(%l2::bool list list.
|
|
2949 |
(All::(bool => bool) => bool)
|
|
2950 |
(%h::bool.
|
|
2951 |
(All::((nat => bool) => bool) => bool)
|
|
2952 |
(%t::nat => bool.
|
|
2953 |
(op -->::bool => bool => bool)
|
|
2954 |
((op &::bool => bool => bool)
|
|
2955 |
((alg_cover_set::bool list list => bool) l1)
|
|
2956 |
((alg_cover_set::bool list list => bool) l2))
|
|
2957 |
((op =::bool list => bool list => bool)
|
|
2958 |
((alg_cover::bool list list
|
|
2959 |
=> (nat => bool) => bool list)
|
|
2960 |
((op @::bool list list
|
|
2961 |
=> bool list list => bool list list)
|
|
2962 |
((map::(bool list => bool list)
|
|
2963 |
=> bool list list => bool list list)
|
|
2964 |
((op #::bool => bool list => bool list)
|
|
2965 |
(True::bool))
|
|
2966 |
l1)
|
|
2967 |
((map::(bool list => bool list)
|
|
2968 |
=> bool list list => bool list list)
|
|
2969 |
((op #::bool => bool list => bool list)
|
|
2970 |
(False::bool))
|
|
2971 |
l2))
|
|
2972 |
((SCONS::bool => (nat => bool) => nat => bool) h
|
|
2973 |
t))
|
|
2974 |
((If::bool => bool list => bool list => bool list) h
|
|
2975 |
((op #::bool => bool list => bool list)
|
|
2976 |
(True::bool)
|
|
2977 |
((alg_cover::bool list list
|
|
2978 |
=> (nat => bool) => bool list)
|
|
2979 |
l1 t))
|
|
2980 |
((op #::bool => bool list => bool list)
|
|
2981 |
(False::bool)
|
|
2982 |
((alg_cover::bool list list
|
|
2983 |
=> (nat => bool) => bool list)
|
|
2984 |
l2 t))))))))"
|
|
2985 |
by (import prob_indep ALG_COVER_STEP)
|
|
2986 |
|
|
2987 |
lemma ALG_COVER_HEAD: "(All::(bool list list => bool) => bool)
|
|
2988 |
(%l::bool list list.
|
|
2989 |
(op -->::bool => bool => bool)
|
|
2990 |
((alg_cover_set::bool list list => bool) l)
|
|
2991 |
((All::((bool list => bool) => bool) => bool)
|
|
2992 |
(%f::bool list => bool.
|
|
2993 |
(op =::((nat => bool) => bool)
|
|
2994 |
=> ((nat => bool) => bool) => bool)
|
|
2995 |
((op o::(bool list => bool)
|
|
2996 |
=> ((nat => bool) => bool list)
|
|
2997 |
=> (nat => bool) => bool)
|
|
2998 |
f ((alg_cover::bool list list => (nat => bool) => bool list)
|
|
2999 |
l))
|
|
3000 |
((algebra_embed::bool list list => (nat => bool) => bool)
|
|
3001 |
((filter::(bool list => bool)
|
|
3002 |
=> bool list list => bool list list)
|
|
3003 |
f l)))))"
|
|
3004 |
by (import prob_indep ALG_COVER_HEAD)
|
|
3005 |
|
|
3006 |
lemma ALG_COVER_TAIL_STEP: "(All::(bool list list => bool) => bool)
|
|
3007 |
(%l1::bool list list.
|
|
3008 |
(All::(bool list list => bool) => bool)
|
|
3009 |
(%l2::bool list list.
|
|
3010 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
3011 |
(%q::(nat => bool) => bool.
|
|
3012 |
(op -->::bool => bool => bool)
|
|
3013 |
((op &::bool => bool => bool)
|
|
3014 |
((alg_cover_set::bool list list => bool) l1)
|
|
3015 |
((alg_cover_set::bool list list => bool) l2))
|
|
3016 |
((op =::((nat => bool) => bool)
|
|
3017 |
=> ((nat => bool) => bool) => bool)
|
|
3018 |
((op o::((nat => bool) => bool)
|
|
3019 |
=> ((nat => bool) => nat => bool)
|
|
3020 |
=> (nat => bool) => bool)
|
|
3021 |
q (%x::nat => bool.
|
|
3022 |
(SDROP::nat => (nat => bool) => nat => bool)
|
|
3023 |
((size::bool list => nat)
|
|
3024 |
((alg_cover::bool list list
|
|
3025 |
=> (nat => bool) => bool list)
|
|
3026 |
((op @::bool list list
|
|
3027 |
=> bool list list => bool list list)
|
|
3028 |
((map::(bool list => bool list)
|
|
3029 |
=> bool list list => bool list list)
|
|
3030 |
((op #::bool => bool list => bool list)
|
|
3031 |
(True::bool))
|
|
3032 |
l1)
|
|
3033 |
((map::(bool list => bool list)
|
|
3034 |
=> bool list list => bool list list)
|
|
3035 |
((op #::bool => bool list => bool list)
|
|
3036 |
(False::bool))
|
|
3037 |
l2))
|
|
3038 |
x))
|
|
3039 |
x))
|
|
3040 |
((pred_set.UNION::((nat => bool) => bool)
|
|
3041 |
=> ((nat => bool) => bool)
|
|
3042 |
=> (nat => bool) => bool)
|
|
3043 |
((pred_set.INTER::((nat => bool) => bool)
|
|
3044 |
=> ((nat => bool) => bool) => (nat => bool) => bool)
|
|
3045 |
(%x::nat => bool.
|
|
3046 |
(op =::bool => bool => bool)
|
|
3047 |
((SHD::(nat => bool) => bool) x) (True::bool))
|
|
3048 |
((op o::((nat => bool) => bool)
|
|
3049 |
=> ((nat => bool) => nat => bool)
|
|
3050 |
=> (nat => bool) => bool)
|
|
3051 |
q ((op o::((nat => bool) => nat => bool)
|
|
3052 |
=> ((nat => bool) => nat => bool)
|
|
3053 |
=> (nat => bool) => nat => bool)
|
|
3054 |
(%x::nat => bool.
|
|
3055 |
(SDROP::nat => (nat => bool) => nat => bool)
|
|
3056 |
((size::bool list => nat)
|
|
3057 |
((alg_cover::bool list list
|
|
3058 |
=> (nat => bool) => bool list)
|
|
3059 |
l1 x))
|
|
3060 |
x)
|
|
3061 |
(STL::(nat => bool) => nat => bool))))
|
|
3062 |
((pred_set.INTER::((nat => bool) => bool)
|
|
3063 |
=> ((nat => bool) => bool) => (nat => bool) => bool)
|
|
3064 |
(%x::nat => bool.
|
|
3065 |
(op =::bool => bool => bool)
|
|
3066 |
((SHD::(nat => bool) => bool) x) (False::bool))
|
|
3067 |
((op o::((nat => bool) => bool)
|
|
3068 |
=> ((nat => bool) => nat => bool)
|
|
3069 |
=> (nat => bool) => bool)
|
|
3070 |
q ((op o::((nat => bool) => nat => bool)
|
|
3071 |
=> ((nat => bool) => nat => bool)
|
|
3072 |
=> (nat => bool) => nat => bool)
|
|
3073 |
(%x::nat => bool.
|
|
3074 |
(SDROP::nat => (nat => bool) => nat => bool)
|
|
3075 |
((size::bool list => nat)
|
|
3076 |
((alg_cover::bool list list
|
|
3077 |
=> (nat => bool) => bool list)
|
|
3078 |
l2 x))
|
|
3079 |
x)
|
|
3080 |
(STL::(nat => bool) => nat => bool)))))))))"
|
|
3081 |
by (import prob_indep ALG_COVER_TAIL_STEP)
|
|
3082 |
|
|
3083 |
lemma ALG_COVER_TAIL_MEASURABLE: "(All::(bool list list => bool) => bool)
|
|
3084 |
(%l::bool list list.
|
|
3085 |
(op -->::bool => bool => bool)
|
|
3086 |
((alg_cover_set::bool list list => bool) l)
|
|
3087 |
((All::(((nat => bool) => bool) => bool) => bool)
|
|
3088 |
(%q::(nat => bool) => bool.
|
|
3089 |
(op =::bool => bool => bool)
|
|
3090 |
((measurable::((nat => bool) => bool) => bool)
|
|
3091 |
((op o::((nat => bool) => bool)
|
|
3092 |
=> ((nat => bool) => nat => bool)
|
|
3093 |
=> (nat => bool) => bool)
|
|
3094 |
q (%x::nat => bool.
|
|
3095 |
(SDROP::nat => (nat => bool) => nat => bool)
|
|
3096 |
((size::bool list => nat)
|
|
3097 |
((alg_cover::bool list list
|
|
3098 |
=> (nat => bool) => bool list)
|
|
3099 |
l x))
|
|
3100 |
x)))
|
|
3101 |
((measurable::((nat => bool) => bool) => bool) q))))"
|
|
3102 |
by (import prob_indep ALG_COVER_TAIL_MEASURABLE)
|
|
3103 |
|
|
3104 |
lemma ALG_COVER_TAIL_PROB: "(All::(bool list list => bool) => bool)
|
|
3105 |
(%l::bool list list.
|
|
3106 |
(op -->::bool => bool => bool)
|
|
3107 |
((alg_cover_set::bool list list => bool) l)
|
|
3108 |
((All::(((nat => bool) => bool) => bool) => bool)
|
|
3109 |
(%q::(nat => bool) => bool.
|
|
3110 |
(op -->::bool => bool => bool)
|
|
3111 |
((measurable::((nat => bool) => bool) => bool) q)
|
|
3112 |
((op =::real => real => bool)
|
|
3113 |
((prob::((nat => bool) => bool) => real)
|
|
3114 |
((op o::((nat => bool) => bool)
|
|
3115 |
=> ((nat => bool) => nat => bool)
|
|
3116 |
=> (nat => bool) => bool)
|
|
3117 |
q (%x::nat => bool.
|
|
3118 |
(SDROP::nat => (nat => bool) => nat => bool)
|
|
3119 |
((size::bool list => nat)
|
|
3120 |
((alg_cover::bool list list
|
|
3121 |
=> (nat => bool) => bool list)
|
|
3122 |
l x))
|
|
3123 |
x)))
|
|
3124 |
((prob::((nat => bool) => bool) => real) q)))))"
|
|
3125 |
by (import prob_indep ALG_COVER_TAIL_PROB)
|
|
3126 |
|
|
3127 |
lemma INDEP_INDEP_SET_LEMMA: "(All::(bool list list => bool) => bool)
|
|
3128 |
(%l::bool list list.
|
|
3129 |
(op -->::bool => bool => bool)
|
|
3130 |
((alg_cover_set::bool list list => bool) l)
|
|
3131 |
((All::(((nat => bool) => bool) => bool) => bool)
|
|
3132 |
(%q::(nat => bool) => bool.
|
|
3133 |
(op -->::bool => bool => bool)
|
|
3134 |
((measurable::((nat => bool) => bool) => bool) q)
|
|
3135 |
((All::(bool list => bool) => bool)
|
|
3136 |
(%x::bool list.
|
|
3137 |
(op -->::bool => bool => bool)
|
|
3138 |
((op mem::bool list => bool list list => bool) x l)
|
|
3139 |
((op =::real => real => bool)
|
|
3140 |
((prob::((nat => bool) => bool) => real)
|
|
3141 |
((pred_set.INTER::((nat => bool) => bool)
|
|
3142 |
=> ((nat => bool) => bool) => (nat => bool) => bool)
|
|
3143 |
((alg_embed::bool list => (nat => bool) => bool)
|
|
3144 |
x)
|
|
3145 |
((op o::((nat => bool) => bool)
|
|
3146 |
=> ((nat => bool) => nat => bool)
|
|
3147 |
=> (nat => bool) => bool)
|
|
3148 |
q (%x::nat => bool.
|
|
3149 |
(SDROP::nat
|
|
3150 |
=> (nat => bool) => nat => bool)
|
|
3151 |
((size::bool list => nat)
|
|
3152 |
((alg_cover::bool list list
|
|
3153 |
=> (nat => bool) => bool list)
|
|
3154 |
l x))
|
|
3155 |
x))))
|
|
3156 |
((op *::real => real => real)
|
|
3157 |
((op ^::real => nat => real)
|
|
3158 |
((op /::real => real => real) (1::real)
|
|
3159 |
((number_of::bin => real)
|
15647
|
3160 |
((op BIT::bin => bit => bin)
|
|
3161 |
((op BIT::bin => bit => bin)
|
|
3162 |
(Numeral.Pls::bin) (bit.B1::bit))
|
|
3163 |
(bit.B0::bit))))
|
14516
|
3164 |
((size::bool list => nat) x))
|
|
3165 |
((prob::((nat => bool) => bool) => real) q))))))))"
|
|
3166 |
by (import prob_indep INDEP_INDEP_SET_LEMMA)
|
|
3167 |
|
|
3168 |
lemma INDEP_SET_LIST: "(All::(((nat => bool) => bool) => bool) => bool)
|
|
3169 |
(%q::(nat => bool) => bool.
|
|
3170 |
(All::(bool list list => bool) => bool)
|
|
3171 |
(%l::bool list list.
|
|
3172 |
(op -->::bool => bool => bool)
|
|
3173 |
((op &::bool => bool => bool)
|
|
3174 |
((alg_sorted::bool list list => bool) l)
|
|
3175 |
((op &::bool => bool => bool)
|
|
3176 |
((alg_prefixfree::bool list list => bool) l)
|
|
3177 |
((op &::bool => bool => bool)
|
|
3178 |
((measurable::((nat => bool) => bool) => bool) q)
|
|
3179 |
((All::(bool list => bool) => bool)
|
|
3180 |
(%x::bool list.
|
|
3181 |
(op -->::bool => bool => bool)
|
|
3182 |
((op mem::bool list => bool list list => bool) x l)
|
|
3183 |
((indep_set::((nat => bool) => bool)
|
|
3184 |
=> ((nat => bool) => bool) => bool)
|
|
3185 |
((alg_embed::bool list => (nat => bool) => bool)
|
|
3186 |
x)
|
|
3187 |
q))))))
|
|
3188 |
((indep_set::((nat => bool) => bool)
|
|
3189 |
=> ((nat => bool) => bool) => bool)
|
|
3190 |
((algebra_embed::bool list list => (nat => bool) => bool) l)
|
|
3191 |
q)))"
|
|
3192 |
by (import prob_indep INDEP_SET_LIST)
|
|
3193 |
|
|
3194 |
lemma INDEP_INDEP_SET: "(All::(((nat => bool) => 'a * (nat => bool)) => bool) => bool)
|
|
3195 |
(%f::(nat => bool) => 'a * (nat => bool).
|
|
3196 |
(All::(('a => bool) => bool) => bool)
|
|
3197 |
(%p::'a => bool.
|
|
3198 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
3199 |
(%q::(nat => bool) => bool.
|
|
3200 |
(op -->::bool => bool => bool)
|
|
3201 |
((op &::bool => bool => bool)
|
|
3202 |
((indep::((nat => bool) => 'a * (nat => bool)) => bool) f)
|
|
3203 |
((measurable::((nat => bool) => bool) => bool) q))
|
|
3204 |
((indep_set::((nat => bool) => bool)
|
|
3205 |
=> ((nat => bool) => bool) => bool)
|
|
3206 |
((op o::('a => bool)
|
|
3207 |
=> ((nat => bool) => 'a) => (nat => bool) => bool)
|
|
3208 |
p ((op o::('a * (nat => bool) => 'a)
|
|
3209 |
=> ((nat => bool) => 'a * (nat => bool))
|
|
3210 |
=> (nat => bool) => 'a)
|
|
3211 |
(fst::'a * (nat => bool) => 'a) f))
|
|
3212 |
((op o::((nat => bool) => bool)
|
|
3213 |
=> ((nat => bool) => nat => bool)
|
|
3214 |
=> (nat => bool) => bool)
|
|
3215 |
q ((op o::('a * (nat => bool) => nat => bool)
|
|
3216 |
=> ((nat => bool) => 'a * (nat => bool))
|
|
3217 |
=> (nat => bool) => nat => bool)
|
|
3218 |
(snd::'a * (nat => bool) => nat => bool) f))))))"
|
|
3219 |
by (import prob_indep INDEP_INDEP_SET)
|
|
3220 |
|
|
3221 |
lemma INDEP_UNIT: "ALL x. indep (UNIT x)"
|
|
3222 |
by (import prob_indep INDEP_UNIT)
|
|
3223 |
|
|
3224 |
lemma INDEP_SDEST: "indep SDEST"
|
|
3225 |
by (import prob_indep INDEP_SDEST)
|
|
3226 |
|
|
3227 |
lemma BIND_STEP: "ALL f. BIND SDEST (%k. f o SCONS k) = f"
|
|
3228 |
by (import prob_indep BIND_STEP)
|
|
3229 |
|
|
3230 |
lemma INDEP_BIND_SDEST: "(All::((bool => (nat => bool) => 'a * (nat => bool)) => bool) => bool)
|
|
3231 |
(%f::bool => (nat => bool) => 'a * (nat => bool).
|
|
3232 |
(op -->::bool => bool => bool)
|
|
3233 |
((All::(bool => bool) => bool)
|
|
3234 |
(%x::bool.
|
|
3235 |
(indep::((nat => bool) => 'a * (nat => bool)) => bool) (f x)))
|
|
3236 |
((indep::((nat => bool) => 'a * (nat => bool)) => bool)
|
|
3237 |
((BIND::((nat => bool) => bool * (nat => bool))
|
|
3238 |
=> (bool => (nat => bool) => 'a * (nat => bool))
|
|
3239 |
=> (nat => bool) => 'a * (nat => bool))
|
|
3240 |
(SDEST::(nat => bool) => bool * (nat => bool)) f)))"
|
|
3241 |
by (import prob_indep INDEP_BIND_SDEST)
|
|
3242 |
|
|
3243 |
lemma INDEP_BIND: "(All::(((nat => bool) => 'a * (nat => bool)) => bool) => bool)
|
|
3244 |
(%f::(nat => bool) => 'a * (nat => bool).
|
|
3245 |
(All::(('a => (nat => bool) => 'b * (nat => bool)) => bool) => bool)
|
|
3246 |
(%g::'a => (nat => bool) => 'b * (nat => bool).
|
|
3247 |
(op -->::bool => bool => bool)
|
|
3248 |
((op &::bool => bool => bool)
|
|
3249 |
((indep::((nat => bool) => 'a * (nat => bool)) => bool) f)
|
|
3250 |
((All::('a => bool) => bool)
|
|
3251 |
(%x::'a.
|
|
3252 |
(indep::((nat => bool) => 'b * (nat => bool)) => bool)
|
|
3253 |
(g x))))
|
|
3254 |
((indep::((nat => bool) => 'b * (nat => bool)) => bool)
|
|
3255 |
((BIND::((nat => bool) => 'a * (nat => bool))
|
|
3256 |
=> ('a => (nat => bool) => 'b * (nat => bool))
|
|
3257 |
=> (nat => bool) => 'b * (nat => bool))
|
|
3258 |
f g))))"
|
|
3259 |
by (import prob_indep INDEP_BIND)
|
|
3260 |
|
|
3261 |
lemma INDEP_PROB: "(All::(((nat => bool) => 'a * (nat => bool)) => bool) => bool)
|
|
3262 |
(%f::(nat => bool) => 'a * (nat => bool).
|
|
3263 |
(All::(('a => bool) => bool) => bool)
|
|
3264 |
(%p::'a => bool.
|
|
3265 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
3266 |
(%q::(nat => bool) => bool.
|
|
3267 |
(op -->::bool => bool => bool)
|
|
3268 |
((op &::bool => bool => bool)
|
|
3269 |
((indep::((nat => bool) => 'a * (nat => bool)) => bool) f)
|
|
3270 |
((measurable::((nat => bool) => bool) => bool) q))
|
|
3271 |
((op =::real => real => bool)
|
|
3272 |
((prob::((nat => bool) => bool) => real)
|
|
3273 |
((pred_set.INTER::((nat => bool) => bool)
|
|
3274 |
=> ((nat => bool) => bool) => (nat => bool) => bool)
|
|
3275 |
((op o::('a => bool)
|
|
3276 |
=> ((nat => bool) => 'a)
|
|
3277 |
=> (nat => bool) => bool)
|
|
3278 |
p ((op o::('a * (nat => bool) => 'a)
|
|
3279 |
=> ((nat => bool) => 'a * (nat => bool))
|
|
3280 |
=> (nat => bool) => 'a)
|
|
3281 |
(fst::'a * (nat => bool) => 'a) f))
|
|
3282 |
((op o::((nat => bool) => bool)
|
|
3283 |
=> ((nat => bool) => nat => bool)
|
|
3284 |
=> (nat => bool) => bool)
|
|
3285 |
q ((op o::('a * (nat => bool) => nat => bool)
|
|
3286 |
=> ((nat => bool) => 'a * (nat => bool))
|
|
3287 |
=> (nat => bool) => nat => bool)
|
|
3288 |
(snd::'a * (nat => bool) => nat => bool) f))))
|
|
3289 |
((op *::real => real => real)
|
|
3290 |
((prob::((nat => bool) => bool) => real)
|
|
3291 |
((op o::('a => bool)
|
|
3292 |
=> ((nat => bool) => 'a)
|
|
3293 |
=> (nat => bool) => bool)
|
|
3294 |
p ((op o::('a * (nat => bool) => 'a)
|
|
3295 |
=> ((nat => bool) => 'a * (nat => bool))
|
|
3296 |
=> (nat => bool) => 'a)
|
|
3297 |
(fst::'a * (nat => bool) => 'a) f)))
|
|
3298 |
((prob::((nat => bool) => bool) => real) q))))))"
|
|
3299 |
by (import prob_indep INDEP_PROB)
|
|
3300 |
|
|
3301 |
lemma INDEP_MEASURABLE1: "(All::(((nat => bool) => 'a * (nat => bool)) => bool) => bool)
|
|
3302 |
(%f::(nat => bool) => 'a * (nat => bool).
|
|
3303 |
(All::(('a => bool) => bool) => bool)
|
|
3304 |
(%p::'a => bool.
|
|
3305 |
(op -->::bool => bool => bool)
|
|
3306 |
((indep::((nat => bool) => 'a * (nat => bool)) => bool) f)
|
|
3307 |
((measurable::((nat => bool) => bool) => bool)
|
|
3308 |
((op o::('a => bool)
|
|
3309 |
=> ((nat => bool) => 'a) => (nat => bool) => bool)
|
|
3310 |
p ((op o::('a * (nat => bool) => 'a)
|
|
3311 |
=> ((nat => bool) => 'a * (nat => bool))
|
|
3312 |
=> (nat => bool) => 'a)
|
|
3313 |
(fst::'a * (nat => bool) => 'a) f)))))"
|
|
3314 |
by (import prob_indep INDEP_MEASURABLE1)
|
|
3315 |
|
|
3316 |
lemma INDEP_MEASURABLE2: "(All::(((nat => bool) => 'a * (nat => bool)) => bool) => bool)
|
|
3317 |
(%f::(nat => bool) => 'a * (nat => bool).
|
|
3318 |
(All::(((nat => bool) => bool) => bool) => bool)
|
|
3319 |
(%q::(nat => bool) => bool.
|
|
3320 |
(op -->::bool => bool => bool)
|
|
3321 |
((op &::bool => bool => bool)
|
|
3322 |
((indep::((nat => bool) => 'a * (nat => bool)) => bool) f)
|
|
3323 |
((measurable::((nat => bool) => bool) => bool) q))
|
|
3324 |
((measurable::((nat => bool) => bool) => bool)
|
|
3325 |
((op o::((nat => bool) => bool)
|
|
3326 |
=> ((nat => bool) => nat => bool)
|
|
3327 |
=> (nat => bool) => bool)
|
|
3328 |
q ((op o::('a * (nat => bool) => nat => bool)
|
|
3329 |
=> ((nat => bool) => 'a * (nat => bool))
|
|
3330 |
=> (nat => bool) => nat => bool)
|
|
3331 |
(snd::'a * (nat => bool) => nat => bool) f)))))"
|
|
3332 |
by (import prob_indep INDEP_MEASURABLE2)
|
|
3333 |
|
|
3334 |
lemma PROB_INDEP_BOUND: "(All::(((nat => bool) => nat * (nat => bool)) => bool) => bool)
|
|
3335 |
(%f::(nat => bool) => nat * (nat => bool).
|
|
3336 |
(All::(nat => bool) => bool)
|
|
3337 |
(%n::nat.
|
|
3338 |
(op -->::bool => bool => bool)
|
|
3339 |
((indep::((nat => bool) => nat * (nat => bool)) => bool) f)
|
|
3340 |
((op =::real => real => bool)
|
|
3341 |
((prob::((nat => bool) => bool) => real)
|
|
3342 |
(%s::nat => bool.
|
|
3343 |
(op <::nat => nat => bool)
|
|
3344 |
((fst::nat * (nat => bool) => nat) (f s))
|
|
3345 |
((Suc::nat => nat) n)))
|
|
3346 |
((op +::real => real => real)
|
|
3347 |
((prob::((nat => bool) => bool) => real)
|
|
3348 |
(%s::nat => bool.
|
|
3349 |
(op <::nat => nat => bool)
|
|
3350 |
((fst::nat * (nat => bool) => nat) (f s)) n))
|
|
3351 |
((prob::((nat => bool) => bool) => real)
|
|
3352 |
(%s::nat => bool.
|
|
3353 |
(op =::nat => nat => bool)
|
|
3354 |
((fst::nat * (nat => bool) => nat) (f s)) n))))))"
|
|
3355 |
by (import prob_indep PROB_INDEP_BOUND)
|
|
3356 |
|
|
3357 |
;end_setup
|
|
3358 |
|
|
3359 |
;setup_theory prob_uniform
|
|
3360 |
|
|
3361 |
consts
|
|
3362 |
unif_bound :: "nat => nat"
|
|
3363 |
|
|
3364 |
defs
|
|
3365 |
unif_bound_primdef: "unif_bound ==
|
|
3366 |
WFREC (SOME R. WF R & (ALL v. R (Suc v div 2) (Suc v)))
|
|
3367 |
(%unif_bound. nat_case 0 (%v1. Suc (unif_bound (Suc v1 div 2))))"
|
|
3368 |
|
|
3369 |
lemma unif_bound_primitive_def: "unif_bound =
|
|
3370 |
WFREC (SOME R. WF R & (ALL v. R (Suc v div 2) (Suc v)))
|
|
3371 |
(%unif_bound. nat_case 0 (%v1. Suc (unif_bound (Suc v1 div 2))))"
|
|
3372 |
by (import prob_uniform unif_bound_primitive_def)
|
|
3373 |
|
|
3374 |
lemma unif_bound_def: "unif_bound 0 = 0 & unif_bound (Suc v) = Suc (unif_bound (Suc v div 2))"
|
|
3375 |
by (import prob_uniform unif_bound_def)
|
|
3376 |
|
|
3377 |
lemma unif_bound_ind: "(All::((nat => bool) => bool) => bool)
|
|
3378 |
(%P::nat => bool.
|
|
3379 |
(op -->::bool => bool => bool)
|
|
3380 |
((op &::bool => bool => bool) (P (0::nat))
|
|
3381 |
((All::(nat => bool) => bool)
|
|
3382 |
(%v::nat.
|
|
3383 |
(op -->::bool => bool => bool)
|
|
3384 |
(P ((op div::nat => nat => nat) ((Suc::nat => nat) v)
|
|
3385 |
((number_of::bin => nat)
|
15647
|
3386 |
((op BIT::bin => bit => bin)
|
|
3387 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
3388 |
(bit.B1::bit))
|
|
3389 |
(bit.B0::bit)))))
|
14516
|
3390 |
(P ((Suc::nat => nat) v)))))
|
|
3391 |
((All::(nat => bool) => bool) P))"
|
|
3392 |
by (import prob_uniform unif_bound_ind)
|
|
3393 |
|
|
3394 |
constdefs
|
|
3395 |
unif_tupled :: "nat * (nat => bool) => nat * (nat => bool)"
|
|
3396 |
"unif_tupled ==
|
|
3397 |
WFREC (SOME R. WF R & (ALL s v2. R (Suc v2 div 2, s) (Suc v2, s)))
|
|
3398 |
(%unif_tupled (v, v1).
|
|
3399 |
case v of 0 => (0, v1)
|
|
3400 |
| Suc v3 =>
|
|
3401 |
let (m, s') = unif_tupled (Suc v3 div 2, v1)
|
|
3402 |
in (if SHD s' then 2 * m + 1 else 2 * m, STL s'))"
|
|
3403 |
|
|
3404 |
lemma unif_tupled_primitive_def: "unif_tupled =
|
|
3405 |
WFREC (SOME R. WF R & (ALL s v2. R (Suc v2 div 2, s) (Suc v2, s)))
|
|
3406 |
(%unif_tupled (v, v1).
|
|
3407 |
case v of 0 => (0, v1)
|
|
3408 |
| Suc v3 =>
|
|
3409 |
let (m, s') = unif_tupled (Suc v3 div 2, v1)
|
|
3410 |
in (if SHD s' then 2 * m + 1 else 2 * m, STL s'))"
|
|
3411 |
by (import prob_uniform unif_tupled_primitive_def)
|
|
3412 |
|
|
3413 |
consts
|
|
3414 |
unif :: "nat => (nat => bool) => nat * (nat => bool)"
|
|
3415 |
|
|
3416 |
defs
|
|
3417 |
unif_primdef: "unif == %x x1. unif_tupled (x, x1)"
|
|
3418 |
|
|
3419 |
lemma unif_curried_def: "ALL x x1. unif x x1 = unif_tupled (x, x1)"
|
|
3420 |
by (import prob_uniform unif_curried_def)
|
|
3421 |
|
|
3422 |
lemma unif_def: "unif 0 s = (0, s) &
|
|
3423 |
unif (Suc v2) s =
|
|
3424 |
(let (m, s') = unif (Suc v2 div 2) s
|
|
3425 |
in (if SHD s' then 2 * m + 1 else 2 * m, STL s'))"
|
|
3426 |
by (import prob_uniform unif_def)
|
|
3427 |
|
|
3428 |
lemma unif_ind: "(All::((nat => (nat => bool) => bool) => bool) => bool)
|
|
3429 |
(%P::nat => (nat => bool) => bool.
|
|
3430 |
(op -->::bool => bool => bool)
|
|
3431 |
((op &::bool => bool => bool)
|
|
3432 |
((All::((nat => bool) => bool) => bool) (P (0::nat)))
|
|
3433 |
((All::(nat => bool) => bool)
|
|
3434 |
(%v2::nat.
|
|
3435 |
(All::((nat => bool) => bool) => bool)
|
|
3436 |
(%s::nat => bool.
|
|
3437 |
(op -->::bool => bool => bool)
|
|
3438 |
(P ((op div::nat => nat => nat) ((Suc::nat => nat) v2)
|
|
3439 |
((number_of::bin => nat)
|
15647
|
3440 |
((op BIT::bin => bit => bin)
|
|
3441 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
3442 |
(bit.B1::bit))
|
|
3443 |
(bit.B0::bit))))
|
14516
|
3444 |
s)
|
|
3445 |
(P ((Suc::nat => nat) v2) s)))))
|
|
3446 |
((All::(nat => bool) => bool)
|
|
3447 |
(%v::nat. (All::((nat => bool) => bool) => bool) (P v))))"
|
|
3448 |
by (import prob_uniform unif_ind)
|
|
3449 |
|
|
3450 |
constdefs
|
|
3451 |
uniform_tupled :: "nat * nat * (nat => bool) => nat * (nat => bool)"
|
|
3452 |
"(op ==::(nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3453 |
=> (nat * nat * (nat => bool) => nat * (nat => bool)) => prop)
|
|
3454 |
(uniform_tupled::nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3455 |
((WFREC::(nat * nat * (nat => bool) => nat * nat * (nat => bool) => bool)
|
|
3456 |
=> ((nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3457 |
=> nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3458 |
=> nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3459 |
((Eps::((nat * nat * (nat => bool) => nat * nat * (nat => bool) => bool)
|
|
3460 |
=> bool)
|
|
3461 |
=> nat * nat * (nat => bool) => nat * nat * (nat => bool) => bool)
|
|
3462 |
(%R::nat * nat * (nat => bool) => nat * nat * (nat => bool) => bool.
|
|
3463 |
(op &::bool => bool => bool)
|
|
3464 |
((WF::(nat * nat * (nat => bool)
|
|
3465 |
=> nat * nat * (nat => bool) => bool)
|
|
3466 |
=> bool)
|
|
3467 |
R)
|
|
3468 |
((All::(nat => bool) => bool)
|
|
3469 |
(%t::nat.
|
|
3470 |
(All::((nat => bool) => bool) => bool)
|
|
3471 |
(%s::nat => bool.
|
|
3472 |
(All::(nat => bool) => bool)
|
|
3473 |
(%n::nat.
|
|
3474 |
(All::(nat => bool) => bool)
|
|
3475 |
(%res::nat.
|
|
3476 |
(All::((nat => bool) => bool) => bool)
|
|
3477 |
(%s'::nat => bool.
|
|
3478 |
(op -->::bool => bool => bool)
|
|
3479 |
((op &::bool => bool => bool)
|
|
3480 |
((op =::nat * (nat => bool) => nat * (nat => bool) => bool)
|
|
3481 |
((Pair::nat => (nat => bool) => nat * (nat => bool)) res s')
|
|
3482 |
((unif::nat => (nat => bool) => nat * (nat => bool)) n s))
|
|
3483 |
((Not::bool => bool)
|
|
3484 |
((op <::nat => nat => bool) res ((Suc::nat => nat) n))))
|
|
3485 |
(R
|
|
3486 |
((Pair::nat => nat * (nat => bool) => nat * nat * (nat => bool)) t
|
|
3487 |
((Pair::nat => (nat => bool) => nat * (nat => bool))
|
|
3488 |
((Suc::nat => nat) n) s'))
|
|
3489 |
((Pair::nat => nat * (nat => bool) => nat * nat * (nat => bool))
|
|
3490 |
((Suc::nat => nat) t)
|
|
3491 |
((Pair::nat => (nat => bool) => nat * (nat => bool))
|
|
3492 |
((Suc::nat => nat) n) s)))))))))))
|
|
3493 |
(%uniform_tupled::nat * nat * (nat => bool) => nat * (nat => bool).
|
|
3494 |
(split::(nat => nat * (nat => bool) => nat * (nat => bool))
|
|
3495 |
=> nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3496 |
(%(v::nat) v1::nat * (nat => bool).
|
|
3497 |
(nat_case::nat * (nat => bool)
|
|
3498 |
=> (nat => nat * (nat => bool))
|
|
3499 |
=> nat => nat * (nat => bool))
|
|
3500 |
((split::(nat => (nat => bool) => nat * (nat => bool))
|
|
3501 |
=> nat * (nat => bool) => nat * (nat => bool))
|
|
3502 |
(%(v3::nat) v4::nat => bool.
|
|
3503 |
(nat_case::nat * (nat => bool)
|
|
3504 |
=> (nat => nat * (nat => bool))
|
|
3505 |
=> nat => nat * (nat => bool))
|
|
3506 |
(ARB::nat * (nat => bool))
|
|
3507 |
(%v5::nat.
|
|
3508 |
(Pair::nat => (nat => bool) => nat * (nat => bool))
|
|
3509 |
(0::nat) v4)
|
|
3510 |
v3)
|
|
3511 |
v1)
|
|
3512 |
(%v2::nat.
|
|
3513 |
(split::(nat => (nat => bool) => nat * (nat => bool))
|
|
3514 |
=> nat * (nat => bool) => nat * (nat => bool))
|
|
3515 |
(%(v7::nat) v8::nat => bool.
|
|
3516 |
(nat_case::nat * (nat => bool)
|
|
3517 |
=> (nat => nat * (nat => bool))
|
|
3518 |
=> nat => nat * (nat => bool))
|
|
3519 |
(ARB::nat * (nat => bool))
|
|
3520 |
(%v9::nat.
|
|
3521 |
(Let::nat * (nat => bool)
|
|
3522 |
=> (nat * (nat => bool)
|
|
3523 |
=> nat * (nat => bool))
|
|
3524 |
=> nat * (nat => bool))
|
|
3525 |
((unif::nat
|
|
3526 |
=> (nat => bool) => nat * (nat => bool))
|
|
3527 |
v9 v8)
|
|
3528 |
((split::(nat
|
|
3529 |
=> (nat => bool) => nat * (nat => bool))
|
|
3530 |
=> nat * (nat => bool)
|
|
3531 |
=> nat * (nat => bool))
|
|
3532 |
(%(res::nat) s'::nat => bool.
|
|
3533 |
(If::bool
|
|
3534 |
=> nat * (nat => bool) => nat * (nat => bool) => nat * (nat => bool))
|
|
3535 |
((op <::nat => nat => bool) res
|
|
3536 |
((Suc::nat => nat) v9))
|
|
3537 |
((Pair::nat
|
|
3538 |
=> (nat => bool) => nat * (nat => bool))
|
|
3539 |
res s')
|
|
3540 |
(uniform_tupled
|
|
3541 |
((Pair::nat
|
|
3542 |
=> nat * (nat => bool) => nat * nat * (nat => bool))
|
|
3543 |
v2 ((Pair::nat => (nat => bool) => nat * (nat => bool))
|
|
3544 |
((Suc::nat => nat) v9) s'))))))
|
|
3545 |
v7)
|
|
3546 |
v1)
|
|
3547 |
v)))"
|
|
3548 |
|
|
3549 |
lemma uniform_tupled_primitive_def: "(op =::(nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3550 |
=> (nat * nat * (nat => bool) => nat * (nat => bool)) => bool)
|
|
3551 |
(uniform_tupled::nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3552 |
((WFREC::(nat * nat * (nat => bool) => nat * nat * (nat => bool) => bool)
|
|
3553 |
=> ((nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3554 |
=> nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3555 |
=> nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3556 |
((Eps::((nat * nat * (nat => bool) => nat * nat * (nat => bool) => bool)
|
|
3557 |
=> bool)
|
|
3558 |
=> nat * nat * (nat => bool) => nat * nat * (nat => bool) => bool)
|
|
3559 |
(%R::nat * nat * (nat => bool) => nat * nat * (nat => bool) => bool.
|
|
3560 |
(op &::bool => bool => bool)
|
|
3561 |
((WF::(nat * nat * (nat => bool)
|
|
3562 |
=> nat * nat * (nat => bool) => bool)
|
|
3563 |
=> bool)
|
|
3564 |
R)
|
|
3565 |
((All::(nat => bool) => bool)
|
|
3566 |
(%t::nat.
|
|
3567 |
(All::((nat => bool) => bool) => bool)
|
|
3568 |
(%s::nat => bool.
|
|
3569 |
(All::(nat => bool) => bool)
|
|
3570 |
(%n::nat.
|
|
3571 |
(All::(nat => bool) => bool)
|
|
3572 |
(%res::nat.
|
|
3573 |
(All::((nat => bool) => bool) => bool)
|
|
3574 |
(%s'::nat => bool.
|
|
3575 |
(op -->::bool => bool => bool)
|
|
3576 |
((op &::bool => bool => bool)
|
|
3577 |
((op =::nat * (nat => bool) => nat * (nat => bool) => bool)
|
|
3578 |
((Pair::nat => (nat => bool) => nat * (nat => bool)) res s')
|
|
3579 |
((unif::nat => (nat => bool) => nat * (nat => bool)) n s))
|
|
3580 |
((Not::bool => bool)
|
|
3581 |
((op <::nat => nat => bool) res ((Suc::nat => nat) n))))
|
|
3582 |
(R
|
|
3583 |
((Pair::nat => nat * (nat => bool) => nat * nat * (nat => bool)) t
|
|
3584 |
((Pair::nat => (nat => bool) => nat * (nat => bool))
|
|
3585 |
((Suc::nat => nat) n) s'))
|
|
3586 |
((Pair::nat => nat * (nat => bool) => nat * nat * (nat => bool))
|
|
3587 |
((Suc::nat => nat) t)
|
|
3588 |
((Pair::nat => (nat => bool) => nat * (nat => bool))
|
|
3589 |
((Suc::nat => nat) n) s)))))))))))
|
|
3590 |
(%uniform_tupled::nat * nat * (nat => bool) => nat * (nat => bool).
|
|
3591 |
(split::(nat => nat * (nat => bool) => nat * (nat => bool))
|
|
3592 |
=> nat * nat * (nat => bool) => nat * (nat => bool))
|
|
3593 |
(%(v::nat) v1::nat * (nat => bool).
|
|
3594 |
(nat_case::nat * (nat => bool)
|
|
3595 |
=> (nat => nat * (nat => bool))
|
|
3596 |
=> nat => nat * (nat => bool))
|
|
3597 |
((split::(nat => (nat => bool) => nat * (nat => bool))
|
|
3598 |
=> nat * (nat => bool) => nat * (nat => bool))
|
|
3599 |
(%(v3::nat) v4::nat => bool.
|
|
3600 |
(nat_case::nat * (nat => bool)
|
|
3601 |
=> (nat => nat * (nat => bool))
|
|
3602 |
=> nat => nat * (nat => bool))
|
|
3603 |
(ARB::nat * (nat => bool))
|
|
3604 |
(%v5::nat.
|
|
3605 |
(Pair::nat => (nat => bool) => nat * (nat => bool))
|
|
3606 |
(0::nat) v4)
|
|
3607 |
v3)
|
|
3608 |
v1)
|
|
3609 |
(%v2::nat.
|
|
3610 |
(split::(nat => (nat => bool) => nat * (nat => bool))
|
|
3611 |
=> nat * (nat => bool) => nat * (nat => bool))
|
|
3612 |
(%(v7::nat) v8::nat => bool.
|
|
3613 |
(nat_case::nat * (nat => bool)
|
|
3614 |
=> (nat => nat * (nat => bool))
|
|
3615 |
=> nat => nat * (nat => bool))
|
|
3616 |
(ARB::nat * (nat => bool))
|
|
3617 |
(%v9::nat.
|
|
3618 |
(Let::nat * (nat => bool)
|
|
3619 |
=> (nat * (nat => bool)
|
|
3620 |
=> nat * (nat => bool))
|
|
3621 |
=> nat * (nat => bool))
|
|
3622 |
((unif::nat
|
|
3623 |
=> (nat => bool) => nat * (nat => bool))
|
|
3624 |
v9 v8)
|
|
3625 |
((split::(nat
|
|
3626 |
=> (nat => bool) => nat * (nat => bool))
|
|
3627 |
=> nat * (nat => bool)
|
|
3628 |
=> nat * (nat => bool))
|
|
3629 |
(%(res::nat) s'::nat => bool.
|
|
3630 |
(If::bool
|
|
3631 |
=> nat * (nat => bool) => nat * (nat => bool) => nat * (nat => bool))
|
|
3632 |
((op <::nat => nat => bool) res
|
|
3633 |
((Suc::nat => nat) v9))
|
|
3634 |
((Pair::nat
|
|
3635 |
=> (nat => bool) => nat * (nat => bool))
|
|
3636 |
res s')
|
|
3637 |
(uniform_tupled
|
|
3638 |
((Pair::nat
|
|
3639 |
=> nat * (nat => bool) => nat * nat * (nat => bool))
|
|
3640 |
v2 ((Pair::nat => (nat => bool) => nat * (nat => bool))
|
|
3641 |
((Suc::nat => nat) v9) s'))))))
|
|
3642 |
v7)
|
|
3643 |
v1)
|
|
3644 |
v)))"
|
|
3645 |
by (import prob_uniform uniform_tupled_primitive_def)
|
|
3646 |
|
|
3647 |
consts
|
|
3648 |
uniform :: "nat => nat => (nat => bool) => nat * (nat => bool)"
|
|
3649 |
|
|
3650 |
defs
|
|
3651 |
uniform_primdef: "uniform == %x x1 x2. uniform_tupled (x, x1, x2)"
|
|
3652 |
|
|
3653 |
lemma uniform_curried_def: "ALL x x1 x2. uniform x x1 x2 = uniform_tupled (x, x1, x2)"
|
|
3654 |
by (import prob_uniform uniform_curried_def)
|
|
3655 |
|
|
3656 |
lemma uniform_ind: "(All::((nat => nat => (nat => bool) => bool) => bool) => bool)
|
|
3657 |
(%P::nat => nat => (nat => bool) => bool.
|
|
3658 |
(op -->::bool => bool => bool)
|
|
3659 |
((op &::bool => bool => bool)
|
|
3660 |
((All::(nat => bool) => bool)
|
|
3661 |
(%x::nat.
|
|
3662 |
(All::((nat => bool) => bool) => bool)
|
|
3663 |
(P ((Suc::nat => nat) x) (0::nat))))
|
|
3664 |
((op &::bool => bool => bool)
|
|
3665 |
((All::((nat => bool) => bool) => bool) (P (0::nat) (0::nat)))
|
|
3666 |
((op &::bool => bool => bool)
|
|
3667 |
((All::(nat => bool) => bool)
|
|
3668 |
(%x::nat.
|
|
3669 |
(All::((nat => bool) => bool) => bool)
|
|
3670 |
(P (0::nat) ((Suc::nat => nat) x))))
|
|
3671 |
((All::(nat => bool) => bool)
|
|
3672 |
(%x::nat.
|
|
3673 |
(All::(nat => bool) => bool)
|
|
3674 |
(%xa::nat.
|
|
3675 |
(All::((nat => bool) => bool) => bool)
|
|
3676 |
(%xb::nat => bool.
|
|
3677 |
(op -->::bool => bool => bool)
|
|
3678 |
((All::(nat => bool) => bool)
|
|
3679 |
(%xc::nat.
|
|
3680 |
(All::((nat => bool) => bool) => bool)
|
|
3681 |
(%xd::nat => bool.
|
|
3682 |
(op -->::bool => bool => bool)
|
|
3683 |
((op &::bool => bool => bool)
|
|
3684 |
((op =::nat * (nat => bool) => nat * (nat => bool) => bool)
|
|
3685 |
((Pair::nat => (nat => bool) => nat * (nat => bool)) xc xd)
|
|
3686 |
((unif::nat => (nat => bool) => nat * (nat => bool)) xa xb))
|
|
3687 |
((Not::bool => bool)
|
|
3688 |
((op <::nat => nat => bool) xc ((Suc::nat => nat) xa))))
|
|
3689 |
(P x ((Suc::nat => nat) xa) xd))))
|
|
3690 |
(P ((Suc::nat => nat) x) ((Suc::nat => nat) xa)
|
|
3691 |
xb))))))))
|
|
3692 |
((All::(nat => bool) => bool)
|
|
3693 |
(%x::nat.
|
|
3694 |
(All::(nat => bool) => bool)
|
|
3695 |
(%xa::nat. (All::((nat => bool) => bool) => bool) (P x xa)))))"
|
|
3696 |
by (import prob_uniform uniform_ind)
|
|
3697 |
|
|
3698 |
lemma uniform_def: "uniform 0 (Suc n) s = (0, s) &
|
|
3699 |
uniform (Suc t) (Suc n) s =
|
|
3700 |
(let (xa, x) = unif n s
|
|
3701 |
in if xa < Suc n then (xa, x) else uniform t (Suc n) x)"
|
|
3702 |
by (import prob_uniform uniform_def)
|
|
3703 |
|
|
3704 |
lemma SUC_DIV_TWO_ZERO: "ALL n. (Suc n div 2 = 0) = (n = 0)"
|
|
3705 |
by (import prob_uniform SUC_DIV_TWO_ZERO)
|
|
3706 |
|
|
3707 |
lemma UNIF_BOUND_LOWER: "ALL n. n < 2 ^ unif_bound n"
|
|
3708 |
by (import prob_uniform UNIF_BOUND_LOWER)
|
|
3709 |
|
|
3710 |
lemma UNIF_BOUND_LOWER_SUC: "ALL n. Suc n <= 2 ^ unif_bound n"
|
|
3711 |
by (import prob_uniform UNIF_BOUND_LOWER_SUC)
|
|
3712 |
|
|
3713 |
lemma UNIF_BOUND_UPPER: "(All::(nat => bool) => bool)
|
|
3714 |
(%n::nat.
|
|
3715 |
(op -->::bool => bool => bool)
|
|
3716 |
((Not::bool => bool) ((op =::nat => nat => bool) n (0::nat)))
|
|
3717 |
((op <=::nat => nat => bool)
|
|
3718 |
((op ^::nat => nat => nat)
|
|
3719 |
((number_of::bin => nat)
|
15647
|
3720 |
((op BIT::bin => bit => bin)
|
|
3721 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin) (bit.B1::bit))
|
|
3722 |
(bit.B0::bit)))
|
14516
|
3723 |
((unif_bound::nat => nat) n))
|
|
3724 |
((op *::nat => nat => nat)
|
|
3725 |
((number_of::bin => nat)
|
15647
|
3726 |
((op BIT::bin => bit => bin)
|
|
3727 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin) (bit.B1::bit))
|
|
3728 |
(bit.B0::bit)))
|
14516
|
3729 |
n)))"
|
|
3730 |
by (import prob_uniform UNIF_BOUND_UPPER)
|
|
3731 |
|
|
3732 |
lemma UNIF_BOUND_UPPER_SUC: "ALL n. 2 ^ unif_bound n <= Suc (2 * n)"
|
|
3733 |
by (import prob_uniform UNIF_BOUND_UPPER_SUC)
|
|
3734 |
|
|
3735 |
lemma UNIF_DEF_MONAD: "unif 0 = UNIT 0 &
|
|
3736 |
(ALL n.
|
|
3737 |
unif (Suc n) =
|
|
3738 |
BIND (unif (Suc n div 2))
|
|
3739 |
(%m. BIND SDEST (%b. UNIT (if b then 2 * m + 1 else 2 * m))))"
|
|
3740 |
by (import prob_uniform UNIF_DEF_MONAD)
|
|
3741 |
|
|
3742 |
lemma UNIFORM_DEF_MONAD: "(ALL x. uniform 0 (Suc x) = UNIT 0) &
|
|
3743 |
(ALL x xa.
|
|
3744 |
uniform (Suc x) (Suc xa) =
|
|
3745 |
BIND (unif xa) (%m. if m < Suc xa then UNIT m else uniform x (Suc xa)))"
|
|
3746 |
by (import prob_uniform UNIFORM_DEF_MONAD)
|
|
3747 |
|
|
3748 |
lemma INDEP_UNIF: "ALL n. indep (unif n)"
|
|
3749 |
by (import prob_uniform INDEP_UNIF)
|
|
3750 |
|
|
3751 |
lemma INDEP_UNIFORM: "ALL t n. indep (uniform t (Suc n))"
|
|
3752 |
by (import prob_uniform INDEP_UNIFORM)
|
|
3753 |
|
|
3754 |
lemma PROB_UNIF: "ALL n k.
|
|
3755 |
prob (%s. fst (unif n s) = k) =
|
|
3756 |
(if k < 2 ^ unif_bound n then (1 / 2) ^ unif_bound n else 0)"
|
|
3757 |
by (import prob_uniform PROB_UNIF)
|
|
3758 |
|
|
3759 |
lemma UNIF_RANGE: "ALL n s. fst (unif n s) < 2 ^ unif_bound n"
|
|
3760 |
by (import prob_uniform UNIF_RANGE)
|
|
3761 |
|
|
3762 |
lemma PROB_UNIF_PAIR: "ALL n k k'.
|
|
3763 |
(prob (%s. fst (unif n s) = k) = prob (%s. fst (unif n s) = k')) =
|
|
3764 |
((k < 2 ^ unif_bound n) = (k' < 2 ^ unif_bound n))"
|
|
3765 |
by (import prob_uniform PROB_UNIF_PAIR)
|
|
3766 |
|
|
3767 |
lemma PROB_UNIF_BOUND: "(All::(nat => bool) => bool)
|
|
3768 |
(%n::nat.
|
|
3769 |
(All::(nat => bool) => bool)
|
|
3770 |
(%k::nat.
|
|
3771 |
(op -->::bool => bool => bool)
|
|
3772 |
((op <=::nat => nat => bool) k
|
|
3773 |
((op ^::nat => nat => nat)
|
|
3774 |
((number_of::bin => nat)
|
15647
|
3775 |
((op BIT::bin => bit => bin)
|
|
3776 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
3777 |
(bit.B1::bit))
|
|
3778 |
(bit.B0::bit)))
|
14516
|
3779 |
((unif_bound::nat => nat) n)))
|
|
3780 |
((op =::real => real => bool)
|
|
3781 |
((prob::((nat => bool) => bool) => real)
|
|
3782 |
(%s::nat => bool.
|
|
3783 |
(op <::nat => nat => bool)
|
|
3784 |
((fst::nat * (nat => bool) => nat)
|
|
3785 |
((unif::nat => (nat => bool) => nat * (nat => bool)) n
|
|
3786 |
s))
|
|
3787 |
k))
|
|
3788 |
((op *::real => real => real) ((real::nat => real) k)
|
|
3789 |
((op ^::real => nat => real)
|
|
3790 |
((op /::real => real => real) (1::real)
|
|
3791 |
((number_of::bin => real)
|
15647
|
3792 |
((op BIT::bin => bit => bin)
|
|
3793 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
3794 |
(bit.B1::bit))
|
|
3795 |
(bit.B0::bit))))
|
14516
|
3796 |
((unif_bound::nat => nat) n))))))"
|
|
3797 |
by (import prob_uniform PROB_UNIF_BOUND)
|
|
3798 |
|
|
3799 |
lemma PROB_UNIF_GOOD: "ALL n. 1 / 2 <= prob (%s. fst (unif n s) < Suc n)"
|
|
3800 |
by (import prob_uniform PROB_UNIF_GOOD)
|
|
3801 |
|
|
3802 |
lemma UNIFORM_RANGE: "ALL t n s. fst (uniform t (Suc n) s) < Suc n"
|
|
3803 |
by (import prob_uniform UNIFORM_RANGE)
|
|
3804 |
|
|
3805 |
lemma PROB_UNIFORM_LOWER_BOUND: "(All::(real => bool) => bool)
|
|
3806 |
(%b::real.
|
|
3807 |
(op -->::bool => bool => bool)
|
|
3808 |
((All::(nat => bool) => bool)
|
|
3809 |
(%k::nat.
|
|
3810 |
(op -->::bool => bool => bool)
|
|
3811 |
((op <::nat => nat => bool) k ((Suc::nat => nat) (n::nat)))
|
|
3812 |
((op <::real => real => bool)
|
|
3813 |
((prob::((nat => bool) => bool) => real)
|
|
3814 |
(%s::nat => bool.
|
|
3815 |
(op =::nat => nat => bool)
|
|
3816 |
((fst::nat * (nat => bool) => nat)
|
|
3817 |
((uniform::nat
|
|
3818 |
=> nat
|
|
3819 |
=> (nat => bool) => nat * (nat => bool))
|
|
3820 |
(t::nat) ((Suc::nat => nat) n) s))
|
|
3821 |
k))
|
|
3822 |
b)))
|
|
3823 |
((All::(nat => bool) => bool)
|
|
3824 |
(%m::nat.
|
|
3825 |
(op -->::bool => bool => bool)
|
|
3826 |
((op <::nat => nat => bool) m ((Suc::nat => nat) n))
|
|
3827 |
((op <::real => real => bool)
|
|
3828 |
((prob::((nat => bool) => bool) => real)
|
|
3829 |
(%s::nat => bool.
|
|
3830 |
(op <::nat => nat => bool)
|
|
3831 |
((fst::nat * (nat => bool) => nat)
|
|
3832 |
((uniform::nat
|
|
3833 |
=> nat
|
|
3834 |
=> (nat => bool) => nat * (nat => bool))
|
|
3835 |
t ((Suc::nat => nat) n) s))
|
|
3836 |
((Suc::nat => nat) m)))
|
|
3837 |
((op *::real => real => real)
|
|
3838 |
((real::nat => real) ((Suc::nat => nat) m)) b)))))"
|
|
3839 |
by (import prob_uniform PROB_UNIFORM_LOWER_BOUND)
|
|
3840 |
|
|
3841 |
lemma PROB_UNIFORM_UPPER_BOUND: "(All::(real => bool) => bool)
|
|
3842 |
(%b::real.
|
|
3843 |
(op -->::bool => bool => bool)
|
|
3844 |
((All::(nat => bool) => bool)
|
|
3845 |
(%k::nat.
|
|
3846 |
(op -->::bool => bool => bool)
|
|
3847 |
((op <::nat => nat => bool) k ((Suc::nat => nat) (n::nat)))
|
|
3848 |
((op <::real => real => bool) b
|
|
3849 |
((prob::((nat => bool) => bool) => real)
|
|
3850 |
(%s::nat => bool.
|
|
3851 |
(op =::nat => nat => bool)
|
|
3852 |
((fst::nat * (nat => bool) => nat)
|
|
3853 |
((uniform::nat
|
|
3854 |
=> nat
|
|
3855 |
=> (nat => bool) => nat * (nat => bool))
|
|
3856 |
(t::nat) ((Suc::nat => nat) n) s))
|
|
3857 |
k)))))
|
|
3858 |
((All::(nat => bool) => bool)
|
|
3859 |
(%m::nat.
|
|
3860 |
(op -->::bool => bool => bool)
|
|
3861 |
((op <::nat => nat => bool) m ((Suc::nat => nat) n))
|
|
3862 |
((op <::real => real => bool)
|
|
3863 |
((op *::real => real => real)
|
|
3864 |
((real::nat => real) ((Suc::nat => nat) m)) b)
|
|
3865 |
((prob::((nat => bool) => bool) => real)
|
|
3866 |
(%s::nat => bool.
|
|
3867 |
(op <::nat => nat => bool)
|
|
3868 |
((fst::nat * (nat => bool) => nat)
|
|
3869 |
((uniform::nat
|
|
3870 |
=> nat
|
|
3871 |
=> (nat => bool) => nat * (nat => bool))
|
|
3872 |
t ((Suc::nat => nat) n) s))
|
|
3873 |
((Suc::nat => nat) m)))))))"
|
|
3874 |
by (import prob_uniform PROB_UNIFORM_UPPER_BOUND)
|
|
3875 |
|
|
3876 |
lemma PROB_UNIFORM_PAIR_SUC: "(All::(nat => bool) => bool)
|
|
3877 |
(%t::nat.
|
|
3878 |
(All::(nat => bool) => bool)
|
|
3879 |
(%n::nat.
|
|
3880 |
(All::(nat => bool) => bool)
|
|
3881 |
(%k::nat.
|
|
3882 |
(All::(nat => bool) => bool)
|
|
3883 |
(%k'::nat.
|
|
3884 |
(op -->::bool => bool => bool)
|
|
3885 |
((op &::bool => bool => bool)
|
|
3886 |
((op <::nat => nat => bool) k ((Suc::nat => nat) n))
|
|
3887 |
((op <::nat => nat => bool) k'
|
|
3888 |
((Suc::nat => nat) n)))
|
|
3889 |
((op <=::real => real => bool)
|
|
3890 |
((abs::real => real)
|
|
3891 |
((op -::real => real => real)
|
|
3892 |
((prob::((nat => bool) => bool) => real)
|
|
3893 |
(%s::nat => bool.
|
|
3894 |
(op =::nat => nat => bool)
|
|
3895 |
((fst::nat * (nat => bool) => nat)
|
|
3896 |
((uniform::nat
|
|
3897 |
=> nat => (nat => bool) => nat * (nat => bool))
|
|
3898 |
t ((Suc::nat => nat) n) s))
|
|
3899 |
k))
|
|
3900 |
((prob::((nat => bool) => bool) => real)
|
|
3901 |
(%s::nat => bool.
|
|
3902 |
(op =::nat => nat => bool)
|
|
3903 |
((fst::nat * (nat => bool) => nat)
|
|
3904 |
((uniform::nat
|
|
3905 |
=> nat => (nat => bool) => nat * (nat => bool))
|
|
3906 |
t ((Suc::nat => nat) n) s))
|
|
3907 |
k'))))
|
|
3908 |
((op ^::real => nat => real)
|
|
3909 |
((op /::real => real => real) (1::real)
|
|
3910 |
((number_of::bin => real)
|
15647
|
3911 |
((op BIT::bin => bit => bin)
|
|
3912 |
((op BIT::bin => bit => bin)
|
|
3913 |
(Numeral.Pls::bin) (bit.B1::bit))
|
|
3914 |
(bit.B0::bit))))
|
14516
|
3915 |
t))))))"
|
|
3916 |
by (import prob_uniform PROB_UNIFORM_PAIR_SUC)
|
|
3917 |
|
|
3918 |
lemma PROB_UNIFORM_SUC: "(All::(nat => bool) => bool)
|
|
3919 |
(%t::nat.
|
|
3920 |
(All::(nat => bool) => bool)
|
|
3921 |
(%n::nat.
|
|
3922 |
(All::(nat => bool) => bool)
|
|
3923 |
(%k::nat.
|
|
3924 |
(op -->::bool => bool => bool)
|
|
3925 |
((op <::nat => nat => bool) k ((Suc::nat => nat) n))
|
|
3926 |
((op <=::real => real => bool)
|
|
3927 |
((abs::real => real)
|
|
3928 |
((op -::real => real => real)
|
|
3929 |
((prob::((nat => bool) => bool) => real)
|
|
3930 |
(%s::nat => bool.
|
|
3931 |
(op =::nat => nat => bool)
|
|
3932 |
((fst::nat * (nat => bool) => nat)
|
|
3933 |
((uniform::nat
|
|
3934 |
=> nat => (nat => bool) => nat * (nat => bool))
|
|
3935 |
t ((Suc::nat => nat) n) s))
|
|
3936 |
k))
|
|
3937 |
((op /::real => real => real) (1::real)
|
|
3938 |
((real::nat => real) ((Suc::nat => nat) n)))))
|
|
3939 |
((op ^::real => nat => real)
|
|
3940 |
((op /::real => real => real) (1::real)
|
|
3941 |
((number_of::bin => real)
|
15647
|
3942 |
((op BIT::bin => bit => bin)
|
|
3943 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
3944 |
(bit.B1::bit))
|
|
3945 |
(bit.B0::bit))))
|
14516
|
3946 |
t)))))"
|
|
3947 |
by (import prob_uniform PROB_UNIFORM_SUC)
|
|
3948 |
|
|
3949 |
lemma PROB_UNIFORM: "(All::(nat => bool) => bool)
|
|
3950 |
(%t::nat.
|
|
3951 |
(All::(nat => bool) => bool)
|
|
3952 |
(%n::nat.
|
|
3953 |
(All::(nat => bool) => bool)
|
|
3954 |
(%k::nat.
|
|
3955 |
(op -->::bool => bool => bool)
|
|
3956 |
((op <::nat => nat => bool) k n)
|
|
3957 |
((op <=::real => real => bool)
|
|
3958 |
((abs::real => real)
|
|
3959 |
((op -::real => real => real)
|
|
3960 |
((prob::((nat => bool) => bool) => real)
|
|
3961 |
(%s::nat => bool.
|
|
3962 |
(op =::nat => nat => bool)
|
|
3963 |
((fst::nat * (nat => bool) => nat)
|
|
3964 |
((uniform::nat
|
|
3965 |
=> nat => (nat => bool) => nat * (nat => bool))
|
|
3966 |
t n s))
|
|
3967 |
k))
|
|
3968 |
((op /::real => real => real) (1::real)
|
|
3969 |
((real::nat => real) n))))
|
|
3970 |
((op ^::real => nat => real)
|
|
3971 |
((op /::real => real => real) (1::real)
|
|
3972 |
((number_of::bin => real)
|
15647
|
3973 |
((op BIT::bin => bit => bin)
|
|
3974 |
((op BIT::bin => bit => bin) (Numeral.Pls::bin)
|
|
3975 |
(bit.B1::bit))
|
|
3976 |
(bit.B0::bit))))
|
14516
|
3977 |
t)))))"
|
|
3978 |
by (import prob_uniform PROB_UNIFORM)
|
|
3979 |
|
|
3980 |
;end_setup
|
|
3981 |
|
|
3982 |
end
|
|
3983 |
|