*)
include "turing/universal/copy.ma".
+include "turing/universal/move_tape.ma".
+include "turing/universal/match_machines.ma".
(*
*)
definition init_match ≝
- seq ? (mark ?)
- (seq ? (adv_to_mark_r ? (λc:STape.is_grid (\fst c)))
- (seq ? (move_r ?)
- (seq ? (mark ?)
- (seq ? (move_l ?)
- (adv_to_mark_l ? (is_marked ?)))))).
-
+ mark ? · adv_to_mark_r ? (λc:STape.is_grid (\fst c)) · move_r ? ·
+ move_r ? · mark ? · move_l ? · adv_to_mark_l ? (is_marked ?).
+
definition R_init_match ≝ λt1,t2.
∀ls,l,rs,c,d. no_grids (〈c,false〉::l) → no_marks l →
- t1 = midtape STape ls 〈c,false〉 (l@〈grid,false〉::〈d,false〉::rs) →
- t2 = midtape STape ls 〈c,true〉 (l@〈grid,false〉::〈d,true〉::rs).
+ t1 = midtape STape ls 〈c,false〉 (l@〈grid,false〉::〈bar,false〉::〈d,false〉::rs) →
+ t2 = midtape STape ls 〈c,true〉 (l@〈grid,false〉::〈bar,false〉::〈d,true〉::rs).
lemma sem_init_match : Realize ? init_match R_init_match.
#intape
cases (sem_seq ????? (sem_mark ?)
(sem_seq ????? (sem_adv_to_mark_r ? (λc:STape.is_grid (\fst c)))
(sem_seq ????? (sem_move_r ?)
- (sem_seq ????? (sem_mark ?)
- (sem_seq ????? (sem_move_l ?)
- (sem_adv_to_mark_l ? (is_marked ?)))))) intape)
+ (sem_seq ????? (sem_move_r ?)
+ (sem_seq ????? (sem_mark ?)
+ (sem_seq ????? (sem_move_l ?)
+ (sem_adv_to_mark_l ? (is_marked ?))))))) intape)
#k * #outc * #Hloop #HR
@(ex_intro ?? k) @(ex_intro ?? outc) % [@Hloop] -Hloop
#ls #l #rs #c #d #Hnogrids #Hnomarks #Hintape
* #tb * whd in ⊢ (%→?); #Htb cases (Htb … Hta) -Htb -Hta
[* #Hgridc @False_ind @(absurd … Hgridc) @eqnot_to_noteq
@(Hnogrids 〈c,false〉) @memb_hd ]
-* #Hgrdic #Htb lapply (Htb l 〈grid,false〉 (〈d,false〉::rs) (refl …) (refl …) ?)
+* #Hgrdic #Htb lapply (Htb l 〈grid,false〉 (〈bar,false〉::〈d,false〉::rs) (refl …) (refl …) ?)
[#x #membl @Hnogrids @memb_cons @membl] -Htb #Htb
* #tc * whd in ⊢ (%→?); #Htc lapply (Htc … Htb) -Htc -Htb #Htc
* #td * whd in ⊢ (%→?); #Htd lapply (Htd … Htc) -Htd -Htc #Htd
* #te * whd in ⊢ (%→?); #Hte lapply (Hte … Htd) -Hte -Htd #Hte
-whd in ⊢ (%→?); #Htf cases (Htf … Hte) -Htf -Hte
+* #tf * whd in ⊢ (%→?); #Htf lapply (Htf … Hte) -Htf -Hte #Htf
+whd in ⊢ (%→?); #Htg cases (Htg … Htf) -Htg -Htf
[* whd in ⊢ ((??%?)→?); #Habs destruct (Habs)]
-* #_ #Htf lapply (Htf (reverse ? l) 〈c,true〉 ls (refl …) (refl …) ?)
- [#x #membl @Hnomarks @daemon] -Htf #Htf >Htf >reverse_reverse %
+* #_ #Htg lapply (Htg (〈grid,false〉::reverse ? l) 〈c,true〉 ls (refl …) (refl …) ?)
+ [#x #membl @Hnomarks @daemon] -Htg #Htg >Htg >reverse_cons >reverse_reverse
+ >associative_append %
qed.
-
(* init_copy
init_current_on_match; (* no marks in current *)
*)
definition init_copy ≝
- seq ? init_current_on_match
- (seq ? (move_r ?)
- (seq ? (adv_to_mark_r ? (is_marked ?))
- (adv_mark_r ?))).
+ init_current_on_match · move_r ? ·
+ adv_to_mark_r ? (is_marked ?) · adv_mark_r ?.
definition R_init_copy ≝ λt1,t2.
∀l1,l2,c,ls,d,rs.
]
qed. *)
-include "turing/universal/move_tape.ma".
+definition exec_action ≝
+ init_copy · copy · move_r … · move_tape.
-definition exec_move ≝
- seq ? init_copy
- (seq ? copy
- (seq ? (move_r …) move_tape)).
+definition map_move ≝
+ λc,mv.match c with [ null ⇒ None ? | _ ⇒ Some ? 〈c,false,move_of_unialpha mv〉 ].
-definition R_exec_move ≝ λt1,t2.
+(* - aggiungere a legal_tape le condizioni
+ only_bits ls, rs; bit_or_null c
+ - ci vuole un lemma che dimostri
+ bit_or_null c1 = true bit_or_null mv = true
+ mv ≠ null → c1 ≠ null
+ dal fatto che c1 e mv sono contenuti nella table
+ *)
+definition R_exec_action ≝ λt1,t2.
∀n,curconfig,ls,rs,c0,c1,s0,s1,table1,newconfig,mv,table2.
table_TM n (table1@〈comma,false〉::〈s1,false〉::newconfig@〈c1,false〉::〈comma,false〉::〈mv,false〉::table2) →
- no_marks curconfig → only_bits (curconfig@[〈s0,false〉]) → only_bits (〈s1,false〉::newconfig) →
- no_nulls ls → no_nulls rs →
+ no_marks curconfig → only_bits (curconfig@[〈s0,false〉]) →
+ only_bits (〈s1,false〉::newconfig) → bit_or_null c1 = true →
+ |curconfig| = |newconfig| →
+ legal_tape ls 〈c0,false〉 rs →
t1 = midtape STape (〈c0,false〉::curconfig@〈s0,false〉::〈grid,false〉::ls) 〈grid,false〉
(table1@〈comma,true〉::〈s1,false〉::newconfig@〈c1,false〉::〈comma,false〉::〈mv,false〉::table2@〈grid,false〉::rs) →
∀t1'.t1' = lift_tape ls 〈c0,false〉 rs →
(〈s1,false〉::newconfig@〈c2,false〉::〈grid,false〉::
table1@〈comma,false〉::〈s1,false〉::newconfig@〈c1,false〉::〈comma,false〉::〈mv,false〉::table2@〈grid,false〉::rs1) ∧
lift_tape ls1 〈c2,false〉 rs1 =
- tape_move STape t1' (Some ? 〈〈c2,false〉,move_of_unialpha mv〉).
+ tape_move STape t1' (map_move c1 mv) ∧ legal_tape ls1 〈c2,false〉 rs1.
-lemma sem_exec_move : Realize ? exec_move R_exec_move.
+(* move the following 2 lemmata to mono.ma *)
+lemma tape_move_left_eq :
+ ∀A.∀t:tape A.∀c.
+ tape_move ? t (Some ? 〈c,L〉) =
+ tape_move_left ? (left ? t) c (right ? t).
+//
+qed.
+
+lemma tape_move_right_eq :
+ ∀A.∀t:tape A.∀c.
+ tape_move ? t (Some ? 〈c,R〉) =
+ tape_move_right ? (left ? t) c (right ? t).
+//
+qed.
+
+lemma lift_tape_not_null :
+ ∀ls,c,bc,rs.c ≠ null → lift_tape ls 〈c,bc〉 rs = midtape ? ls 〈c,bc〉 rs.
+#ls #c #bc #rs cases c //
+#Hfalse @False_ind /2/
+qed.
+
+lemma merge_char_not_null :
+ ∀c1,c2.c1 ≠ null → merge_char c1 c2 ≠ null.
+#c1 #c2 @not_to_not cases c2
+[ #c1' normalize #Hfalse destruct (Hfalse)
+| normalize //
+| *: normalize #Hfalse destruct (Hfalse)
+]
+qed.
+
+lemma merge_char_null : ∀c.merge_char null c = c.
+* //
+qed.
+
+lemma merge_char_cases : ∀c1,c2.merge_char c1 c2 = c1 ∨ merge_char c1 c2 = c2.
+#c1 *
+[ #c1' %2 %
+| % %
+| *: %2 % ]
+qed.
+
+(* lemma merge_char_c_bit :
+ ∀c1,c2.is_bit c2 = true → merge_char c1 c2 = c2.
+#c1 *
+[ #c2' #_ %
+|*: normalize #Hfalse destruct (Hfalse) ]
+qed.
+
+lemma merge_char_c_bit :
+ ∀c1,c2.is_null c2 = true → merge_char c1 c2 = c1.
+#c1 *
+[ #c2' #_ %
+|*: normalize #Hfalse destruct (Hfalse) ]
+qed.
+
+*)
+
+lemma sem_exec_action : Realize ? exec_action R_exec_action.
#intape
cases (sem_seq … sem_init_copy
(sem_seq … sem_copy
#k * #outc * #Hloop #HR
@(ex_intro ?? k) @(ex_intro ?? outc) % [ @Hloop ] -Hloop
#n #curconfig #ls #rs #c0 #c1 #s0 #s1 #table1 #newconfig #mv #table2
-#Htable #Hcurconfig1 #Hcurconfig2 #Hnewconfig #Hls #Hrs #Hintape #t1' #Ht1'
+#Htable #Hcurconfig1 #Hcurconfig2 #Hnewconfig #Hc1 #Hlen #Htape #Hintape #t1' #Ht1'
cases HR -HR #ta * whd in ⊢ (%→?); #Hta
lapply (Hta (〈c0,false〉::curconfig) table1 s0 ls s1
(newconfig@〈c1,false〉::〈comma,false〉::〈mv,false〉::table2@〈grid,false〉::rs) … Hintape) -Hta
[ (*Hcurconfig2*) @daemon
| (*Htable*) @daemon
-| (*FIXME*) @daemon
-| (*FIXME*) @daemon
+| (*bit_or_null c0 = true *) @daemon
+| (*Hcurconfig1*) @daemon
| #Hta * #tb * whd in ⊢ (%→?); #Htb
lapply (Htb (〈grid,false〉::ls) s0 s1 c0 c1 (〈mv,false〉::table2@〈grid,false〉::rs) newconfig (〈comma,false〉::reverse ? table1) curconfig Hta ????????) -Htb
- [9:|*:(* rivedere le precondizioni *) @daemon ]
+ [9:|*:(* bit_or_null c0,c1; |curconfig| = |newconfig|*) @daemon ]
#Htb * #tc * whd in ⊢ (%→?); #Htc lapply (Htc … Htb) -Htc whd in ⊢(???(??%%%)→?);#Htc
whd in ⊢ (%→?); #Houtc whd in Htc:(???%); whd in Htc:(???(??%%%));
lapply (Houtc rs n
- (〈comma,false〉::〈s1,false〉::reverse ? newconfig@@〈comma,false〉::reverse ? table1)
- mv table2 (merge_char curc d1) (merge_config curconfig (reverse ? newconfig1)) ls ?????
- Hls Hrs ??)
- [3: >Htc @(eq_f3 … (midtape ?))
- [ @eq_f >associative_append >Hnewconfig
- >reverse_cons >associative_append @eq_f
- whd in ⊢ (???%); @eq_f whd in ⊢ (???%); @eq_f
- <Heqcurconfig <reverse_cons >Hnewconfig1 >reverse_append
- >merge_cons %
+ (〈comma,false〉::〈c1,false〉::reverse ? newconfig@〈s1,false〉::〈comma,false〉::reverse ? table1)
+ mv table2 (merge_char c0 c1) (reverse ? newconfig@[〈s1,false〉]) ls ????????)
+ [3: cases Htape -Htape * * #Hnomarks #Hbits #Hc0 #Hlsrs % [ % [ %
+ [ #x #Hx cases (orb_true_l … Hx) #Hx'
+ [ >(\P Hx') %
+ | @Hnomarks @memb_cons // ]
+ | @Hbits ]
+ | cases (merge_char_cases c0 c1) #Hmerge >Hmerge // ]
+ | cases (true_or_false (c0 == null)) #Hc0'
+ [ cases Hlsrs -Hlsrs
+ [ *
+ [ >(\P Hc0') * #Hfalse @False_ind /2/
+ | #Hlsnil % %2 // ]
+ | #Hrsnil %2 // ]
+ | % % @merge_char_not_null @(\Pf Hc0') ] ]
+ |4:>Htc @(eq_f3 … (midtape ?))
+ [ @eq_f @eq_f >associative_append >associative_append %
| %
| % ]
| %
- || >reverse_cons >reverse_append >reverse_reverse >reverse_cons
- >reverse_reverse
+ || >reverse_cons >reverse_cons >reverse_append >reverse_reverse
+ >reverse_cons >reverse_cons >reverse_reverse
>associative_append >associative_append >associative_append
- normalize @Htable
- | (* only bits or nulls c1,c2 → only bits or nulls (merge c1 c2) *) @daemon
- | (* add to hyps? *) @daemon
- | (* bit_or_null c1,c2 → bit_or_null (merge_char c1 c2) *) @daemon
- | -Houtc * #ls1 * #rs1 * #newc * #Houtc *
+ >associative_append >associative_append
+ @Htable
+ | (* well formedness of table *) @daemon
+ | (* Hnewconfig *) @daemon
+ | (* bit_or_null mv = true (well formedness of table) *) @daemon
+ | -Houtc * #ls1 * #rs1 * #newc * #Hnewtapelegal * #Houtc *
[ *
[ * #Hmv #Htapemove
- @(ex_intro ?? ls1) @(ex_intro ?? rs1) @(ex_intro ?? (\fst newc))
+ @(ex_intro ?? ls1) @(ex_intro ?? rs1) @(ex_intro ?? newc)
%
- [ >Houtc >reverse_merge_config [| @daemon ]
- >reverse_reverse @eq_f
- >reverse_cons >reverse_append >reverse_cons
- >reverse_reverse >reverse_reverse
- @daemon
- | >Hmv >Ht1' whd in Htapemove:(???%); whd in ⊢ (???%);
- whd in match (lift_tape ???) in ⊢ (???%);
- >Htapemove
-
-
+ [ %
+ [ >Houtc -Houtc >reverse_append
+ >reverse_reverse >reverse_single @eq_f
+ >reverse_cons >reverse_cons >reverse_append >reverse_cons
+ >reverse_cons >reverse_reverse >reverse_reverse
+ >associative_append >associative_append
+ >associative_append >associative_append
+ >associative_append >associative_append %
+ | >Hmv >Ht1' >Htapemove
+ (* mv = bit false -→ c1 = bit ? *)
+ cut (∃c1'.c1 = bit c1') [ @daemon ] * #c1' #Hc1
+ >Hc1 >tape_move_left_eq >(legal_tape_left … Htape)
+ >(legal_tape_right … Htape) %
+ ]
+ | //
+ ]
+ | * #Hmv #Htapemove
+ @(ex_intro ?? ls1) @(ex_intro ?? rs1) @(ex_intro ?? newc) %
+ [ %
+ [ >Houtc -Houtc >reverse_append
+ >reverse_reverse >reverse_single @eq_f
+ >reverse_cons >reverse_cons >reverse_append >reverse_cons
+ >reverse_cons >reverse_reverse >reverse_reverse
+ >associative_append >associative_append
+ >associative_append >associative_append
+ >associative_append >associative_append %
+ |>Hmv >Ht1' >Htapemove
+ cut (∃c1'.c1 = bit c1') [ @daemon ] * #c1' #Hc1
+ >Hc1 >tape_move_right_eq >(legal_tape_left … Htape)
+ >(legal_tape_right … Htape) %
+ ]
+ | //
+ ]
+ ]
+ | * * * #Hmv #Hlseq #Hrseq #Hnewc
+ @(ex_intro ?? ls1) @(ex_intro ?? rs1) @(ex_intro ?? newc) %
+ [ %
+ [ >Houtc -Houtc >reverse_append
+ >reverse_reverse >reverse_single @eq_f
+ >reverse_cons >reverse_cons >reverse_append >reverse_cons
+ >reverse_cons >reverse_reverse >reverse_reverse
+ >associative_append >associative_append
+ >associative_append >associative_append
+ >associative_append >associative_append %
+ |>Hmv >Ht1' cases c1 in Hnewc;
+ [ #c1' whd in ⊢ (??%?→?);#Hnewc <Hnewc
+ >Hlseq >Hrseq whd in ⊢ (??%%);
+ >(legal_tape_left … Htape) >(legal_tape_right … Htape) %
+ | whd in ⊢ (??%?→?); #Hnewc >Hnewc >Hlseq >Hrseq %
+ |*: whd in ⊢ (??%?→?);#Hnewc <Hnewc
+ >Hlseq >Hrseq whd in ⊢ (??%%);
+ >(legal_tape_left … Htape) >(legal_tape_right … Htape) %
+ ]
+ ]
+ | //
+ ]
+ ]
+ ]
+]
+qed.
+
+(*
+if is_false(current) (* current state is not final *)
+ then init_match;
+ match_tuple;
+ if is_marked(current) = false (* match ok *)
+ then
+ exec_action
+ move_r;
+ else sink;
+ else nop;
+*)
+
+definition uni_step ≝
+ ifTM ? (test_char STape (λc.\fst c == bit false))
+ (single_finalTM ?
+ (init_match · match_tuple ·
+ (ifTM ? (test_char ? (λc.¬is_marked ? c))
+ (exec_action · move_r …)
+ (nop ?) tc_true)))
+ (nop ?) tc_true.
+
+definition R_uni_step_true ≝ λt1,t2.
+ ∀n,table,s0,s1,c0,c1,ls,rs,curconfig,newconfig,mv.
+ 0 < |table| → table_TM (S n) table →
+ match_in_table (S n) (〈s0,false〉::curconfig) 〈c0,false〉
+ (〈s1,false〉::newconfig) 〈c1,false〉 〈mv,false〉 table →
+ legal_tape ls 〈c0,false〉 rs →
+ t1 = midtape STape (〈grid,false〉::ls) 〈s0,false〉
+ (curconfig@〈c0,false〉::〈grid,false〉::table@〈grid,false〉::rs) →
+ ∀t1'.t1' = lift_tape ls 〈c0,false〉 rs →
+ s0 = bit false ∧
+ ∃ls1,rs1,c2.
+ (t2 = midtape STape (〈grid,false〉::ls1) 〈s1,false〉
+ (newconfig@〈c2,false〉::〈grid,false〉::table@〈grid,false〉::rs1) ∧
+ lift_tape ls1 〈c2,false〉 rs1 =
+ tape_move STape t1' (map_move c1 mv) ∧ legal_tape ls1 〈c2,false〉 rs1).
+
+definition R_uni_step_false ≝ λt1,t2.
+ ∀b. current STape t1 = Some ? 〈bit b,false〉 → b = true ∧ t2 = t1.
- >Heqcurconfig
->append_cons in Hintape; >associative_append
-cases (Hta
-
- cases (Hta … Hintape) -Hta
-[ * normalize in ⊢ (%→?); #Hfalse destruct (Hfalse) ]
-* #_ #Hta lapply (Hta ? 〈comma,true〉 … (refl ??) (refl ??) ?)
-[ @daemon ] -Hta #Hta
-* #tb * whd in ⊢ (%→?); #Htb lapply (Htb … Hta)
-
-definition move_of_unialpha ≝
- λc.match c with
- [ bit x ⇒ match x with [ true ⇒ R | false ⇒ L ]
- | _ ⇒ N ].
-
-definition R_uni_step ≝ λt1,t2.
- ∀n,table,c,c1,ls,rs,curs,curc,news,newc,mv.
- table_TM n table →
- match_in_table (〈c,false〉::curs@[〈curc,false〉])
- (〈c1,false〉::news@[〈newc,false〉]) mv table →
- t1 = midtape STape (〈grid,false〉::ls) 〈c,false〉
- (curs@〈curc,false〉::〈grid,false〉::table@〈grid,false〉::rs) →
- ∀t1',ls1,rs1.t1' = lift_tape ls 〈curc,false〉 rs →
- (t2 = midtape STape (〈grid,false〉::ls1) 〈c1,false〉
- (news@〈newc,false〉::〈grid,false〉::table@〈grid,false〉::rs1) ∧
- lift_tape ls1 〈newc,false〉 rs1 =
- tape_move STape t1' (Some ? 〈〈newc,false〉,move_of_unialpha mv〉)).
-
-definition no_nulls ≝
- λl:list STape.∀x.memb ? x l = true → is_null (\fst x) = false.
-
+axiom sem_match_tuple : Realize ? match_tuple R_match_tuple.
+
+definition us_acc : states ? uni_step ≝ (inr … (inl … (inr … start_nop))).
+
+lemma sem_uni_step :
+ accRealize ? uni_step us_acc
+ R_uni_step_true R_uni_step_false.
+@(acc_sem_if_app STape … (sem_test_char ? (λc:STape.\fst c == bit false))
+ (sem_seq … sem_init_match
+ (sem_seq … sem_match_tuple
+ (sem_if … (* ????????? (sem_test_char … (λc.¬is_marked FSUnialpha c)) *)
+ (sem_seq … sem_exec_action (sem_move_r …))
+ (sem_nop …))))
+ (sem_nop …)
+ …)
+[@sem_test_char||]
+[ #intape #outtape
+ #ta whd in ⊢ (%→?); #Hta #HR
+ #n #fulltable #s0 #s1 #c0 #c1 #ls #rs #curconfig #newconfig #mv
+ #Htable_len cut (∃t0,table. fulltable =〈bar,false〉::〈t0,false〉::table) [(* 0 < |table| *) @daemon]
+ * #t0 * #table #Hfulltable >Hfulltable -fulltable
+ #Htable #Hmatch #Htape #Hintape #t1' #Ht1'
+ >Hintape in Hta; #Hta cases (Hta ? (refl ??)) -Hta
+ #Hs0 lapply (\P Hs0) -Hs0 #Hs0 #Hta % //
+ cases HR -HR
+ #tb * whd in ⊢ (%→?); #Htb
+ lapply (Htb (〈grid,false〉::ls) (curconfig@[〈c0,false〉]) (table@〈grid,false〉::rs) s0 t0 ???)
+ [ >Hta >associative_append %
+ | @daemon
+ | @daemon
+ | -Hta -Htb #Htb *
+ #tc * whd in ⊢ (%→?); #Htc cases (Htc … Htable … Htb) -Htb -Htc
+ [| * #Hcurrent #Hfalse @False_ind
+ (* absurd by Hmatch *) @daemon
+ | >Hs0 %
+ | (* Htable (con lemma) *) @daemon
+ | (* Hmatch *) @daemon
+ | (* Htable *) @daemon
+ | (* Htable, Hmatch → |config| = n
+ necessaria modifica in R_match_tuple, le dimensioni non corrispondono
+ *) @daemon
+ ]
+ * #table1 * #newc * #mv1 * #table2 * #Htableeq #Htc *
+ [ * #td * whd in ⊢ (%→?); >Htc -Htc #Htd
+ cases (Htd ? (refl ??)) #_ -Htd
+ cut (newc = 〈s1,false〉::newconfig@[〈c1,false〉]) [@daemon] #Hnewc
+ >Hnewc #Htd cut (mv1 = 〈mv,false〉)
+ [@daemon] #Hmv1
+ * #te * whd in ⊢ (%→?); #Hte
+ cut (td = midtape STape (〈c0,false〉::reverse STape curconfig@〈s0,false〉::〈grid,false〉::ls)
+ 〈grid,false〉
+ ((table1@〈bar,false〉::〈s0,false〉::curconfig@[〈c0,false〉])@〈comma,true〉::〈s1,false〉::
+ newconfig@〈c1,false〉::〈comma,false〉::〈mv,false〉::table2@〈grid,false〉::rs))
+ [ >Htd @eq_f3 //
+ [ >reverse_append >reverse_single %
+ | >associative_append >associative_append normalize
+ >associative_append >associative_append >Hmv1 %
+ ]
+ ]
+ -Htd #Htd lapply (Hte … (S n) … Htd … Ht1') -Htd -Hte
+ [ //
+ | (*|curconfig| = |newconfig|*) @daemon
+ | (* Htable → bit_or_null c1 = true *) @daemon
+ | (* only_bits (〈s1,false〉::newconfig) *) @daemon
+ | (* only_bits (curconfig@[〈s0,false〉]) *) @daemon
+ | (* no_marks (reverse ? curconfig) *) @daemon
+ | >Hmv1 in Htableeq; >Hnewc
+ >associative_append >associative_append normalize
+ >associative_append >associative_append
+ #Htableeq <Htableeq // ]
+ * #ls1 * #rs1 * #c2 * * #Hte #Hliftte #Hlegalte
+ whd in ⊢ (%→?); #Houttape lapply (Houttape … Hte) -Houttape #Houttape
+ whd in Houttape:(???%); whd in Houttape:(???(??%%%));
+ @ex_intro [| @(ex_intro ?? rs1) @ex_intro [| % [ %
+ [ >Houttape @eq_f @eq_f @eq_f @eq_f
+ change with ((〈bar,false〉::〈t0,false〉::table)@?) in ⊢ (???%);
+ >Htableeq >associative_append >associative_append
+ >associative_append normalize >associative_append
+ >associative_append normalize >Hnewc <Hmv1
+ >associative_append normalize >associative_append
+ >Hmv1 %
+ | @Hliftte
+ ]
+ | //
+ ]
+ ]
+ ]
+ | * #td * whd in ⊢ (%→%→?); >Htc #Htd
+ cases (Htd ? (refl ??)) normalize in ⊢ (%→?);
+ #Hfalse destruct (Hfalse)
+ ]
+ ]
+| #t1 #t2 #t3 whd in ⊢ (%→%→?); #Ht1 #Ht2
+ #b #Hb cases (Ht1 ? Hb) #Hb' #Ht3 >Ht2 % //
+ cases b in Hb'; normalize #H1 //
+]
+qed.
\ No newline at end of file