2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department of the University of Bologna, Italy.
8 \ / This file is distributed under the terms of the
9 \ / GNU General Public License Version 2
10 V_____________________________________________________________*)
17 include "turing/if_machine.ma".
18 include "turing/basic_machines.ma".
19 include "turing/universal/alphabet.ma".
21 (* ADVANCE TO MARK (right)
23 sposta la testina a destra fino a raggiungere il primo carattere marcato
27 (* 0, a ≠ mark _ ⇒ 0, R
28 0, a = mark _ ⇒ 1, N *)
30 definition atm_states ≝ initN 3.
32 definition atm0 : atm_states ≝ mk_Sig ?? 0 (leb_true_to_le 1 3 (refl …)).
33 definition atm1 : atm_states ≝ mk_Sig ?? 1 (leb_true_to_le 2 3 (refl …)).
34 definition atm2 : atm_states ≝ mk_Sig ?? 2 (leb_true_to_le 3 3 (refl …)).
36 definition atmr_step ≝
37 λalpha:FinSet.λtest:alpha→bool.
38 mk_TM alpha atm_states
41 [ None ⇒ 〈atm1, None ?〉
44 [ true ⇒ 〈atm1,None ?〉
45 | false ⇒ 〈atm2,Some ? 〈a',R〉〉 ]])
46 atm0 (λx.notb (x == atm0)).
48 definition Ratmr_step_true ≝
51 t1 = midtape alpha ls a rs ∧ test a = false ∧
52 t2 = mk_tape alpha (a::ls) (option_hd ? rs) (tail ? rs).
54 definition Ratmr_step_false ≝
57 (current alpha t1 = None ? ∨
58 (∃a.current ? t1 = Some ? a ∧ test a = true)).
61 ∀alpha,test,ls,a0,rs. test a0 = true →
62 step alpha (atmr_step alpha test)
63 (mk_config ?? atm0 (midtape … ls a0 rs)) =
64 mk_config alpha (states ? (atmr_step alpha test)) atm1
66 #alpha #test #ls #a0 #ts #Htest whd in ⊢ (??%?);
67 whd in match (trans … 〈?,?〉); >Htest %
71 ∀alpha,test,ls,a0,rs. test a0 = false →
72 step alpha (atmr_step alpha test)
73 (mk_config ?? atm0 (midtape … ls a0 rs)) =
74 mk_config alpha (states ? (atmr_step alpha test)) atm2
75 (mk_tape … (a0::ls) (option_hd ? rs) (tail ? rs)).
76 #alpha #test #ls #a0 #ts #Htest whd in ⊢ (??%?);
77 whd in match (trans … 〈?,?〉); >Htest cases ts //
82 accRealize alpha (atmr_step alpha test)
83 atm2 (Ratmr_step_true alpha test) (Ratmr_step_false alpha test).
86 @(ex_intro ?? (mk_config ?? atm1 (niltape ?))) %
87 [ % // whd in ⊢ ((??%%)→?); #Hfalse destruct | #_ % // % % ]
88 | #a #al @(ex_intro ?? 2) @(ex_intro ?? (mk_config ?? atm1 (leftof ? a al)))
89 % [ % // whd in ⊢ ((??%%)→?); #Hfalse destruct | #_ % // % % ]
90 | #a #al @(ex_intro ?? 2) @(ex_intro ?? (mk_config ?? atm1 (rightof ? a al)))
91 % [ % // whd in ⊢ ((??%%)→?); #Hfalse destruct | #_ % // % % ]
92 | #ls #c #rs @(ex_intro ?? 2)
93 cases (true_or_false (test c)) #Htest
94 [ @(ex_intro ?? (mk_config ?? atm1 ?))
97 [ whd in ⊢ (??%?); >atmr_q0_q1 //
98 | whd in ⊢ ((??%%)→?); #Hfalse destruct ]
99 | #_ % // %2 @(ex_intro ?? c) % // ]
101 | @(ex_intro ?? (mk_config ?? atm2 (mk_tape ? (c::ls) (option_hd ? rs) (tail ? rs))))
104 [ whd in ⊢ (??%?); >atmr_q0_q2 //
105 | #_ @(ex_intro ?? ls) @(ex_intro ?? c) @(ex_intro ?? rs)
108 | #Hfalse @False_ind @(absurd ?? Hfalse) %
114 definition R_adv_to_mark_r ≝ λalpha,test,t1,t2.
115 (current ? t1 = None ? → t1 = t2) ∧
117 (t1 = midtape alpha ls c rs →
118 ((test c = true ∧ t2 = t1) ∨
120 ∀rs1,b,rs2. rs = rs1@b::rs2 →
121 test b = true → (∀x.memb ? x rs1 = true → test x = false) →
122 t2 = midtape ? (reverse ? rs1@c::ls) b rs2))).
124 definition adv_to_mark_r ≝
125 λalpha,test.whileTM alpha (atmr_step alpha test) atm2.
127 lemma wsem_adv_to_mark_r :
129 WRealize alpha (adv_to_mark_r alpha test) (R_adv_to_mark_r alpha test).
130 #alpha #test #t #i #outc #Hloop
131 lapply (sem_while … (sem_atmr_step alpha test) t i outc Hloop) [%]
132 -Hloop * #t1 * #Hstar @(star_ind_l ??????? Hstar)
136 |#ls #c #rs #H2 >H2 in H1; whd in ⊢ (??%? → ?);
137 #Hfalse destruct (Hfalse)
139 | * #a * #Ha #Htest %
140 [ >Ha #H destruct (H);
142 >H2 in Ha; whd in ⊢ (??%? → ?); #Heq destruct (Heq) % //
146 | #tapea #tapeb #tapec #Hleft #Hright #IH #HRfalse
147 lapply (IH HRfalse) -IH #IH %
148 [cases Hleft #ls * #a * #rs * * #Htapea #_ #_ >Htapea
149 whd in ⊢((??%?)→?); #H destruct (H);
150 |#ls #c #rs #Htapea %2
151 cases Hleft #ls0 * #a0 * #rs0 * * #Htapea' #Htest #Htapeb
152 >Htapea' in Htapea; #Htapea destruct (Htapea) % // *
153 [ #b #rs2 #Hrs >Hrs in Htapeb; #Htapeb #Htestb #_
154 cases (proj2 ?? IH … Htapeb)
155 [ * #_ #Houtc >Houtc >Htapeb %
156 | * #Hfalse >Hfalse in Htestb; #Htestb destruct (Htestb) ]
157 | #r1 #rs1 #b #rs2 #Hrs >Hrs in Htapeb; #Htapeb #Htestb #Hmemb
158 cases (proj2 ?? IH … Htapeb)
159 [ * #Hfalse >(Hmemb …) in Hfalse;
160 [ #Hft destruct (Hft)
162 | * #Htestr1 #H1 >reverse_cons >associative_append
163 @H1 // #x #Hx @Hmemb @memb_cons //
168 lemma terminate_adv_to_mark_r :
170 ∀t.Terminate alpha (adv_to_mark_r alpha test) t.
172 @(terminate_while … (sem_atmr_step alpha test))
175 [ % #t1 * #ls0 * #c0 * #rs0 * * #Hfalse destruct (Hfalse)
176 |2,3: #a0 #al0 % #t1 * #ls0 * #c0 * #rs0 * * #Hfalse destruct (Hfalse)
177 | #ls #c #rs generalize in match c; -c generalize in match ls; -ls
179 [#ls #c % #t1 * #ls0 * #c0 * #rs0 * *
180 #H1 destruct (H1) #Hc0 #Ht1 normalize in Ht1;
181 % #t2 * #ls1 * #c1 * #rs1 * * >Ht1
182 normalize in ⊢ (%→?); #Hfalse destruct (Hfalse)
183 | #r0 #rs0 #IH #ls #c % #t1 * #ls0 * #c0 * #rs0 * *
184 #H1 destruct (H1) #Hc0 #Ht1 normalize in Ht1;
191 lemma sem_adv_to_mark_r :
193 Realize alpha (adv_to_mark_r alpha test) (R_adv_to_mark_r alpha test).
199 marks the current character
202 definition mark_states ≝ initN 2.
204 definition ms0 : mark_states ≝ mk_Sig ?? 0 (leb_true_to_le 1 2 (refl …)).
205 definition ms1 : mark_states ≝ mk_Sig ?? 1 (leb_true_to_le 2 2 (refl …)).
208 λalpha:FinSet.mk_TM (FinProd … alpha FinBool) mark_states
211 [ None ⇒ 〈ms1,None ?〉
212 | Some a' ⇒ match (pi1 … q) with
213 [ O ⇒ let 〈a'',b〉 ≝ a' in 〈ms1,Some ? 〈〈a'',true〉,N〉〉
214 | S q ⇒ 〈ms1,None ?〉 ] ])
217 definition R_mark ≝ λalpha,t1,t2.
219 t1 = midtape (FinProd … alpha FinBool) ls 〈c,b〉 rs →
220 t2 = midtape ? ls 〈c,true〉 rs) ∧
221 (current ? t1 = None ? → t2 = t1).
224 ∀alpha.Realize ? (mark alpha) (R_mark alpha).
225 #alpha #intape @(ex_intro ?? 2) cases intape
227 [| % [ % | % [#ls #c #b #rs #Hfalse destruct | // ]]]
229 [| % [ % | % [#ls #c #b #rs #Hfalse destruct | // ]]]
231 [| % [ % | % [#ls #c #b #rs #Hfalse destruct ] // ]]
233 @ex_intro [| % [ % | %
234 [#ls0 #c0 #b0 #rs0 #H1 destruct (H1) %
235 | whd in ⊢ ((??%?)→?); #H1 destruct (H1)]]]
239 (* MOVE RIGHT AND MARK machine
241 marks the first character on the right
243 (could be rewritten using (mark; move_right))
246 definition mrm_states ≝ initN 3.
248 definition mrm0 : mrm_states ≝ mk_Sig ?? 0 (leb_true_to_le 1 3 (refl …)).
249 definition mrm1 : mrm_states ≝ mk_Sig ?? 1 (leb_true_to_le 2 3 (refl …)).
250 definition mrm2 : mrm_states ≝ mk_Sig ?? 2 (leb_true_to_le 3 3 (refl …)).
252 definition move_right_and_mark ≝
253 λalpha:FinSet.mk_TM (FinProd … alpha FinBool) mrm_states
256 [ None ⇒ 〈mrm2,None ?〉
257 | Some a' ⇒ match pi1 … q with
258 [ O ⇒ 〈mrm1,Some ? 〈a',R〉〉
260 [ O ⇒ let 〈a'',b〉 ≝ a' in
261 〈mrm2,Some ? 〈〈a'',true〉,N〉〉
262 | S _ ⇒ 〈mrm2,None ?〉 ] ] ])
265 definition R_move_right_and_mark ≝ λalpha,t1,t2.
267 t1 = midtape (FinProd … alpha FinBool) ls c (〈d,b〉::rs) →
268 t2 = midtape ? (c::ls) 〈d,true〉 rs.
270 lemma sem_move_right_and_mark :
271 ∀alpha.Realize ? (move_right_and_mark alpha) (R_move_right_and_mark alpha).
272 #alpha #intape @(ex_intro ?? 3) cases intape
274 [| % [ % | #ls #c #d #b #rs #Hfalse destruct ] ]
276 [| % [ % | #ls #c #d #b #rs #Hfalse destruct ] ]
278 [| % [ % | #ls #c #d #b #rs #Hfalse destruct ] ]
280 [ @ex_intro [| % [ % | #ls0 #c0 #d0 #b0 #rs0 #Hfalse destruct ] ]
281 | * #d #b #rs @ex_intro
282 [| % [ % | #ls0 #c0 #d0 #b0 #rs0 #H1 destruct (H1) % ] ] ] ]
285 (* CLEAR MARK machine
287 clears the mark in the current character
290 definition clear_mark_states ≝ initN 3.
292 definition clear0 : clear_mark_states ≝ mk_Sig ?? 0 (leb_true_to_le 1 3 (refl …)).
293 definition clear1 : clear_mark_states ≝ mk_Sig ?? 1 (leb_true_to_le 2 3 (refl …)).
294 definition claer2 : clear_mark_states ≝ mk_Sig ?? 2 (leb_true_to_le 3 3 (refl …)).
296 definition clear_mark ≝
297 λalpha:FinSet.mk_TM (FinProd … alpha FinBool) clear_mark_states
300 [ None ⇒ 〈clear1,None ?〉
301 | Some a' ⇒ match pi1 … q with
302 [ O ⇒ let 〈a'',b〉 ≝ a' in 〈clear1,Some ? 〈〈a'',false〉,N〉〉
303 | S q ⇒ 〈clear1,None ?〉 ] ])
304 clear0 (λq.q == clear1).
306 definition R_clear_mark ≝ λalpha,t1,t2.
308 t1 = midtape (FinProd … alpha FinBool) ls 〈c,b〉 rs →
309 t2 = midtape ? ls 〈c,false〉 rs.
311 lemma sem_clear_mark :
312 ∀alpha.Realize ? (clear_mark alpha) (R_clear_mark alpha).
313 #alpha #intape @(ex_intro ?? 2) cases intape
315 [| % [ % | #ls #c #b #rs #Hfalse destruct ] ]
317 [| % [ % | #ls #c #b #rs #Hfalse destruct ] ]
319 [| % [ % | #ls #c #b #rs #Hfalse destruct ] ]
321 @ex_intro [| % [ % | #ls0 #c0 #b0 #rs0 #H1 destruct (H1) % ] ] ]
324 (* ADVANCE MARK RIGHT machine
326 clears mark on current char,
327 moves right, and marks new current char
331 definition adv_mark_r ≝
333 clear_mark alpha · move_r ? · mark alpha.
335 definition R_adv_mark_r ≝ λalpha,t1,t2.
338 t1 = midtape (FinProd … alpha FinBool) ls 〈c,true〉 (〈d,b〉::rs) →
339 t2 = midtape ? (〈c,false〉::ls) 〈d,true〉 rs) ∧
340 (t1 = midtape (FinProd … alpha FinBool) ls 〈c,true〉 [ ] →
341 t2 = rightof ? 〈c,false〉 ls).
343 lemma sem_adv_mark_r :
344 ∀alpha.Realize ? (adv_mark_r alpha) (R_adv_mark_r alpha).
346 @(sem_seq_app … (sem_clear_mark …)
347 (sem_seq ????? (sem_move_r ?) (sem_mark alpha)) …)
348 #intape #outtape whd in ⊢ (%→?); * #ta *
349 whd in ⊢ (%→?); #Hs1 whd in ⊢ (%→?); * #tb * #Hs2 whd in ⊢ (%→?); #Hs3
351 [#d #b #rs #Hintape @(proj1 … Hs3 ?? b ?)
352 @(proj2 … Hs2 ls 〈c,false〉 (〈d,b〉::rs))
354 |#Hintape lapply (Hs1 … Hintape) #Hta lapply (proj2 … Hs2 … Hta)
355 whd in ⊢ ((???%)→?); #Htb <Htb @(proj2 … Hs3) >Htb //
359 (* ADVANCE TO MARK (left)
364 definition atml_step ≝
365 λalpha:FinSet.λtest:alpha→bool.
366 mk_TM alpha atm_states
369 [ None ⇒ 〈atm1, None ?〉
372 [ true ⇒ 〈atm1,None ?〉
373 | false ⇒ 〈atm2,Some ? 〈a',L〉〉 ]])
374 atm0 (λx.notb (x == atm0)).
376 definition Ratml_step_true ≝
379 t1 = midtape alpha ls a rs ∧ test a = false ∧
380 t2 = mk_tape alpha (tail ? ls) (option_hd ? ls) (a :: rs).
382 definition Ratml_step_false ≝
385 (current alpha t1 = None ? ∨
386 (∃a.current ? t1 = Some ? a ∧ test a = true)).
389 ∀alpha,test,ls,a0,rs. test a0 = true →
390 step alpha (atml_step alpha test)
391 (mk_config ?? atm0 (midtape … ls a0 rs)) =
392 mk_config alpha (states ? (atml_step alpha test)) atm1
393 (midtape … ls a0 rs).
394 #alpha #test #ls #a0 #ts #Htest whd in ⊢ (??%?);
395 whd in match (trans … 〈?,?〉); >Htest %
399 ∀alpha,test,ls,a0,rs. test a0 = false →
400 step alpha (atml_step alpha test)
401 (mk_config ?? atm0 (midtape … ls a0 rs)) =
402 mk_config alpha (states ? (atml_step alpha test)) atm2
403 (mk_tape … (tail ? ls) (option_hd ? ls) (a0 :: rs)).
404 #alpha #test #ls #a0 #rs #Htest whd in ⊢ (??%?);
405 whd in match (trans … 〈?,?〉); >Htest cases ls //
408 lemma sem_atml_step :
410 accRealize alpha (atml_step alpha test)
411 atm2 (Ratml_step_true alpha test) (Ratml_step_false alpha test).
414 @(ex_intro ?? (mk_config ?? atm1 (niltape ?))) %
415 [ % // whd in ⊢ ((??%%)→?); #Hfalse destruct | #_ % // % % ]
416 | #a #al @(ex_intro ?? 2) @(ex_intro ?? (mk_config ?? atm1 (leftof ? a al)))
417 % [ % // whd in ⊢ ((??%%)→?); #Hfalse destruct | #_ % // % % ]
418 | #a #al @(ex_intro ?? 2) @(ex_intro ?? (mk_config ?? atm1 (rightof ? a al)))
419 % [ % // whd in ⊢ ((??%%)→?); #Hfalse destruct | #_ % // % % ]
420 | #ls #c #rs @(ex_intro ?? 2)
421 cases (true_or_false (test c)) #Htest
422 [ @(ex_intro ?? (mk_config ?? atm1 ?))
425 [ whd in ⊢ (??%?); >atml_q0_q1 //
426 | whd in ⊢ ((??%%)→?); #Hfalse destruct ]
427 | #_ % // %2 @(ex_intro ?? c) % // ]
429 | @(ex_intro ?? (mk_config ?? atm2 (mk_tape ? (tail ? ls) (option_hd ? ls) (c::rs))))
432 [ whd in ⊢ (??%?); >atml_q0_q2 //
433 | #_ @(ex_intro ?? ls) @(ex_intro ?? c) @(ex_intro ?? rs)
436 | #Hfalse @False_ind @(absurd ?? Hfalse) %
442 definition R_adv_to_mark_l ≝ λalpha,test,t1,t2.
443 (current ? t1 = None ? → t1 = t2) ∧
445 (t1 = midtape alpha ls c rs →
446 ((test c = true → t2 = t1) ∧
448 ∀ls1,b,ls2. ls = ls1@b::ls2 →
449 test b = true → (∀x.memb ? x ls1 = true → test x = false) →
450 t2 = midtape ? ls2 b (reverse ? ls1@c::rs)))).
452 definition adv_to_mark_l ≝
453 λalpha,test.whileTM alpha (atml_step alpha test) atm2.
455 lemma wsem_adv_to_mark_l :
457 WRealize alpha (adv_to_mark_l alpha test) (R_adv_to_mark_l alpha test).
458 #alpha #test #t #i #outc #Hloop
459 lapply (sem_while … (sem_atml_step alpha test) t i outc Hloop) [%]
460 -Hloop * #t1 * #Hstar @(star_ind_l ??????? Hstar)
464 |#ls #c #rs #H2 >H2 in H1; whd in ⊢ (??%? → ?);
465 #Hfalse destruct (Hfalse)
467 | * #a * #Ha #Htest %
468 [>Ha #H destruct (H);
471 |#Hc @False_ind >H2 in Ha; whd in ⊢ ((??%?)→?);
476 | #tapea #tapeb #tapec #Hleft #Hright #IH #HRfalse
477 lapply (IH HRfalse) -IH #IH %
478 [cases Hleft #ls0 * #a0 * #rs0 * * #Htapea #_ #_ >Htapea
479 whd in ⊢ ((??%?)→?); #H destruct (H)
480 |#ls #c #rs #Htapea %
481 [#Hc cases Hleft #ls0 * #a0 * #rs0 * * #Htapea' #Htest @False_ind
482 >Htapea' in Htapea; #H destruct /2/
483 |cases Hleft #ls0 * #a * #rs0 *
484 * #Htapea1 >Htapea in Htapea1; #H destruct (H) #_ #Htapeb
486 [#b #ls2 #Hls >Hls in Htapeb; #Htapeb #Htestb #_
487 cases (proj2 ?? IH … Htapeb) #H1 #_ >H1 // >Htapeb %
488 |#l1 #ls1 #b #ls2 #Hls >Hls in Htapeb; #Htapeb #Htestb #Hmemb
489 cases (proj2 ?? IH … Htapeb) #_ #H1 >reverse_cons >associative_append
490 @(H1 … (refl …) Htestb)
492 |#x #memx @Hmemb @memb_cons @memx
499 lemma terminate_adv_to_mark_l :
501 ∀t.Terminate alpha (adv_to_mark_l alpha test) t.
503 @(terminate_while … (sem_atml_step alpha test))
506 [ % #t1 * #ls0 * #c0 * #rs0 * * #Hfalse destruct (Hfalse)
507 |2,3: #a0 #al0 % #t1 * #ls0 * #c0 * #rs0 * * #Hfalse destruct (Hfalse)
509 [#c #rs % #t1 * #ls0 * #c0 * #rs0 * *
510 #H1 destruct (H1) #Hc0 #Ht1 normalize in Ht1;
511 % #t2 * #ls1 * #c1 * #rs1 * * >Ht1
512 normalize in ⊢ (%→?); #Hfalse destruct (Hfalse)
513 | #rs0 #r0 #IH #ls #c % #t1 * #ls0 * #c0 * #rs0 * *
514 #H1 destruct (H1) #Hc0 #Ht1 normalize in Ht1;
521 lemma sem_adv_to_mark_l :
523 Realize alpha (adv_to_mark_l alpha test) (R_adv_to_mark_l alpha test).
528 ADVANCE BOTH MARKS machine
530 l1 does not contain marks ⇒
542 definition adv_both_marks ≝ λalpha.
543 adv_mark_r alpha · move_l ? ·
544 adv_to_mark_l (FinProd alpha FinBool) (is_marked alpha) ·
547 definition R_adv_both_marks ≝
549 ∀l0,x,a,l1,x0. (∀c.memb ? c l1 = true → is_marked ? c = false) →
550 (∀l1',a0,l2. t1 = midtape (FinProd … alpha FinBool)
551 (l1@〈x,true〉::l0) 〈x0,true〉 (〈a0,false〉::l2) →
552 reverse ? (〈x0,false〉::l1) = 〈a,false〉::l1' →
553 t2 = midtape ? (〈x,false〉::l0) 〈a,true〉 (l1'@〈a0,true〉::l2)) ∧
554 (t1 = midtape (FinProd … alpha FinBool)
555 (l1@〈a,false〉::〈x,true〉::l0) 〈x0,true〉 [ ] →
556 t2 = rightof ? 〈x0,false〉 (l1@〈a,false〉::〈x,true〉::l0)).
558 lemma sem_adv_both_marks :
559 ∀alpha.Realize ? (adv_both_marks alpha) (R_adv_both_marks alpha).
561 @(sem_seq_app … (sem_adv_mark_r …)
562 (sem_seq ????? (sem_move_l …)
563 (sem_seq ????? (sem_adv_to_mark_l ? (is_marked ?))
564 (sem_adv_mark_r alpha))) …)
565 #intape #outtape * #tapea * #Hta * #tb * #Htb * #tc * #Htc #Hout
566 #l0 #x #a #l1 #x0 #Hmarks %
567 [#l1' #a0 #l2 #Hintape #Hrev @(proj1 … (Hout … ) ? false) -Hout
568 lapply (proj1 … (Hta ??) … Hintape) #Htapea
569 lapply (proj2 … Htb … Htapea) -Htb
570 whd in match (mk_tape ????) ; #Htapeb
571 lapply (proj2 ?? (proj2 ?? Htc … Htapeb) (refl …) … (refl …)) -Htc #Htc
572 change with ((?::?)@?) in match (cons ???); <Hrev >reverse_cons
573 >associative_append @Htc [%|@Hmarks]
574 |#Hintape lapply (proj2 ?? (Hta … ) … Hintape) -Hta #Hta
575 lapply (proj1 … Htb) >Hta -Htb #Htb lapply (Htb (refl …)) -Htb #Htb
576 lapply (proj1 ?? Htc) <Htb -Htc #Htc lapply (Htc (refl …)) -Htc #Htc
577 whd in ⊢ (%→?); * #ta whd #Hs1 * #tb * whd in ⊢ (%→?); #Hs2
578 * #tc * whd in ⊢ (%→%→?); #Hs3 #Hs4
579 @(ex_intro ?? k) @(ex_intro ?? outc) %
581 | -Hloop #l0 #x #a #l1 #x0 #a0 #l2 #Hl1 #Hintape
583 lapply (Hs1 … Hintape) #Hta
584 lapply (proj2 … Hs2 … Hta) #Htb
586 [ * #Hfalse normalize in Hfalse; destruct (Hfalse)
588 lapply (Hs3 (l1@[〈a,false〉]) 〈x,true〉 l0 ???)
589 [ #x1 #Hx1 cases (memb_append … Hx1)
591 | #Hx1' >(memb_single … Hx1') % ]
593 | >associative_append %
594 | >reverse_append #Htc @Htc ]
598 definition R_adv_both_marks ≝
600 ∀l0,x,a,l1,x0,a0,l2. (∀c.memb ? c l1 = true → is_marked ? c = false) →
601 (t1 = midtape (FinProd … alpha FinBool)
602 (l1@〈a,false〉::〈x,true〉::l0) 〈x0,true〉 (〈a0,false〉::l2) →
603 t2 = midtape ? (〈x,false〉::l0) 〈a,true〉 (reverse ? l1@〈x0,false〉::〈a0,true〉::l2)) ∧
604 (t1 = midtape (FinProd … alpha FinBool)
605 (l1@〈a,false〉::〈x,true〉::l0) 〈x0,true〉 [] →
606 t2 = rightof ? 〈x0,false〉 (l1@〈a,false〉::〈x,true〉::l0)).
608 lemma sem_adv_both_marks :
609 ∀alpha.Realize ? (adv_both_marks alpha) (R_adv_both_marks alpha).
611 cases (sem_seq ????? (sem_adv_mark_r …)
612 (sem_seq ????? (sem_move_l …)
613 (sem_seq ????? (sem_adv_to_mark_l ? (is_marked ?))
614 (sem_adv_mark_r alpha))) intape)
615 #k * #outc * #Hloop whd in ⊢ (%→?);
616 * #ta * whd in ⊢ (%→?); #Hs1 * #tb * whd in ⊢ (%→?); #Hs2
617 * #tc * whd in ⊢ (%→%→?); #Hs3 #Hs4
618 @(ex_intro ?? k) @(ex_intro ?? outc) %
620 | -Hloop #l0 #x #a #l1 #x0 #a0 #l2 #Hl1 #Hintape
622 lapply (Hs1 … Hintape) #Hta
623 lapply (proj2 … Hs2 … Hta) #Htb
625 [ * #Hfalse normalize in Hfalse; destruct (Hfalse)
627 lapply (Hs3 (l1@[〈a,false〉]) 〈x,true〉 l0 ???)
628 [ #x1 #Hx1 cases (memb_append … Hx1)
630 | #Hx1' >(memb_single … Hx1') % ]
632 | >associative_append %
633 | >reverse_append #Htc @Htc ]
645 l0 x a* l1 x0 a0* l2 (f(x0) == true)
647 l0 x* a l1 x0* a0 l2 (f(x0) == false)
651 definition match_and_adv ≝
652 λalpha,f.ifTM ? (test_char ? f)
653 (adv_both_marks alpha) (clear_mark ?) tc_true.
655 definition R_match_and_adv ≝
657 ∀l0,x,a,l1,x0,a0,l2. (∀c.memb ? c l1 = true → is_marked ? c = false) →
658 t1 = midtape (FinProd … alpha FinBool)
659 (l1@〈a,false〉::〈x,true〉::l0) 〈x0,true〉 (〈a0,false〉::l2) →
660 (f 〈x0,true〉 = true ∧ t2 = midtape ? (〈x,false〉::l0) 〈a,true〉 (reverse ? l1@〈x0,false〉::〈a0,true〉::l2))
661 ∨ (f 〈x0,true〉 = false ∧
662 t2 = midtape ? (l1@〈a,false〉::〈x,true〉::l0) 〈x0,false〉 (〈a0,false〉::l2)).
664 lemma sem_match_and_adv :
665 ∀alpha,f.Realize ? (match_and_adv alpha f) (R_match_and_adv alpha f).
667 cases (sem_if ? (test_char ? f) … tc_true (sem_test_char ? f) (sem_adv_both_marks alpha) (sem_clear_mark ?) intape)
668 #k * #outc * #Hloop #Hif @(ex_intro ?? k) @(ex_intro ?? outc)
671 [ * #ta * whd in ⊢ (%→%→?); #Hta #Houtc
672 #l0 #x #a #l1 #x0 #a0 #l2 #Hl1 #Hintape >Hintape in Hta;
673 * * #x1 * whd in ⊢ ((??%?)→?); #H destruct (H) #Hf #Hta % %
674 [ @Hf | @Houtc [ @Hl1 | @Hta ] ]
675 | * #ta * whd in ⊢ (%→%→?); #Hta #Houtc
676 #l0 #x #a #l1 #x0 #a0 #l2 #Hl1 #Hintape >Hintape in Hta;
677 * #Hf #Hta %2 % [ @Hf % | >(Houtc … Hta) % ]
683 then move_right; ----
685 if current (* x0 *) = 0
686 then advance_mark ----
693 definition comp_step_subcase ≝ λalpha,c,elseM.
694 ifTM ? (test_char ? (λx.x == c))
695 (move_r … · adv_to_mark_r ? (is_marked alpha) · match_and_adv ? (λx.x == c))
698 definition R_comp_step_subcase ≝
699 λalpha,c,RelseM,t1,t2.
700 ∀l0,x,rs.t1 = midtape (FinProd … alpha FinBool) l0 〈x,true〉 rs →
702 ∀a,l1,x0,a0,l2. (∀c.memb ? c l1 = true → is_marked ? c = false) →
703 rs = 〈a,false〉::l1@〈x0,true〉::〈a0,false〉::l2 →
705 t2 = midtape ? (〈x,false〉::l0) 〈a,true〉 (l1@〈x0,false〉::〈a0,true〉::l2)) ∨
707 t2 = midtape (FinProd … alpha FinBool)
708 (reverse ? l1@〈a,false〉::〈x,true〉::l0) 〈x0,false〉 (〈a0,false〉::l2)))) ∨
709 (〈x,true〉 ≠ c ∧ RelseM t1 t2).
711 lemma sem_comp_step_subcase :
712 ∀alpha,c,elseM,RelseM.
713 Realize ? elseM RelseM →
714 Realize ? (comp_step_subcase alpha c elseM)
715 (R_comp_step_subcase alpha c RelseM).
716 #alpha #c #elseM #RelseM #Helse #intape
717 cases (sem_if ? (test_char ? (λx.x == c)) … tc_true
718 (sem_test_char ? (λx.x == c))
719 (sem_seq ????? (sem_move_r …)
720 (sem_seq ????? (sem_adv_to_mark_r ? (is_marked alpha))
721 (sem_match_and_adv ? (λx.x == c)))) Helse intape)
722 #k * #outc * #Hloop #HR @(ex_intro ?? k) @(ex_intro ?? outc)
723 % [ @Hloop ] -Hloop cases HR -HR
724 [ * #ta * whd in ⊢ (%→?); #Hta * #tb * whd in ⊢ (%→?); #Htb
725 * #tc * whd in ⊢ (%→?); #Htc whd in ⊢ (%→?); #Houtc
726 #l0 #x #rs #Hintape cases (true_or_false (〈x,true〉==c)) #Hc
728 #a #l1 #x0 #a0 #l2 #Hl1 #Hrs >Hrs in Hintape; #Hintape
729 >Hintape in Hta; * #_(* #x1 * whd in ⊢ ((??%?)→?); #H destruct (H) #Hx *)
730 #Hta lapply (proj2 … Htb … Hta) -Htb -Hta #Htb
731 cases (Htc … Htb) [ * #Hfalse normalize in Hfalse; destruct (Hfalse) ]
732 -Htc * #_ #Htc lapply (Htc l1 〈x0,true〉 (〈a0,false〉::l2) (refl ??) (refl ??) Hl1)
733 -Htc #Htc cases (Houtc ???????? Htc) -Houtc
735 % [ <(\P Hx0) in Hc; #Hx lapply (\P Hx) #Hx' destruct (Hx') %
736 | >Houtc >reverse_reverse % ]
738 % [ <(\P Hc) in Hx0; #Hx0 lapply (\Pf Hx0) @not_to_not #Hx' >Hx' %
740 | #x #membx @Hl1 <(reverse_reverse …l1) @memb_reverse @membx ]
742 >Hintape in Hta; * * #x1 * whd in ⊢ ((??%?)→?); #H destruct (H)
743 >Hc #H destruct (H) ]
744 | * #ta * whd in ⊢ (%→?); * #Hc #Hta #Helse #ls #c0 #rs #Hintape %2
745 >Hintape in Hta; #Hta % [ @(\Pf (Hc …)) >Hintape % | <Hta @Helse ]
752 + se è un bit, ho fallito il confronto della tupla corrente
753 + se è un separatore, la tupla fa match
756 ifTM ? (test_char ? is_marked)
757 (single_finalTM … (comp_step_subcase unialpha 〈bit false,true〉
758 (comp_step_subcase unialpha 〈bit true,true〉
763 definition comp_step ≝
764 ifTM ? (test_char ? (is_marked ?))
765 (single_finalTM … (comp_step_subcase FSUnialpha 〈bit false,true〉
766 (comp_step_subcase FSUnialpha 〈bit true,true〉
767 (comp_step_subcase FSUnialpha 〈null,true〉
772 definition R_comp_step_true ≝ λt1,t2.
774 t1 = midtape (FinProd … FSUnialpha FinBool)
775 l0 〈c,true〉 (〈a,false〉::l1@〈c0,true〉::〈a0,false〉::l2) ∧
776 (∀c.memb ? c l1 = true → is_marked ? c = false) ∧
777 (bit_or_null c = true → c0 = c →
778 t2 = midtape ? (〈c,false〉::l0) 〈a,true〉 (l1@〈c0,false〉::〈a0,true〉::l2)) ∧
779 (bit_or_null c = true → c0 ≠ c →
780 t2 = midtape (FinProd … FSUnialpha FinBool)
781 (reverse ? l1@〈a,false〉::〈c,true〉::l0) 〈c0,false〉 (〈a0,false〉::l2)) ∧
782 (bit_or_null c = false →
783 t2 = midtape ? l0 〈c,false〉 (〈a,false〉::l1@〈c0,true〉::〈a0,false〉::l2)).
785 definition R_comp_step_false ≝
787 ∀ls,c,rs.t1 = midtape (FinProd … FSUnialpha FinBool) ls c rs →
788 is_marked ? c = false ∧ t2 = t1.
791 lemma is_marked_to_exists: ∀alpha,c. is_marked alpha c = true →
795 lemma sem_comp_step :
796 accRealize ? comp_step (inr … (inl … (inr … start_nop)))
797 R_comp_step_true R_comp_step_false.
798 @(acc_sem_if_app … (sem_test_char ? (is_marked ?))
799 (sem_comp_step_subcase FSUnialpha 〈bit false,true〉 ??
800 (sem_comp_step_subcase FSUnialpha 〈bit true,true〉 ??
801 (sem_comp_step_subcase FSUnialpha 〈null,true〉 ??
802 (sem_clear_mark …))))
804 [#intape #outtape #midtape * * * #c #b * #Hcurrent
805 whd in ⊢ ((??%?)→?); #Hb #Hmidtape >Hmidtape -Hmidtape
806 cases (current_to_midtape … Hcurrent) #ls * #rs >Hb #Hintape >Hintape -Hb
807 whd in ⊢ (%→?); #Htapea lapply (Htapea … (refl …)) -Htapea
808 cases (true_or_false (c == bit false))
809 [(* c = bit false *) #Hc * [2: * >(\P Hc) * #H @False_ind @H //]
813 [ #Hstate lapply (H1 Hstate) -H1 -Hstate -H2 *
814 #ta * whd in ⊢ (%→?); #Hleft #Hright #ls #c #rs #Hintape
815 >Hintape in Hleft; * *
816 cases c in Hintape; #c' #b #Hintape #x * whd in ⊢ (??%?→?); #H destruct (H)
817 whd in ⊢ (??%?→?); #Hb >Hb #Hta @(ex_intro ?? c') % //
819 [ * #Hc' #H1 % % [destruct (Hc') % ]
820 #a #l1 #c0 #a0 #l2 #Hrs >Hrs in Hintape; #Hintape #Hl1
822 [ * #Htmp >Htmp -Htmp #Houtc % % // @Houtc
823 | * #Hneq #Houtc %2 %
827 | * #Hc #Helse1 cases (Helse1 … Hta)
828 [ * #Hc' #H1 % % [destruct (Hc') % ]
829 #a #l1 #c0 #a0 #l2 #Hrs >Hrs in Hintape; #Hintape #Hl1
831 [ * #Htmp >Htmp -Htmp #Houtc % % // @Houtc
832 | * #Hneq #Houtc %2 %
836 | * #Hc' #Helse2 cases (Helse2 … Hta)
837 [ * #Hc'' #H1 % % [destruct (Hc'') % ]
838 #a #l1 #c0 #a0 #l2 #Hrs >Hrs in Hintape; #Hintape #Hl1
840 [ * #Htmp >Htmp -Htmp #Houtc % % // @Houtc
841 | * #Hneq #Houtc %2 %
845 | * #Hc'' whd in ⊢ (%→?); #Helse3 %2 %
846 [ generalize in match Hc''; generalize in match Hc'; generalize in match Hc;
848 [ * [ #_ #Hfalse @False_ind @(absurd ?? Hfalse) %
849 | #Hfalse @False_ind @(absurd ?? Hfalse) % ]
850 | #_ #_ #Hfalse @False_ind @(absurd ?? Hfalse) %
857 | #Hstate lapply (H2 Hstate) -H1 -Hstate -H2 *
858 #ta * whd in ⊢ (%→%→?); #Hleft #Hright #ls #c #rs #Hintape
859 >Hintape in Hleft; * #Hc #Hta % [@Hc % | >Hright //]
862 definition R_comp_step_true ≝
864 ∀l0,c,rs.t1 = midtape (FinProd … FSUnialpha FinBool) l0 c rs →
866 ((bit_or_null c' = true ∧
868 rs = 〈a,false〉::l1@〈c0,true〉::〈a0,false〉::l2 →
869 (∀c.memb ? c l1 = true → is_marked ? c = false) →
871 t2 = midtape ? (〈c',false〉::l0) 〈a,true〉 (l1@〈c0,false〉::〈a0,true〉::l2)) ∨
873 t2 = midtape (FinProd … FSUnialpha FinBool)
874 (reverse ? l1@〈a,false〉::〈c',true〉::l0) 〈c0,false〉 (〈a0,false〉::l2))) ∨
875 (bit_or_null c' = false ∧ t2 = midtape ? l0 〈c',false〉 rs)).
877 definition R_comp_step_false ≝
879 ∀ls,c,rs.t1 = midtape (FinProd … FSUnialpha FinBool) ls c rs →
880 is_marked ? c = false ∧ t2 = t1.
882 lemma sem_comp_step :
883 accRealize ? comp_step (inr … (inl … (inr … start_nop)))
884 R_comp_step_true R_comp_step_false.
886 cases (acc_sem_if … (sem_test_char ? (is_marked ?))
887 (sem_comp_step_subcase FSUnialpha 〈bit false,true〉 ??
888 (sem_comp_step_subcase FSUnialpha 〈bit true,true〉 ??
889 (sem_comp_step_subcase FSUnialpha 〈null,true〉 ??
890 (sem_clear_mark …))))
892 #k * #outc * * #Hloop #H1 #H2
893 @(ex_intro ?? k) @(ex_intro ?? outc) %
894 [ % [@Hloop ] ] -Hloop
895 [ #Hstate lapply (H1 Hstate) -H1 -Hstate -H2 *
896 #ta * whd in ⊢ (%→?); #Hleft #Hright #ls #c #rs #Hintape
897 >Hintape in Hleft; * *
898 cases c in Hintape; #c' #b #Hintape #x * whd in ⊢ (??%?→?); #H destruct (H)
899 whd in ⊢ (??%?→?); #Hb >Hb #Hta @(ex_intro ?? c') % //
901 [ * #Hc' #H1 % % [destruct (Hc') % ]
902 #a #l1 #c0 #a0 #l2 #Hrs >Hrs in Hintape; #Hintape #Hl1
904 [ * #Htmp >Htmp -Htmp #Houtc % % // @Houtc
905 | * #Hneq #Houtc %2 %
909 | * #Hc #Helse1 cases (Helse1 … Hta)
910 [ * #Hc' #H1 % % [destruct (Hc') % ]
911 #a #l1 #c0 #a0 #l2 #Hrs >Hrs in Hintape; #Hintape #Hl1
913 [ * #Htmp >Htmp -Htmp #Houtc % % // @Houtc
914 | * #Hneq #Houtc %2 %
918 | * #Hc' #Helse2 cases (Helse2 … Hta)
919 [ * #Hc'' #H1 % % [destruct (Hc'') % ]
920 #a #l1 #c0 #a0 #l2 #Hrs >Hrs in Hintape; #Hintape #Hl1
922 [ * #Htmp >Htmp -Htmp #Houtc % % // @Houtc
923 | * #Hneq #Houtc %2 %
927 | * #Hc'' whd in ⊢ (%→?); #Helse3 %2 %
928 [ generalize in match Hc''; generalize in match Hc'; generalize in match Hc;
930 [ * [ #_ #Hfalse @False_ind @(absurd ?? Hfalse) %
931 | #Hfalse @False_ind @(absurd ?? Hfalse) % ]
932 | #_ #_ #Hfalse @False_ind @(absurd ?? Hfalse) %
939 | #Hstate lapply (H2 Hstate) -H1 -Hstate -H2 *
940 #ta * whd in ⊢ (%→%→?); #Hleft #Hright #ls #c #rs #Hintape
941 >Hintape in Hleft; * #Hc #Hta % [@Hc % | >Hright //]
946 whileTM ? comp_step (inr … (inl … (inr … start_nop))).
949 definition R_compare :=
953 ∀ls,c,b,rs.t1 = midtape ? ls 〈c,b〉 rs →
954 (b = true → rs = ....) →
958 rs = cs@l1@〈c0,true〉::cs0@l2
962 ls 〈c,b〉 cs l1 〈c0,b0〉 cs0 l2
966 ls (hd (Ls@〈grid,false〉))* (tail (Ls@〈grid,false〉)) l1 (hd (Ls@〈comma,false〉))* (tail (Ls@〈comma,false〉)) l2
967 ^^^^^^^^^^^^^^^^^^^^^^^
969 ls Ls 〈grid,false〉 l1 Ls 〈comma,true〉 l2
974 ls (hd (Ls@〈c,false〉))* (tail (Ls@〈c,false〉)) l1 (hd (Ls@〈d,false〉))* (tail (Ls@〈d,false〉)) l2
975 ^^^^^^^^^^^^^^^^^^^^^^^
978 ls Ls 〈c,true〉 l1 Ls 〈d,false〉 l2
984 (∃la,d.〈b,true〉::bs = la@[〈grid,d〉] ∧ ∀x.memb ? x la → is_bit (\fst x) = true) →
985 (∃lb,d0.〈b0,true〉::b0s = lb@[〈comma,d0〉] ∧ ∀x.memb ? x lb → is_bit (\fst x) = true) →
986 t1 = midtape ? l0 〈b,true〉 (bs@l1@〈b0,true〉::b0s@l2 →
988 mk_tape left (option current) right
990 (b = grid ∧ b0 = comma ∧ bs = [] ∧ b0s = [] ∧
991 t2 = midtape ? l0 〈grid,false〉 (l1@〈comma,true〉::l2)) ∨
992 (b = bit x ∧ b = c ∧ bs = b0s
994 definition R_compare :=
996 ∀ls,c,rs.t1 = midtape (FinProd … FSUnialpha FinBool) ls c rs →
997 (∀c'.bit_or_null c' = false → c = 〈c',true〉 → t2 = midtape ? ls 〈c',false〉 rs) ∧
998 (∀c'. c = 〈c',false〉 → t2 = t1) ∧
1001 (∀c.memb (FinProd … FSUnialpha FinBool) c bs = true → bit_or_null (\fst c) = true) →
1002 (∀c.memb (FinProd … FSUnialpha FinBool) c b0s = true → bit_or_null (\fst c) = true) →
1003 (∀c.memb ? c bs = true → is_marked ? c = false) →
1004 (∀c.memb ? c b0s = true → is_marked ? c = false) →
1005 (∀c.memb ? c l1 = true → is_marked ? c = false) →
1006 c = 〈b,true〉 → bit_or_null b = true →
1007 rs = bs@〈grid,false〉::l1@〈b0,true〉::b0s@〈comma,false〉::l2 →
1008 (〈b,true〉::bs = 〈b0,true〉::b0s ∧
1009 t2 = midtape ? (reverse ? bs@〈b,false〉::ls)
1010 〈grid,false〉 (l1@〈b0,false〉::b0s@〈comma,true〉::l2)) ∨
1011 (∃la,c',d',lb,lc.c' ≠ d' ∧
1012 〈b,false〉::bs = la@〈c',false〉::lb ∧
1013 〈b0,false〉::b0s = la@〈d',false〉::lc ∧
1014 t2 = midtape (FinProd … FSUnialpha FinBool) (reverse ? la@
1020 〈d',false〉 (lc@〈comma,false〉::l2)).
1022 lemma wsem_compare : WRealize ? compare R_compare.
1024 lapply (sem_while ?????? sem_comp_step t i outc Hloop) [%]
1025 -Hloop * #t1 * #Hstar @(star_ind_l ??????? Hstar)
1026 [ #tapea whd in ⊢ (%→?); #Rfalse #ls #c #rs #Htapea %
1028 [ #c' #Hc' #Hc lapply (Rfalse … Htapea) -Rfalse * >Hc
1029 whd in ⊢ (??%?→?); #Hfalse destruct (Hfalse)
1030 | #c' #Hc lapply (Rfalse … Htapea) -Rfalse * #_
1032 | #b #b0 #bs #b0s #l1 #l2 #Hlen #Hbs1 #Hb0s1 #Hbs2 #Hb0s2 #Hl1 #Hc
1033 cases (Rfalse … Htapea) -Rfalse >Hc whd in ⊢ (??%?→?);#Hfalse destruct (Hfalse)
1035 | #tapea #tapeb #tapec #Hleft #Hright #IH #Htapec lapply (IH Htapec) -Htapec -IH #IH
1036 whd in Hleft; #ls #c #rs #Htapea cases (Hleft … Htapea) -Hleft
1037 #c' * #Hc >Hc cases (true_or_false (bit_or_null c')) #Hc'
1039 [ * >Hc' #H @False_ind destruct (H)
1040 | * #_ #Htapeb cases (IH … Htapeb) * #_ #H #_ %
1042 [#c1 #Hc1 #Heqc destruct (Heqc) <Htapeb @(H c1) %
1043 |#c1 #Hfalse destruct (Hfalse)
1045 |#b #b0 #bs #b0s #l1 #l2 #_ #_ #_ #_ #_ #_
1046 #Heq destruct (Heq) >Hc' #Hfalse @False_ind destruct (Hfalse)
1051 [ #c'' #Hc'' #Heq destruct (Heq) >Hc'' in Hc'; #H destruct (H)
1052 | #c0 #Hfalse destruct (Hfalse)
1054 |#b #b0 #bs #b0s #l1 #l2 #Hlen #Hbs1 #Hb0s1 #Hbs2 #Hb0s2 #Hl1
1055 #Heq destruct (Heq) #_ #Hrs cases Hleft -Hleft
1056 [2: * >Hc' #Hfalse @False_ind destruct ] * #_
1057 @(list_cases2 … Hlen)
1058 [ #Hbs #Hb0s generalize in match Hrs; >Hbs in ⊢ (%→?); >Hb0s in ⊢ (%→?);
1059 -Hrs #Hrs normalize in Hrs; #Hleft cases (Hleft ????? Hrs ?) -Hleft
1060 [ * #Heqb #Htapeb cases (IH … Htapeb) -IH * #IH #_ #_
1062 [ >Heqb >Hbs >Hb0s %
1065 |* #Hneqb #Htapeb %2
1066 @(ex_intro … [ ]) @(ex_intro … b)
1067 @(ex_intro … b0) @(ex_intro … [ ])
1069 [ % [ % [@sym_not_eq //| >Hbs %] | >Hb0s %]
1070 | cases (IH … Htapeb) -IH * #_ #IH #_ >(IH ? (refl ??))
1074 | * #b' #bitb' * #b0' #bitb0' #bs' #b0s' #Hbs #Hb0s
1075 generalize in match Hrs; >Hbs in ⊢ (%→?); >Hb0s in ⊢ (%→?);
1076 cut (bit_or_null b' = true ∧ bit_or_null b0' = true ∧
1077 bitb' = false ∧ bitb0' = false)
1078 [ % [ % [ % [ >Hbs in Hbs1; #Hbs1 @(Hbs1 〈b',bitb'〉) @memb_hd
1079 | >Hb0s in Hb0s1; #Hb0s1 @(Hb0s1 〈b0',bitb0'〉) @memb_hd ]
1080 | >Hbs in Hbs2; #Hbs2 @(Hbs2 〈b',bitb'〉) @memb_hd ]
1081 | >Hb0s in Hb0s2; #Hb0s2 @(Hb0s2 〈b0',bitb0'〉) @memb_hd ]
1082 | * * * #Ha #Hb #Hc #Hd >Hc >Hd
1084 cases (Hleft b' (bs'@〈grid,false〉::l1) b0 b0'
1085 (b0s'@〈comma,false〉::l2) ??) -Hleft
1086 [ 3: >Hrs normalize @eq_f >associative_append %
1087 | * #Hb0 #Htapeb cases (IH …Htapeb) -IH * #_ #_ #IH
1088 cases (IH b' b0' bs' b0s' (l1@[〈b0,false〉]) l2 ??????? Ha ?) -IH
1090 [ >Hb0 @eq_f >Hbs in Heq; >Hb0s in ⊢ (%→?); #Heq
1091 destruct (Heq) >Hb0s >Hc >Hd %
1092 | >Houtc >Hbs >Hb0s >Hc >Hd >reverse_cons >associative_append
1093 >associative_append %
1095 | * #la * #c' * #d' * #lb * #lc * * * #H1 #H2 #H3 #H4 %2
1096 @(ex_intro … (〈b,false〉::la)) @(ex_intro … c') @(ex_intro … d')
1097 @(ex_intro … lb) @(ex_intro … lc)
1098 % [ % [ % // >Hbs >Hc >H2 % | >Hb0s >Hd >H3 >Hb0 % ]
1099 | >H4 >Hbs >Hb0s >Hc >Hd >Hb0 >reverse_append
1100 >reverse_cons >reverse_cons
1101 >associative_append >associative_append
1102 >associative_append >associative_append %
1104 | generalize in match Hlen; >Hbs >Hb0s
1105 normalize #Hlen destruct (Hlen) @e0
1106 | #c0 #Hc0 @Hbs1 >Hbs @memb_cons //
1107 | #c0 #Hc0 @Hb0s1 >Hb0s @memb_cons //
1108 | #c0 #Hc0 @Hbs2 >Hbs @memb_cons //
1109 | #c0 #Hc0 @Hb0s2 >Hb0s @memb_cons //
1110 | #c0 #Hc0 cases (memb_append … Hc0)
1111 [ @Hl1 | #Hc0' >(memb_single … Hc0') % ]
1113 | >associative_append >associative_append % ]
1114 | * #Hneq #Htapeb %2
1115 @(ex_intro … []) @(ex_intro … b) @(ex_intro … b0)
1116 @(ex_intro … bs) @(ex_intro … b0s) %
1117 [ % // % // @sym_not_eq //
1118 | >Hbs >Hb0s >Hc >Hd >reverse_cons >associative_append
1119 >reverse_append in Htapeb; >reverse_cons
1120 >associative_append >associative_append
1122 cases (IH … Htapeb) -Htapeb -IH * #_ #IH #_ @(IH ? (refl ??))
1124 | #c1 #Hc1 cases (memb_append … Hc1) #Hyp
1125 [ @Hbs2 >Hbs @memb_cons @Hyp
1126 | cases (orb_true_l … Hyp)
1127 [ #Hyp2 >(\P Hyp2) %
1135 axiom sem_compare : Realize ? compare R_compare.