include "turing/mono.ma".
+lemma le_to_eq : ∀m,n.m ≤ n → ∃k. n = m + k. /3 by plus_minus, ex_intro/
+qed.
+
+lemma minus_tech : ∀a,b.a + b - a = b. // qed.
+
+lemma loop_incr2 : ∀sig,M,m,n,cfg,cfg'.m ≤ n →
+ loopM sig M m cfg = Some ? cfg' → loopM sig M n cfg = Some ? cfg'.
+#sig #M #m #n #cfg #cfg' #H cases (le_to_eq … H) #k #Hk >Hk
+>commutative_plus @loop_incr
+qed.
+
(* given a FinSet F:
- get its cardinality
- return its nth element
- return the index of a given element
*)
-axiom FS_crd : FinSet → nat.
-axiom FS_nth : ∀F:FinSet.nat → option F.
-axiom index_of_FS : ∀F:FinSet.F → nat.
+definition FS_crd ≝ λF:FinSet.|enum F|.
+definition FS_nth ≝ λF:FinSet.λn.nth_opt ? n (enum F).
+definition index_of_FS_aux ≝ λF:FinSet.λf.position_of ? (λx.x==f) (enum F).
+
+lemma index_of_FS_aux_None :
+ ∀F,f.index_of_FS_aux F f = None ? → False.
+#F #f #e cut (memb ? f (enum F) = false)
+[ generalize in match e; -e normalize in ⊢ (%→?); generalize in match O;
+ elim (enum F) //
+ #hd #tl #IH #n whd in ⊢ (??%?→?); cases (true_or_false (hd==f))
+ #Hbool >Hbool normalize
+ [ #H destruct (H)
+ | #H >(\bf ?) [| @sym_not_eq @(\Pf Hbool) ] @IH // ]
+| >enum_complete #H destruct (H) ]
+qed.
+
+definition index_of_FS : ∀F:FinSet.F → nat ≝ λF,f.
+match index_of_FS_aux F f
+return (λx:option nat.index_of_FS_aux F f = x → nat) with
+[ None ⇒ λe.?
+| Some n ⇒ λe.n ] (refl ??).cases (index_of_FS_aux_None … e)
+qed.
(* unary bit representation (with a given length) of a certain number *)
-axiom unary_of_nat : nat → nat → (list bool).
+let rec unary_of_nat n k on n ≝
+ match n with [ O ⇒ [ ] | S q ⇒ (eqb q k)::unary_of_nat q k].
+
+lemma lt_FS_index_crd_aux : ∀sig,c,n.index_of_FS_aux sig c = Some ? n → n < FS_crd sig.
+#sig #c #n whd in ⊢ (??%?→?); >(?:FS_crd sig = O + FS_crd sig) //
+generalize in match O; normalize in match (FS_crd sig); elim (enum sig)
+normalize [ #n0 #H destruct (H) ]
+#hd #tl #IH #n0 cases (hd==c) normalize
+[ #H destruct (H) //
+| #H lapply (IH ? H) // ]
+qed.
+
+lemma index_of_FS_def : ∀sig,c,n.index_of_FS sig c = n → index_of_FS_aux sig c = Some ? n.
+#sig #c #n whd in ⊢ (??%?→?); lapply (refl ? (index_of_FS_aux sig c))
+cases (index_of_FS_aux sig c) in ⊢ (???%→??(match % return ? with [ _ ⇒ ? | _ ⇒ ? ] ?)?→%);
+[ #e cases (index_of_FS_aux_None ?? e)
+| normalize // ]
+qed.
-axiom FinVector : Type[0] → nat → FinSet.
+lemma index_of_FS_def2 : ∀sig,c.index_of_FS_aux sig c = Some ? (index_of_FS sig c)./2/
+qed.
+
+lemma lt_FS_index_crd: ∀sig,c.index_of_FS sig c < FS_crd sig.
+#sig #c @(lt_FS_index_crd_aux sig c ? (index_of_FS_def2 …))
+qed.
+
+lemma le_position_of_aux : ∀T,f,l,k,n.position_of_aux T f l k = Some ? n → k ≤ n.
+#T #f #l elim l normalize
+[ #k #n #H destruct (H)
+| #hd #tl #IH #k #n cases (f hd) normalize
+ [ #H destruct (H) %
+ | #H lapply (IH … H) /2 by lt_to_le/ ]
+]
+qed.
+
+lemma nth_index_of_FS_aux :
+∀sig,a,n.index_of_FS_aux sig a = Some ? n → FS_nth sig n = Some ? a.
+#sig #a #n normalize >(?:n = O + n) in ⊢ (%→?); //
+lapply O lapply n -n elim (enum sig) normalize
+[ #n #k #H destruct (H)
+| #hd #tl #IH #n #k cases (true_or_false (hd==a)) #Ha >Ha normalize
+ [ #H destruct (H) >(?:n = O) // >(\P Ha) //
+ | cases n
+ [ <plus_n_O #H @False_ind lapply (le_position_of_aux … H) #H1
+ cases (not_le_Sn_n k) /2/
+ | #n0 #Hrec @(IH ? (S k)) >Hrec /2 by eq_f/ ]
+ ]
+]
+qed.
+
+lemma nth_index_of_FS : ∀sig,a.FS_nth sig (index_of_FS ? a) = Some ? a.
+#sig #a @nth_index_of_FS_aux >index_of_FS_def2 %
+qed.
+
+definition bin_char ≝ λsig,ch.unary_of_nat (FS_crd sig) (index_of_FS sig ch).
+
+definition opt_bin_char ≝ λsig,c.match c with
+[ None ⇒ [ ] | Some c0 ⇒ bin_char sig c0 ].
+
+lemma eq_length_bin_char_FS_crd : ∀sig,c.|bin_char sig c| = FS_crd sig.
+#sig #c whd in ⊢ (??(??%)?); elim (FS_crd sig) //
+#n #IH <IH in ⊢ (???%); %
+qed.
+
+lemma bin_char_FS_nth_tech :
+ ∀sig,c,l1,b,l2.bin_char sig c = l1@b::l2 → b = (((|l2|):DeqNat) == index_of_FS sig c).
+#sig #c #l1 #b #l2 #Hbin lapply (eq_length_bin_char_FS_crd sig c)
+>Hbin #Hlen lapply Hbin lapply Hlen -Hlen -Hbin
+whd in match (bin_char ??); lapply l2 lapply c lapply l1 -l2 -c -l1
+elim (FS_crd sig)
+[ #l1 #b #l2 normalize in ⊢ (??%?→?); cases l1
+ [ normalize #H destruct (H) | #hd #tl normalize #H destruct (H) ]
+| #n #IH #l1 #b #l2 whd in ⊢ (?→??%?→?); cases l1
+ [ whd in ⊢ (??%?→???%→?); #Hlen destruct (Hlen)
+ #H <(cons_injective_l ????? H) @eq_f2 //
+ | #b0 #l10 #Hlen #H lapply (cons_injective_r ????? H) -H #H @(IH … H)
+ normalize in Hlen; destruct (Hlen) % ]
+]
+qed.
+
+lemma nth_opt_memb : ∀T:DeqSet.∀l,n,t.nth_opt T n l = Some ? t → memb T t l = true.
+#T #l elim l normalize [ #n #t #H destruct (H) ]
+#hd #tl #IH #n #t cases n normalize
+[ #Ht destruct (Ht) >(\b (refl ? t)) %
+| #n0 #Ht cases (t==hd) // @(IH … Ht) ]
+qed.
+
+lemma FS_nth_neq :
+∀sig,m,n. m ≠ n →
+∀s1,s2.FS_nth sig m = Some ? s1 → FS_nth sig n = Some ? s2 → s1 ≠ s2.
+#sig #m #n #Hneq #s1 #s2 lapply (enum_unique sig) lapply Hneq
+lapply n lapply m -n -m normalize elim (enum sig)
+[ #m #n #_ #_ normalize #H destruct (H)
+| #hd #tl #IH #m #n #Hneq whd in ⊢ (??%?→?);
+ cases (true_or_false (hd ∈ tl)) #Hbool >Hbool normalize in ⊢ (%→?);
+ [ #H destruct (H)
+ | #H cases m in Hneq;
+ [ #Hneq whd in ⊢ (??%?→?); #H1 destruct (H1) cases n in Hneq;
+ [ * #H cases (H (refl ??))
+ | #n0 #_ whd in ⊢ (??%?→?); #Htl % #Heq destruct (Heq)
+ >(nth_opt_memb … Htl) in Hbool; #Hfalse destruct (Hfalse)
+ ]
+ | #m0 #Hneq whd in ⊢ (??%?→?); #H1
+ whd in ⊢ (??%?→?); cases n in Hneq;
+ [ #_ whd in ⊢ (??%?→?); #H2 destruct (H2) % #Heq destruct (Heq)
+ >(nth_opt_memb … H1) in Hbool; #Hfalse destruct (Hfalse)
+ | #n0 #Hneq whd in ⊢ (??%?→?); @(IH m0 n0 ? H … H1)
+ % #Heq cases Hneq /2/
+ ]
+ ]
+ ]
+]
+qed.
+
+lemma nth_opt_Some : ∀T,l,n.n < |l| → ∃t.nth_opt T n l = Some ? t.
+#T #l elim l
+[ normalize #n #H @False_ind cases (not_le_Sn_O n) /2/
+| #hd #tl #IH #n normalize cases n
+ [ #_ %{hd} //
+ | #n0 #Hlt cases (IH n0 ?) [| @le_S_S_to_le // ]
+ #t #Ht normalize %{t} // ]
+]
+qed.
+
+corollary FS_nth_Some : ∀sig,n.n < FS_crd sig → ∃s.FS_nth sig n = Some ? s.
+#sig #n @nth_opt_Some
+qed.
+
+lemma bin_char_FS_nth :
+ ∀sig,c,l1,b,l2.bin_char sig c = l1@b::l2 → b = (FS_nth sig (|l2|) == Some ? c).
+#sig #c #l1 #b #l2 #H >(bin_char_FS_nth_tech … H)
+cases (true_or_false (((|l2|):DeqNat)==index_of_FS sig c)) #Hbool >Hbool
+[ >(?:(|l2|)=index_of_FS sig c) [|change with ((|l2|):DeqNat) in ⊢ (??%?); @(\P Hbool) ]
+ @sym_eq @(\b ?) @nth_index_of_FS
+| <nth_index_of_FS @sym_eq @(\bf ?) % #Hfalse
+ cases (FS_nth_Some sig (|l2|) ?) [| <(eq_length_bin_char_FS_crd sig c) >H >length_append normalize // ]
+ #s1 #H1
+ cases (FS_nth_Some sig (index_of_FS sig c) ?) [|//]
+ #s2 #H2
+ cases (FS_nth_neq … H1 H2) [| @(\Pf Hbool) ]
+ #Hfalse2 @Hfalse2 <Hfalse in H2; >H1 #HSome destruct (HSome) %
+]
+qed.
+
+corollary binary_to_bin_char :∀sig,csl,csr,a.
+ csl@true::csr=bin_char sig a → FS_nth ? (length ? csr) = Some ? a.
+#sig #csl #csr #a #H @(\P ?) @sym_eq @bin_char_FS_nth //
+qed.
+
+(* axiom FinVector : Type[0] → nat → FinSet.*)
definition binary_base_states ≝ initN 6.
definition states_binaryTM : FinSet → FinSet → FinSet ≝ λsig,states.
FinProd (FinProd states binary_base_states)
- (FinProd (FinOption sig) (initN (S (2 * (FS_crd sig))))).
-
-axiom daemon : ∀T:Type[0].T.
+ (FinProd (FinOption sig) (initN (S (S (2 * (FS_crd sig)))))).
definition to_initN : ∀n,m.n < m → initN m ≝ λn,m,Hn.mk_Sig … n ….// qed.
definition initN_pred : ∀n.∀m:initN n.initN n ≝ λn,m.mk_Sig … (pred (pi1 … m)) ….
cases m #m0 /2 by le_to_lt_to_lt/ qed.
-(* controllare i contatori, molti andranno incrementati di uno *)
+definition displ_of_move ≝ λsig,mv.
+ match mv with
+ [ L ⇒ 2*FS_crd sig
+ | N ⇒ FS_crd sig
+ | R ⇒ O ].
+
+lemma le_displ_of_move : ∀sig,mv.displ_of_move sig mv ≤ S (2*FS_crd sig).
+#sig * /2 by le_S/
+qed.
+
+definition displ2_of_move ≝ λsig,mv.
+ match mv with
+ [ L ⇒ FS_crd sig
+ | N ⇒ O
+ | R ⇒ O ].
+
+lemma le_displ2_of_move : ∀sig,mv.displ2_of_move sig mv ≤ S (2*FS_crd sig).
+#sig * /2 by lt_to_le/
+qed.
+
+definition mv_tech ≝ λmv.match mv with [ N ⇒ N | _ ⇒ R ].
+
definition trans_binaryTM : ∀sig,states:FinSet.
(states × (option sig) → states × (option sig) × move) →
((states_binaryTM sig states) × (option bool) →
≝ λsig,states,trans,p.
let 〈s,a〉 ≝ p in
let 〈s0,phase,ch,count〉 ≝ s in
- let (H1 : O < S (2*FS_crd sig)) ≝ ? in
- let (H2 : FS_crd sig < S (2*FS_crd sig)) ≝ ? in
+ let (H1 : O < S (S (2*FS_crd sig))) ≝ ? in
+ let (H2 : FS_crd sig < S (S (2*FS_crd sig))) ≝ ? in
match pi1 … phase with
[ O ⇒ (*** PHASE 0: read ***)
match pi1 … count with
then 〈〈s0,bin0,FS_nth sig k,initN_pred … count〉, None ?,R〉
else 〈〈s0,bin0,ch,initN_pred … count〉,None ?,R〉
| None ⇒ (* Overflow position! *)
- 〈〈s0,bin4,None ?,to_initN 0 ? H1〉,None ?,R〉 ] ]
+ let 〈s',a',mv〉 ≝ trans 〈s0,None ?〉 in
+ match a' with
+ [ None ⇒ (* we don't write anything: go to end of 3 *) 〈〈s',bin3,None ?,to_initN (displ2_of_move sig mv) ??〉,None ?,mv_tech mv〉
+ | Some _ ⇒ (* maybe extend tape *) 〈〈s0,bin4,None ?,to_initN O ? H1〉,None ?,R〉 ] ] ]
| S phase ⇒ match phase with
[ O ⇒ (*** PHASE 1: restart ***)
match pi1 … count with
[ O ⇒ (*** PHASE 2: write ***)
let 〈s',a',mv〉 ≝ trans 〈s0,ch〉 in
match pi1 … count with
- [ O ⇒ let mv' ≝ match mv with [ R ⇒ N | _ ⇒ L ] in
- let count' ≝ match mv with [ R ⇒ 0 | N ⇒ FS_crd sig | L ⇒ 2*(FS_crd sig) ] in
- 〈〈s',bin3,ch,to_initN count' ??〉,None ?,mv'〉
+ [ O ⇒ 〈〈s',bin3,ch,to_initN (displ_of_move sig mv) ??〉,None ?,N〉
| S k ⇒ match a' with
[ None ⇒ 〈〈s0,bin2,ch,initN_pred … count〉,None ?,R〉
| Some a0' ⇒ let out ≝ (FS_nth ? k == a') in
| Some _ ⇒ (* leftof *)
let 〈s',a',mv〉 ≝ trans 〈s0,ch〉 in
match a' with
- [ None ⇒ (* we don't write anything: go to end of 2 *) 〈〈s0,bin2,ch,to_initN 0 ? H1〉,None ?,N〉
+ [ None ⇒ (* (vacuous) go to end of 2 *) 〈〈s0,bin2,ch,to_initN 0 ? H1〉,None ?,N〉
| Some _ ⇒ (* extend tape *) 〈〈s0,bin5,ch,to_initN (FS_crd sig) ? H2〉,None ?,L〉 ]
]
| S _ ⇒ (*** PHASE 5: left extension ***)
match pi1 … count with
- [ O ⇒ 〈〈s0,bin2,ch,to_initN (FS_crd sig) ? H2〉,None ?,N〉
+ [ O ⇒ 〈〈s0,bin2,ch,to_initN (FS_crd sig) ? H2〉,None ?,R〉
| S k ⇒ 〈〈s0,bin5,ch,initN_pred … count〉,Some ? false,L〉 ]]]]]].
-[2,3: //]
-whd in match count'; cases mv whd in ⊢ (?%?); //
+[ /2 by le_to_lt_to_lt/ | /2 by le_S_S/ |*: /2 by lt_S_to_lt/]
qed.
definition halt_binaryTM : ∀sig,M.states_binaryTM sig (states sig M) → bool ≝
λsig.λM:TM sig.
mk_TM FinBool (states_binaryTM sig (states sig M))
(trans_binaryTM sig (states sig M) (trans sig M))
- (〈start sig M,bin0,None ?,FS_crd sig〉) (halt_binaryTM sig M).// qed.
-
-definition bin_char ≝ λsig,ch.unary_of_nat (FS_crd sig) (index_of_FS sig ch).
+ (〈start sig M,bin0,None ?,FS_crd sig〉) (halt_binaryTM sig M).
+/2 by lt_S_to_lt/ qed.
-definition bin_current ≝ λsig,t.match current ? t with
-[ None ⇒ [ ] | Some c ⇒ bin_char sig c ].
+definition bin_list ≝ λsig,l.flatten ? (map ?? (bin_char sig) l).
+definition rev_bin_list ≝ λsig,l.flatten ? (map ?? (λc.reverse ? (bin_char sig c)) l).
definition tape_bin_lift ≝ λsig,t.
-let ls' ≝ flatten ? (map ?? (bin_char sig) (left ? t)) in
-let c' ≝ option_hd ? (bin_current sig t) in
-let rs' ≝ tail ? (bin_current sig t)@flatten ? (map ?? (bin_char sig) (right ? t)) in
+let ls' ≝ rev_bin_list ? (left ? t) in
+let c' ≝ option_hd ? (opt_bin_char sig (current ? t)) in
+let rs' ≝ (tail ? (opt_bin_char sig (current ? t))@bin_list ? (right ? t)) in
mk_tape ? ls' c' rs'.
-definition R_bin_lift ≝ λsig,R,t1,t2.
- ∃u1.t1 = tape_bin_lift sig u1 →
- ∃u2.t2 = tape_bin_lift sig u2 ∧ R u1 u2.
-
definition state_bin_lift :
∀sig.∀M:TM sig.states sig M → states ? (mk_binaryTM ? M)
- ≝ λsig,M,q.〈q,bin0,None ?,FS_crd sig〉.// qed.
+ ≝ λsig,M,q.〈q,bin0,None ?,FS_crd sig〉./2 by lt_S_to_lt/ qed.
lemma lift_halt_binaryTM :
∀sig,M,q.halt sig M q = halt ? (mk_binaryTM sig M) (state_bin_lift ? M q).
= mk_config ?? (〈q,bin1,ch,to_initN (FS_crd sig) ??〉) t. //
qed.
+lemma binaryTM_bin0_bin3 :
+ ∀sig,M,t,q,ch,k,qn,mv.
+ current ? t = None ? → S k <S (2*FS_crd sig) →
+ 〈qn,None ?,mv〉 = trans sig M 〈q,None ?〉 →
+ step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin0,ch,S k〉) t)
+ = mk_config ?? (〈qn,bin3,None ?,to_initN (displ2_of_move sig mv) ??〉) (tape_move ? t (mv_tech mv)). [|@le_S //|@le_S_S @le_displ2_of_move]
+#sig #M #t #q #ch #k #qn #mv #Hcur #Hk #Htrans
+whd in match (step ???); whd in match (trans ???);
+>Hcur <Htrans %
+qed.
+
lemma binaryTM_bin0_bin4 :
- ∀sig,M,t,q,ch,k.
+ ∀sig,M,t,q,ch,k,qn,chn,mv.
current ? t = None ? → S k <S (2*FS_crd sig) →
+ 〈qn,Some ? chn,mv〉 = trans sig M 〈q,None ?〉 →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin0,ch,S k〉) t)
- = mk_config ?? (〈q,bin4,None ?,to_initN 0 ??〉) (tape_move ? t R). [2,3://]
-#sig #M #t #q #ch #k #Hcur #Hk
+ = mk_config ?? (〈q,bin4,None ?,to_initN 0 ??〉) (tape_move ? t R). [2,3:/2 by transitive_lt/]
+#sig #M #t #q #ch #k #qn #chn #mv #Hcur #Hk #Htrans
whd in match (step ???); whd in match (trans ???);
->Hcur %
+>Hcur <Htrans %
qed.
lemma binaryTM_bin0_true :
∀sig,M,t,q,ch,k.
current ? t = Some ? true → S k <S (2*FS_crd sig) →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin0,ch,S k〉) t)
- = mk_config ?? (〈q,bin0,FS_nth sig k,to_initN k ??〉) (tape_move ? t R).[2,3:/2 by lt_S_to_lt/]
+ = mk_config ?? (〈q,bin0,FS_nth sig k,to_initN k ??〉) (tape_move ? t R).[2,3:@le_S /2 by lt_S_to_lt/]
#sig #M #t #q #ch #k #Hcur #Hk
whd in match (step ???); whd in match (trans ???);
>Hcur %
∀sig,M,t,q,ch,k.
current ? t = Some ? false → S k <S (2*FS_crd sig) →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin0,ch,S k〉) t)
- = mk_config ?? (〈q,bin0,ch,to_initN k ??〉) (tape_move ? t R).[2,3:/2 by lt_S_to_lt/]
+ = mk_config ?? (〈q,bin0,ch,to_initN k ??〉) (tape_move ? t R).[2,3:@le_S /2 by lt_S_to_lt/]
#sig #M #t #q #ch #k #Hcur #Hk
whd in match (step ???); whd in match (trans ???);
>Hcur %
qed.
-(* to be checked *)
-axiom binary_to_bin_char :∀sig,csl,csr,a.
- csl@true::csr=bin_char sig a → FS_nth ? (length ? csr) = Some ? a.
-
lemma binaryTM_phase0_midtape_aux :
∀sig,M,q,ls,a,rs,k.
halt sig M q=false →
t = mk_tape ? (reverse ? csl@ls) (option_hd ? (csr@rs)) (tail ? (csr@rs)) →
csl@csr = bin_char sig a →
|csl@csr| = FS_crd sig →
- (index_of_FS ? a < |csl| → ch = Some ? a) →
+ (|csr| ≤ index_of_FS ? a → ch = Some ? a) →
loopM ? (mk_binaryTM sig M) (S (length ? csr) + k)
(mk_config ?? (〈q,bin0,ch,length ? csr〉) t)
= loopM ? (mk_binaryTM sig M) k
(mk_config ?? (〈q,bin1,Some ? a,FS_crd sig〉)
- (mk_tape ? (reverse ? (bin_char ? a)@ls) (option_hd ? rs) (tail ? rs))). [2,3:/2 by O/]
+ (mk_tape ? (reverse ? (bin_char ? a)@ls) (option_hd ? rs) (tail ? rs))). [2,3:@le_S /2 by O/]
#sig #M #q #ls #a #rs #k #Hhalt #csr elim csr
[ #csl #t #ch #Hlen #Ht >append_nil #Hcsl #Hlencsl #Hch >loopM_unfold >loop_S_false [|normalize //]
- >Hch [| >Hlencsl (* lemmatize *) @daemon]
+ >Hch [| >Hlencsl // ]
<loopM_unfold @eq_f >binaryTM_bin0_bin1 @eq_f >Ht
whd in match (step ???); whd in match (trans ???); <Hcsl %
| #c cases c
| #c1 #csr1 normalize >rev_append_def >rev_append_def >reverse_append % ]
| /2 by lt_S_to_lt/
|]
- #H whd in match (plus ??); >H @eq_f @eq_f2 %
+ #H whd in match (plus ??); >Ha >H @eq_f @eq_f2 %
| #csr0 #IH #csl #t #ch #Hlen #Ht #Heq #Hcrd #Hch >loopM_unfold >loop_S_false [|normalize //]
<loopM_unfold >binaryTM_bin0_false [| >Ht % ]
lapply (IH (csl@[false]) (tape_move FinBool t R) ??????)
[6: @ch
- | (* by cases: if index < |csl|, then Hch, else False *)
- @daemon
+ | #Hle cases (le_to_or_lt_eq … Hle) [ @Hch ]
+ #Hindex lapply (bin_char_FS_nth … (sym_eq … Heq)) >Hindex
+ >(nth_index_of_FS sig a) >(\b (refl ? (Some sig a))) #H destruct (H)
| >associative_append @Hcrd
| >associative_append @Heq
| >Ht whd in match (option_hd ??) in ⊢ (??%?); whd in match (tail ??) in ⊢ (??%?);
qed.
lemma binaryTM_phase0_midtape :
- ∀sig,M,t,q,ls,a,rs,ch,k.
+ ∀sig,M,t,q,ls,a,rs,ch.
+ O < FS_crd sig →
halt sig M q=false →
- t = mk_tape ? ls (option_hd ? (bin_char ? a)) (tail ? (bin_char sig a@rs)) →
- loopM ? (mk_binaryTM sig M) (S (length ? (bin_char ? a)) + k)
- (mk_config ?? (〈q,bin0,ch,length ? (bin_char ? a)〉) t)
- = loopM ? (mk_binaryTM sig M) k
+ t = mk_tape ? ls (option_hd ? (bin_char ? a)) (tail ? (bin_char sig a)@rs) →
+ ∀k.S (FS_crd sig) ≤ k →
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (〈q,bin0,ch,FS_crd sig〉) t)
+ = loopM ? (mk_binaryTM sig M) (k - S (FS_crd sig))
(mk_config ?? (〈q,bin1,Some ? a,FS_crd sig〉)
- (mk_tape ? (reverse ? (bin_char ? a)@ls) (option_hd ? rs) (tail ? rs))). [|@daemon|//]
-#sig #M #t #q #ls #a #rs #ch #k #Hhalt #Ht
-cut (∃c,cl.bin_char sig a = c::cl) [@daemon] * #c * #cl #Ha >Ha
+ (mk_tape ? (reverse ? (bin_char ? a)@ls) (option_hd ? rs) (tail ? rs))). [|*:@le_S //]
+#sig #M #t #q #ls #a #rs #ch #Hcrd #Hhalt #Ht #k #Hk
+cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >(minus_tech (S (FS_crd sig)))
+cut (∃c,cl.bin_char sig a = c::cl)
+[ lapply (refl ? (|bin_char ? a|)) >eq_length_bin_char_FS_crd in ⊢ (???%→?);
+ cases (bin_char ? a) [|/3 by ex_intro/] normalize in ⊢ (??%?→?); #H
+ <H in Hcrd; -H #H cases (not_le_Sn_O O) #Hfalse cases (Hfalse H) ]
+* #c * #cl #Ha >Ha
+cut (FS_crd sig = |bin_char sig a|) [/2 by plus_minus_m_m/] #Hlen
+@(trans_eq ?? (loopM ? (mk_binaryTM ? M) (S (|c::cl|) + k0)
+ (mk_config ?? 〈q,bin0,〈ch,|c::cl|〉〉 t)))
+[ @le_S_S <Ha <Hlen // | @eq_f2 // @eq_f2 // @eq_f <Ha >Hlen % ]
>(binaryTM_phase0_midtape_aux ? M q ls a rs ? ? (c::cl) [ ] t ch) //
-[| normalize #Hfalse @False_ind cases (not_le_Sn_O ?) /2/
-| <Ha (* |bin_char sig ?| = FS_crd sig *) @daemon
+[| <Ha <Hlen lapply (lt_FS_index_crd sig a) #Hlt #Hle
+ lapply (transitive_le ??? Hlt Hle) #H cases (not_le_Sn_n (index_of_FS ? a))
+ #H1 @False_ind /2/
+| <Ha >Hlen %
| >Ha %
-| >Ht >Ha % ]
+| >Ht >Ha %
+| <Ha <Hlen // ]
<Ha %
qed.
-lemma binaryTM_phase0_None :
- ∀sig,M,t,q,ch,k,n.
- n < 2*FS_crd sig →
+lemma binaryTM_phase0_None_None :
+ ∀sig,M,t,q,ch,n,qn,mv.
+ O < n → n < 2*FS_crd sig →
halt sig M q=false →
current ? t = None ? →
- loopM ? (mk_binaryTM sig M) (S k) (mk_config ?? (〈q,bin0,ch,S n〉) t)
- = loopM ? (mk_binaryTM sig M) k
- (mk_config ?? (〈q,bin4,None ?,to_initN O ??〉) (tape_move ? t R)). [2,3: /2 by le_to_lt_to_lt/ ]
-#sig #M #t #q #ch #k #n #Hn #Hhalt cases t
-[ >loopM_unfold >loop_S_false [|@Hhalt] //
-| #r0 #rs0 >loopM_unfold >loop_S_false [|@Hhalt] //
-| #l0 #ls0 >loopM_unfold >loop_S_false [|@Hhalt] //
+ 〈qn,None ?,mv〉 = trans sig M 〈q,None ?〉 →
+ ∀k.O < k →
+ loopM ? (mk_binaryTM sig M) k (mk_config ?? (〈q,bin0,ch,n〉) t)
+ = loopM ? (mk_binaryTM sig M) (k-1)
+ (mk_config ?? (〈qn,bin3,None ?,to_initN (displ2_of_move sig mv) ??〉) (tape_move ? t (mv_tech mv))). [| @le_S @le_S //|@le_S_S @le_displ2_of_move]
+#sig #M #t #q #ch #n #qn #mv #HOn #Hn #Hhalt #Hcur #Htrans #k #Hk
+cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >minus_tech
+cases (le_to_eq … HOn) #n0 #Hn0 destruct (Hn0)
+lapply Htrans lapply Hcur -Htrans -Hcur cases t
+[ >loopM_unfold >loop_S_false [|@Hhalt] #Hcur #Htrans >binaryTM_bin0_bin3 //
+| #r0 #rs0 >loopM_unfold >loop_S_false [|@Hhalt] #Hcur #Htrans >binaryTM_bin0_bin3 //
+| #l0 #ls0 >loopM_unfold >loop_S_false [|@Hhalt] #Hcur #Htrans >binaryTM_bin0_bin3 //
+| #ls #cur #rs normalize in ⊢ (%→?); #H destruct (H) ]
+qed.
+
+lemma binaryTM_phase0_None_Some :
+ ∀sig,M,t,q,ch,n,qn,chn,mv.
+ O < n → n < 2*FS_crd sig →
+ halt sig M q=false →
+ current ? t = None ? →
+ 〈qn,Some ? chn,mv〉 = trans sig M 〈q,None ?〉 →
+ ∀k.O < k →
+ loopM ? (mk_binaryTM sig M) k (mk_config ?? (〈q,bin0,ch,n〉) t)
+ = loopM ? (mk_binaryTM sig M) (k-1)
+ (mk_config ?? (〈q,bin4,None ?,to_initN O ??〉) (tape_move ? t R)). [2,3: /2 by transitive_lt/ ]
+#sig #M #t #q #ch #n #qn #chn #mv #HOn #Hn #Hhalt #Hcur #Htrans #k #Hk
+cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >minus_tech
+cases (le_to_eq … HOn) #n0 #Hn0 destruct (Hn0)
+lapply Htrans lapply Hcur -Hcur -Htrans cases t
+[ >loopM_unfold >loop_S_false [|@Hhalt] #Hcur #Htrans >binaryTM_bin0_bin4 // /2 by refl, transitive_lt/
+| #r0 #rs0 >loopM_unfold >loop_S_false [|@Hhalt] #Hcur #Htrans >binaryTM_bin0_bin4 // /2 by refl, transitive_lt/
+| #l0 #ls0 >loopM_unfold >loop_S_false [|@Hhalt] #Hcur #Htrans >binaryTM_bin0_bin4 // /2 by refl, transitive_lt/
| #ls #cur #rs normalize in ⊢ (%→?); #H destruct (H) ]
qed.
lemma binaryTM_bin1_O :
∀sig,M,t,q,ch.
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin1,ch,O〉) t)
- = mk_config ?? (〈q,bin2,ch,to_initN (FS_crd sig) ??〉) t. [2,3://]
+ = mk_config ?? (〈q,bin2,ch,to_initN (FS_crd sig) ??〉) t. [2,3:/2 by lt_S_to_lt/]
#sig #M #t #q #ch %
qed.
lemma binaryTM_bin1_S :
∀sig,M,t,q,ch,k. S k <S (2*FS_crd sig) →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin1,ch,S k〉) t)
- = mk_config ?? (〈q,bin1,ch,to_initN k ??〉) (tape_move ? t L). [2,3:/2 by lt_S_to_lt/]
+ = mk_config ?? (〈q,bin1,ch,to_initN k ??〉) (tape_move ? t L). [2,3:@le_S /2 by lt_S_to_lt/]
#sig #M #t #q #ch #k #HSk %
qed.
lemma binaryTM_phase1 :
- ∀sig,M,q,ls1,ls2,cur,rs,ch,k.
+ ∀sig,M,q,ls1,ls2,cur,rs,ch.
|ls1| = FS_crd sig → (cur = None ? → rs = [ ]) →
- loopM ? (mk_binaryTM sig M) (S (FS_crd sig) + k)
+ ∀k.S (FS_crd sig) ≤ k →
+ loopM ? (mk_binaryTM sig M) k
(mk_config ?? (〈q,bin1,ch,FS_crd sig〉) (mk_tape ? (ls1@ls2) cur rs))
- = loopM ? (mk_binaryTM sig M) k
+ = loopM ? (mk_binaryTM sig M) (k - S (FS_crd sig))
(mk_config ?? (〈q,bin2,ch,FS_crd sig〉)
(mk_tape ? ls2 (option_hd ? (reverse ? ls1@option_cons ? cur rs))
(tail ? (reverse ? ls1@option_cons ? cur rs)))). [2,3:/2 by O/]
= loopM ? (mk_binaryTM sig M) k
(mk_config ?? (〈q,bin2,ch,FS_crd sig〉)
(mk_tape ? ls2 (option_hd ? (reverse ? ls1@option_cons ? cur rs))
- (tail ? (reverse ? ls1@option_cons ? cur rs))))) [1,2://]
+ (tail ? (reverse ? ls1@option_cons ? cur rs))))) [1,2:@le_S //]
[ #sig #M #q #ls1 #ls2 #ch #k elim ls1
[ #n normalize in ⊢ (%→?); #cur #rs #Hn <Hn #Hcrd #Hcur >loopM_unfold >loop_S_false [| % ]
>binaryTM_bin1_O cases cur in Hcur;
.halt FinBool (mk_binaryTM sig M)
(cstate FinBool (states FinBool (mk_binaryTM sig M)) c))
(mk_config FinBool (states FinBool (mk_binaryTM sig M))
- 〈q,bin1,ch,to_initN (|ls0|) (S (2*FS_crd sig))
- (lt_S_to_lt (|ls0|) (S (2*FS_crd sig)) Hlt)〉
+ 〈q,bin1,ch,to_initN (|ls0|) ?
+ (le_S ?? (lt_S_to_lt (|ls0|) (S (2*FS_crd sig)) Hlt))〉
(mk_tape FinBool (ls0@ls2) (Some FinBool l0) (option_cons FinBool cur rs)))
= loopM FinBool (mk_binaryTM sig M) k
(mk_config FinBool (states FinBool (mk_binaryTM sig M))
]
>reverse_cons >associative_append %
]
-| #Hcut #sig #M #q #ls1 #ls2 #cur #rs #ch #k #Hlen @Hcut // ]
-qed.
-
-lemma binaryTM_bin2_O_L :
- ∀sig,M,t,q,qn,ch,chn.
- 〈qn,chn,L〉 = trans sig M 〈q,ch〉 →
- step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin2,ch,O〉) t)
- = mk_config ?? (〈qn,bin3,ch,to_initN (2*(FS_crd sig)) ??〉) (tape_move ? t L).[2,3:/2 by lt_S_to_lt/]
-#sig #M #t #q #qn #ch #chn #Htrans
-whd in match (step ???); whd in match (trans ???); <Htrans %
+| #Hcut #sig #M #q #ls1 #ls2 #cur #rs #ch #Hlen #Hcur #k #Hk
+ cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >minus_tech @Hcut /2/ ]
qed.
-lemma binaryTM_bin2_O_R :
- ∀sig,M,t,q,qn,ch,chn.
- 〈qn,chn,R〉 = trans sig M 〈q,ch〉 →
+lemma binaryTM_bin2_O :
+ ∀sig,M,t,q,qn,ch,chn,mv.
+ 〈qn,chn,mv〉 = trans sig M 〈q,ch〉 →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin2,ch,O〉) t)
- = mk_config ?? (〈qn,bin3,ch,to_initN O ??〉) t.[2,3://]
-#sig #M #t #q #qn #ch #chn #Htrans
-whd in match (step ???); whd in match (trans ???); <Htrans %
-qed.
-
-lemma binaryTM_bin2_O_N :
- ∀sig,M,t,q,qn,ch,chn.
- 〈qn,chn,N〉 = trans sig M 〈q,ch〉 →
- step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin2,ch,O〉) t)
- = mk_config ?? (〈qn,bin3,ch,to_initN (FS_crd sig) ??〉) (tape_move ? t L).[2,3:/2 by lt_S_to_lt/]
-#sig #M #t #q #qn #ch #chn #Htrans
+ = mk_config ?? (〈qn,bin3,ch,to_initN (displ_of_move sig mv) ??〉) t.[2,3:/2 by lt_S_to_lt,le_S_S/]
+#sig #M #t #q #qn #ch #chn #mv #Htrans
whd in match (step ???); whd in match (trans ???); <Htrans %
qed.
lemma binaryTM_bin2_S_None :
∀sig,M,t,q,qn,ch,mv,k.
- k< 2*FS_crd sig →
+ k < S (2*FS_crd sig) →
〈qn,None ?,mv〉 = trans sig M 〈q,ch〉 →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin2,ch,S k〉) t)
= mk_config ?? (〈q,bin2,ch,k〉) (tape_move ? t R).
-[2,3:/2 by le_to_lt_to_lt, transitive_lt/]
+[2,3: @le_S_S /2 by lt_to_le/ ]
#sig #M #t #q #qn #ch #mv #k #Hk #Htrans
whd in match (step ???); whd in match (trans ???); <Htrans %
qed.
lemma binaryTM_bin2_S_Some :
∀sig,M,t,q,qn,ch,chn,mv,k.
- k< 2*FS_crd sig →
+ k< S (2*FS_crd sig) →
〈qn,Some ? chn,mv〉 = trans sig M 〈q,ch〉 →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin2,ch,S k〉) t)
= mk_config ?? (〈q,bin2,ch,k〉) (tape_move ? (tape_write ? t (Some ? (FS_nth ? k == Some ? chn))) R).
-[2,3:/2 by le_to_lt_to_lt, transitive_lt/]
+[2,3: @le_S_S /2 by lt_to_le/ ]
#sig #M #t #q #qn #ch #chn #mv #k #Hk #Htrans
whd in match (step ???); whd in match (trans ???); <Htrans %
qed.
-lemma binaryTM_phase2_Some_R :∀sig,M,q,ch,qn,chn,ls,rs,k,csr.
- 〈qn,Some ? chn,R〉 = trans sig M 〈q,ch〉 →
- ∀cur,csl. |cur::csr|<S (2*FS_crd sig) →
- |csl@cur::csr| = FS_crd sig →
- (∃fs.bin_char sig chn = reverse ? csl@fs) →
- loopM ? (mk_binaryTM sig M) (S (|cur::csr|) + k)
- (mk_config ?? (〈q,bin2,ch,|cur::csr|〉) (midtape ? (csl@ls) cur (csr@rs)))
- = loopM ? (mk_binaryTM sig M) k
- (mk_config ?? (〈qn,bin3,ch,O〉)
- (mk_tape ? (reverse ? (bin_char sig chn)@ls) (option_hd ? rs) (tail ? rs))). [2,3://]
-#sig #M #q #ch #qn #chn #ls #rs #k #csr #Htrans elim csr
-[ #cur #csl #Hcount #Hcrd * #fs #Hfs >loopM_unfold >loop_S_false // normalize in match (length ? [cur]);
- >(binaryTM_bin2_S_Some … Htrans) [| /2 by monotonic_pred/ ]
- >loop_S_false // @eq_f >(binaryTM_bin2_O_R … Htrans)
- @eq_f change with (midtape ? (csl@ls) (FS_nth sig O == Some ? chn) rs) in match (tape_write ???);
- cut (bin_char sig chn = reverse ? csl@[FS_nth sig O == Some sig chn]) [@daemon] #Hfs' >Hfs'
- >reverse_append >reverse_single >reverse_reverse >associative_append
- cases rs //
-| #b0 #bs0 #IH #cur #csl #Hcount #Hcrd * #fs #Hfs
- >loopM_unfold >loop_S_false // >(binaryTM_bin2_S_Some … Htrans) [| @le_S_S_to_le @Hcount ]
- change with (midtape ? (((FS_nth ? (|b0::bs0|)==Some sig chn)::csl)@ls) b0 (bs0@rs))
- in match (tape_move ? (tape_write ???) ?); @IH
- [ <Hcrd >length_append >length_append normalize //
- | cases fs in Hfs;
- [ #Hfalse cut (|bin_char ? chn| = |csl|) [ >Hfalse >length_append >length_reverse // ]
- -Hfalse >(?:|bin_char sig chn| = FS_crd sig) [|@daemon]
- <Hcrd >length_append normalize >(?:|csl| = |csl|+ O) in ⊢ (???%→?); //
- #Hfalse cut (S (S (|bs0|)) = O) /2 by injective_plus_r/ #H destruct (H)
- | #f0 #fs0 #Hbinchar
- cut (bin_char ? chn = reverse ? csl@(FS_nth ? (|b0::bs0|) == Some ? chn)::fs0) [@daemon]
- -Hbinchar #Hbinchar >Hbinchar %{fs0} >reverse_cons >associative_append %
- ]
- ]
+let rec iter (T:Type[0]) f n (t:T) on n ≝
+ match n with [ O ⇒ t | S n0 ⇒ iter T f n0 (f t) ].
+
+lemma binaryTM_phase2_None :∀sig,M,q,ch,qn,mv.
+ 〈qn,None ?,mv〉 = trans sig M 〈q,ch〉 →
+ ∀n.n≤S (2*FS_crd sig) →
+ ∀t,k.S n ≤ k →
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (〈q,bin2,ch,n〉) t)
+ = loopM ? (mk_binaryTM sig M) (k - S n)
+ (mk_config ?? (〈qn,bin3,ch,to_initN (displ_of_move sig mv) ??〉)
+ (iter ? (λt0.tape_move ? t0 R) n t)). [2,3: @le_S_S /2 by lt_S_to_lt/]
+#sig #M #q #ch #qn #mv #Htrans #n #Hn #t #k #Hk
+cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >minus_tech lapply Hn lapply t -Hn -t
+elim n
+[ #t #Hle >loopM_unfold >loop_S_false //
+ >(binaryTM_bin2_O … Htrans) //
+| #n0 #IH #t #Hn0 >loopM_unfold >loop_S_false //
+ >(binaryTM_bin2_S_None … Htrans) @(trans_eq ???? (IH …)) //
]
qed.
-lemma binaryTM_phase2_Some_L :∀sig,M,q,ch,qn,chn,ls,rs,k,csr.
- 〈qn,Some ? chn,L〉 = trans sig M 〈q,ch〉 →
- ∀cur,csl. |cur::csr|<S (2*FS_crd sig) →
- |csl@cur::csr| = FS_crd sig →
+lemma binaryTM_phase2_Some_of : ∀sig,M,q,ch,qn,chn,mv,ls.
+ 〈qn,Some ? chn,mv〉 = trans sig M 〈q,ch〉 →
+ ∀k.S (FS_crd sig) ≤ k →
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (〈q,bin2,ch,FS_crd sig〉) (mk_tape ? ls (None ?) [ ]))
+ = loopM ? (mk_binaryTM sig M) (k - S (FS_crd sig))
+ (mk_config ?? (〈qn,bin3,ch,displ_of_move sig mv〉)
+ (mk_tape ? (reverse ? (bin_char sig chn)@ls) (None ?) [ ])). [2,3:@le_S_S //]
+cut (∀sig,M,q,ch,qn,chn,mv,ls,k,n.
+ S n ≤ k → 〈qn,Some ? chn,mv〉 = trans sig M 〈q,ch〉 →
+ ∀csl. n <S (2*FS_crd sig) →
+ |csl| + n = FS_crd sig →
(∃fs.bin_char sig chn = reverse ? csl@fs) →
- loopM ? (mk_binaryTM sig M) (S (|cur::csr|) + k)
- (mk_config ?? (〈q,bin2,ch,|cur::csr|〉) (midtape ? (csl@ls) cur (csr@rs)))
- = loopM ? (mk_binaryTM sig M) k
- (mk_config ?? (〈qn,bin3,ch,to_initN (2*FS_crd sig) ??〉)
- (tape_move ? (mk_tape ? (reverse ? (bin_char sig chn)@ls) (option_hd ? rs) (tail ? rs)) L)). [2,3://]
-#sig #M #q #ch #qn #chn #ls #rs #k #csr #Htrans elim csr
-[ #cur #csl #Hcount #Hcrd * #fs #Hfs >loopM_unfold >loop_S_false // normalize in match (length ? [cur]);
- >(binaryTM_bin2_S_Some … Htrans) [| /2 by monotonic_pred/ ]
- >loop_S_false // @eq_f >(binaryTM_bin2_O_L … Htrans)
- @eq_f change with (midtape ? (csl@ls) (FS_nth sig O == Some ? chn) rs) in match (tape_write ???);
- cut (bin_char sig chn = reverse ? csl@[FS_nth sig O == Some sig chn]) [@daemon] #Hfs' >Hfs'
- >reverse_append >reverse_single >reverse_reverse >associative_append @eq_f2 //
- cases rs //
-| #b0 #bs0 #IH #cur #csl #Hcount #Hcrd * #fs #Hfs
- >loopM_unfold >loop_S_false // >(binaryTM_bin2_S_Some … Htrans) [| @le_S_S_to_le @Hcount ]
- change with (midtape ? (((FS_nth ? (|b0::bs0|)==Some sig chn)::csl)@ls) b0 (bs0@rs))
- in match (tape_move ? (tape_write ???) ?); @IH
- [ <Hcrd >length_append >length_append normalize //
- | cases fs in Hfs;
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (〈q,bin2,ch,n〉) (mk_tape ? (csl@ls) (None ?) [ ]))
+ = loopM ? (mk_binaryTM sig M) (k - S n)
+ (mk_config ?? (〈qn,bin3,ch,displ_of_move sig mv〉)
+ (mk_tape ? (reverse ? (bin_char sig chn)@ls) (None ?) [ ]))) [1,2:@le_S_S //]
+[ #sig #M #q #ch #qn #chn #mv #ls #k #n #Hk
+ cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >minus_tech
+ #Htrans elim n
+ [ #csl #Hcount #Hcrd * #fs #Hfs >loopM_unfold >loop_S_false // <loopM_unfold
+ cut (fs = [ ])
+ [ cases fs in Hfs; // #f0 #fs0 #H lapply (eq_f ?? (length ?) … H)
+ >length_append >(?:|bin_char sig chn| = FS_crd sig) [|//]
+ <Hcrd >length_reverse #H1 cut (O = |f0::fs0|) [ /2/ ]
+ normalize #H1 destruct (H1) ]
+ #H destruct (H) >append_nil in Hfs; #Hfs
+ >Hfs >reverse_reverse >(binaryTM_bin2_O … Htrans) //
+ | #n0 #IH #csl #Hcount #Hcrd * #fs #Hfs
+ >loopM_unfold >loop_S_false // <loopM_unfold
+ >(?: step FinBool (mk_binaryTM sig M)
+ (mk_config FinBool (states FinBool (mk_binaryTM sig M)) 〈q,bin2,〈ch,S n0〉〉
+ (mk_tape FinBool (csl@ls) (None FinBool) []))
+ = mk_config ?? (〈q,bin2,ch,n0〉)
+ (tape_move ? (tape_write ?
+ (mk_tape ? (csl@ls) (None ?) [ ]) (Some ? (FS_nth ? n0 == Some ? chn))) R))
+ [| /2 by lt_S_to_lt/ | @(binaryTM_bin2_S_Some … Htrans) ]
+ >(?: tape_move ? (tape_write ???) ? =
+ mk_tape ? (((FS_nth ? n0 == Some sig chn)::csl)@ls) (None ?) [ ])
+ [| cases csl // cases ls // ]
+ cases fs in Hfs;
[ #Hfalse cut (|bin_char ? chn| = |csl|) [ >Hfalse >length_append >length_reverse // ]
- -Hfalse >(?:|bin_char sig chn| = FS_crd sig) [|@daemon]
- <Hcrd >length_append normalize >(?:|csl| = |csl|+ O) in ⊢ (???%→?); //
- #Hfalse cut (S (S (|bs0|)) = O) /2 by injective_plus_r/ #H destruct (H)
+ -Hfalse >(?:|bin_char sig chn| = FS_crd sig) [|//]
+ <Hcrd in ⊢ (%→?); >(?:|csl| = |csl|+ O) in ⊢ (???%→?); //
+ #Hfalse cut (S n0 = O) /2 by injective_plus_r/ #H destruct (H)
| #f0 #fs0 #Hbinchar
- cut (bin_char ? chn = reverse ? csl@(FS_nth ? (|b0::bs0|) == Some ? chn)::fs0) [@daemon]
- -Hbinchar #Hbinchar >Hbinchar %{fs0} >reverse_cons >associative_append %
+ cut (bin_char ? chn = reverse ? csl@(FS_nth ? n0 == Some ? chn)::fs0)
+ [ >Hbinchar >(bin_char_FS_nth … Hbinchar) >(?:|fs0|=n0) //
+ <(eq_length_bin_char_FS_crd sig chn) in Hcrd; >Hbinchar
+ >length_append >length_reverse whd in ⊢ (???(??%)→?); /2 by injective_S/ ]
+ -Hbinchar #Hbinchar >Hbinchar @(trans_eq ???? (IH …)) //
+ [ %{fs0} >reverse_cons >associative_append @Hbinchar
+ | whd in ⊢ (??%?); <Hcrd // ]
+ @eq_f @eq_f @eq_f3 //
]
]
+| #Hcut #sig #M #q #ch #qn #chn #mv #ls #Htrans #k #Hk
+ @trans_eq
+ [3: @(trans_eq ???? (Hcut ??????? ls ? (FS_crd sig) ? Htrans …)) //
+ [3:@([ ]) | %{(bin_char ? chn)} % | % ]
+ || % ]
]
qed.
-lemma binaryTM_phase2_Some_N :∀sig,M,q,ch,qn,chn,ls,rs,k,csr.
- 〈qn,Some ? chn,N〉 = trans sig M 〈q,ch〉 →
- ∀cur,csl. |cur::csr|<S (2*FS_crd sig) →
- |csl@cur::csr| = FS_crd sig →
- (∃fs.bin_char sig chn = reverse ? csl@fs) →
- loopM ? (mk_binaryTM sig M) (S (|cur::csr|) + k)
- (mk_config ?? (〈q,bin2,ch,|cur::csr|〉) (midtape ? (csl@ls) cur (csr@rs)))
- = loopM ? (mk_binaryTM sig M) k
- (mk_config ?? (〈qn,bin3,ch,to_initN (FS_crd sig) ??〉)
- (tape_move ? (mk_tape ? (reverse ? (bin_char sig chn)@ls) (option_hd ? rs) (tail ? rs)) L)). [2,3://]
-#sig #M #q #ch #qn #chn #ls #rs #k #csr #Htrans elim csr
-[ #cur #csl #Hcount #Hcrd * #fs #Hfs >loopM_unfold >loop_S_false // normalize in match (length ? [cur]);
- >(binaryTM_bin2_S_Some … Htrans) [| /2 by monotonic_pred/ ]
- >loop_S_false // @eq_f >(binaryTM_bin2_O_N … Htrans)
- @eq_f change with (midtape ? (csl@ls) (FS_nth sig O == Some ? chn) rs) in match (tape_write ???);
- cut (bin_char sig chn = reverse ? csl@[FS_nth sig O == Some sig chn]) [@daemon] #Hfs' >Hfs'
- >reverse_append >reverse_single >reverse_reverse >associative_append @eq_f2 //
- cases rs //
-| #b0 #bs0 #IH #cur #csl #Hcount #Hcrd * #fs #Hfs
- >loopM_unfold >loop_S_false // >(binaryTM_bin2_S_Some … Htrans) [| @le_S_S_to_le @Hcount ]
- change with (midtape ? (((FS_nth ? (|b0::bs0|)==Some sig chn)::csl)@ls) b0 (bs0@rs))
- in match (tape_move ? (tape_write ???) ?); @IH
- [ <Hcrd >length_append >length_append normalize //
- | cases fs in Hfs;
- [ #Hfalse cut (|bin_char ? chn| = |csl|) [ >Hfalse >length_append >length_reverse // ]
- -Hfalse >(?:|bin_char sig chn| = FS_crd sig) [|@daemon]
- <Hcrd >length_append normalize >(?:|csl| = |csl|+ O) in ⊢ (???%→?); //
- #Hfalse cut (S (S (|bs0|)) = O) /2 by injective_plus_r/ #H destruct (H)
- | #f0 #fs0 #Hbinchar
- cut (bin_char ? chn = reverse ? csl@(FS_nth ? (|b0::bs0|) == Some ? chn)::fs0) [@daemon]
- -Hbinchar #Hbinchar >Hbinchar %{fs0} >reverse_cons >associative_append %
+lemma binaryTM_phase2_Some_ow : ∀sig,M,q,ch,qn,chn,mv,ls,cs,rs.
+ 〈qn,Some ? chn,mv〉 = trans sig M 〈q,ch〉 →
+ |cs| = FS_crd sig →
+ ∀k.S (FS_crd sig) ≤ k →
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (〈q,bin2,ch,FS_crd sig〉)
+ (mk_tape ? ls (option_hd ? (cs@rs)) (tail ? (cs@rs))))
+ = loopM ? (mk_binaryTM sig M) (k - S (FS_crd sig))
+ (mk_config ?? (〈qn,bin3,ch,displ_of_move sig mv〉)
+ (mk_tape ? (reverse ? (bin_char sig chn)@ls) (option_hd ? rs) (tail ? rs))). [2,3:@le_S_S /2 by O/]
+cut (∀sig,M,q,ch,qn,chn,mv,ls,rs,k,csr.
+ 〈qn,Some ? chn,mv〉 = trans sig M 〈q,ch〉 →
+ ∀csl.|csr|<S (2*FS_crd sig) →
+ |csl@csr| = FS_crd sig →
+ (∃fs.bin_char sig chn = reverse ? csl@fs) →
+ loopM ? (mk_binaryTM sig M) (S (|csr|) + k)
+ (mk_config ?? (〈q,bin2,ch,|csr|〉)
+ (mk_tape ? (csl@ls) (option_hd ? (csr@rs)) (tail ? (csr@rs))))
+ = loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (〈qn,bin3,ch,displ_of_move sig mv〉)
+ (mk_tape ? (reverse ? (bin_char sig chn)@ls) (option_hd ? rs) (tail ? rs)))) [1,2: @le_S_S [/2 by lt_to_le/|/2 by le_S/] ]
+[ #sig #M #q #ch #qn #chn #mv #ls #rs #k #csr #Htrans elim csr
+ [ #csl #Hcount #Hcrd * #fs #Hfs >loopM_unfold >loop_S_false // normalize in match (length ? [ ]);
+ >(binaryTM_bin2_O … Htrans) <loopM_unfold @eq_f @eq_f @eq_f3 //
+ cases fs in Hfs; // #f0 #fs0 #H lapply (eq_f ?? (length ?) … H)
+ >length_append >(?:|bin_char sig chn| = FS_crd sig) [|//]
+ <Hcrd >length_reverse >length_append whd in match (|[]|); #H1 cut (O = |f0::fs0|) [ /2 by plus_to_minus/ ]
+ normalize #H1 destruct (H1)
+ | #b0 #bs0 #IH #csl #Hcount #Hcrd * #fs #Hfs
+ >loopM_unfold >loop_S_false // >(binaryTM_bin2_S_Some … Htrans)
+ >(?: tape_move ? (tape_write ???) ? =
+ mk_tape ? (((FS_nth ? (|bs0|)==Some sig chn)::csl)@ls)
+ (option_hd ? (bs0@rs)) (tail ? (bs0@rs)))
+ in match (tape_move ? (tape_write ???) ?);
+ [| cases bs0 // cases rs // ] @IH
+ [ <Hcrd >length_append >length_append normalize //
+ | cases fs in Hfs;
+ [ #Hfalse cut (|bin_char ? chn| = |csl|) [ >Hfalse >length_append >length_reverse // ] -Hfalse >(?:|bin_char sig chn| = FS_crd sig) [|//]
+ <Hcrd >length_append normalize >(?:|csl| = |csl|+ O) in ⊢ (???%→?); //
+ #Hfalse cut (S (|bs0|) = O) /2 by injective_plus_r/ #H destruct (H)
+ | #f0 #fs0 #Hbinchar
+ cut (bin_char ? chn = reverse ? csl@(FS_nth ? (|bs0|) == Some ? chn)::fs0)
+ [ >Hbinchar >(bin_char_FS_nth … Hbinchar) >(?:|fs0|=|bs0|) //
+ <(eq_length_bin_char_FS_crd sig chn) in Hcrd; >Hbinchar
+ >length_append >length_append >length_reverse
+ whd in ⊢ (??(??%)(??%)→?); /2 by injective_S/ ]
+ -Hbinchar #Hbinchar >Hbinchar %{fs0} >reverse_cons >associative_append %
+ ]
]
]
-]
-qed.
-
-lemma binaryTM_phase2_None_R :∀sig,M,q,ch,qn,ls,rs,k,csr.
- 〈qn,None ?,R〉 = trans sig M 〈q,ch〉 →
- ∀cur,csl. |cur::csr|<S (2*FS_crd sig) →
- |csl@cur::csr| = FS_crd sig →
- loopM ? (mk_binaryTM sig M) (S (|cur::csr|) + k)
- (mk_config ?? (〈q,bin2,ch,|cur::csr|〉) (midtape ? (csl@ls) cur (csr@rs)))
- = loopM ? (mk_binaryTM sig M) k
- (mk_config ?? (〈qn,bin3,ch,O〉)
- (mk_tape ? (reverse ? csr@cur::csl@ls) (option_hd ? rs) (tail ? rs))). [2,3://]
-#sig #M #q #ch #qn #ls #rs #k #csr #Htrans elim csr
-[ #cur #csl #Hcount #Hcrd >loopM_unfold >loop_S_false // normalize in match (length ? [cur]);
- >(binaryTM_bin2_S_None … Htrans) [| /2 by monotonic_pred/ ]
- >loop_S_false // @eq_f >(binaryTM_bin2_O_R … Htrans)
- @eq_f cases rs //
-| #b0 #bs0 #IH #cur #csl #Hcount #Hcrd
- >loopM_unfold >loop_S_false // >(binaryTM_bin2_S_None … Htrans) [| @le_S_S_to_le @Hcount ]
- change with (midtape ? ((cur::csl)@ls) b0 (bs0@rs))
- in match (tape_move ???); >reverse_cons >associative_append
- normalize in match ([b0]@cur::csl@ls); @IH
- <Hcrd >length_append >length_append normalize //
-]
-qed.
-
-lemma binaryTM_phase2_None_L : ∀sig,M,q,ch,qn,ls,rs,k,csr.
- 〈qn,None ?,L〉 = trans sig M 〈q,ch〉 →
- ∀cur,csl. |cur::csr|<S (2*FS_crd sig) →
- |csl@cur::csr| = FS_crd sig →
- loopM ? (mk_binaryTM sig M) (S (|cur::csr|) + k)
- (mk_config ?? (〈q,bin2,ch,|cur::csr|〉) (midtape ? (csl@ls) cur (csr@rs)))
- = loopM ? (mk_binaryTM sig M) k
- (mk_config ?? (〈qn,bin3,ch,to_initN (2*FS_crd sig) ??〉)
- (tape_move ? (mk_tape ? (reverse ? csr@cur::csl@ls) (option_hd ? rs) (tail ? rs)) L)). [2,3://]
-#sig #M #q #ch #qn #ls #rs #k #csr #Htrans elim csr
-[ #cur #csl #Hcount #Hcrd >loopM_unfold >loop_S_false // normalize in match (length ? [cur]);
- >(binaryTM_bin2_S_None … Htrans) [| /2 by monotonic_pred/ ]
- >loop_S_false // @eq_f >(binaryTM_bin2_O_L … Htrans)
- @eq_f cases rs //
-| #b0 #bs0 #IH #cur #csl #Hcount #Hcrd
- >loopM_unfold >loop_S_false // >(binaryTM_bin2_S_None … Htrans) [| @le_S_S_to_le @Hcount ]
- change with (midtape ? ((cur::csl)@ls) b0 (bs0@rs))
- in match (tape_move ???); >reverse_cons >associative_append
- normalize in match ([b0]@cur::csl@ls); @IH
- <Hcrd >length_append >length_append normalize //
-]
-qed.
-
-lemma binaryTM_phase2_None_N :∀sig,M,q,ch,qn,ls,rs,k,csr.
- 〈qn,None ?,N〉 = trans sig M 〈q,ch〉 →
- ∀cur,csl. |cur::csr|<S (2*FS_crd sig) →
- |csl@cur::csr| = FS_crd sig →
- loopM ? (mk_binaryTM sig M) (S (|cur::csr|) + k)
- (mk_config ?? (〈q,bin2,ch,|cur::csr|〉) (midtape ? (csl@ls) cur (csr@rs)))
- = loopM ? (mk_binaryTM sig M) k
- (mk_config ?? (〈qn,bin3,ch,to_initN (FS_crd sig) ??〉)
- (tape_move ? (mk_tape ? (reverse ? csr@cur::csl@ls) (option_hd ? rs) (tail ? rs)) L)). [2,3://]
-#sig #M #q #ch #qn #ls #rs #k #csr #Htrans elim csr
-[ #cur #csl #Hcount #Hcrd >loopM_unfold >loop_S_false // normalize in match (length ? [cur]);
- >(binaryTM_bin2_S_None … Htrans) [| /2 by monotonic_pred/ ]
- >loop_S_false // @eq_f >(binaryTM_bin2_O_N … Htrans)
- @eq_f cases rs //
-| #b0 #bs0 #IH #cur #csl #Hcount #Hcrd
- >loopM_unfold >loop_S_false // >(binaryTM_bin2_S_None … Htrans) [| @le_S_S_to_le @Hcount ]
- change with (midtape ? ((cur::csl)@ls) b0 (bs0@rs))
- in match (tape_move ???); >reverse_cons >associative_append
- normalize in match ([b0]@cur::csl@ls); @IH
- <Hcrd >length_append >length_append normalize //
-]
+| #Hcut #sig #M #q #ch #qn #chn #mv #ls #cs #rs #Htrans #Hcrd #k #Hk
+ cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >(?:S (FS_crd sig) +k0-S (FS_crd sig) = k0) [|@minus_tech]
+ @trans_eq
+ [3: @(trans_eq ???? (Hcut ??????? ls ?? cs Htrans [ ] …)) //
+ [ normalize % // | normalize @Hcrd | >Hcrd // ]
+ || @eq_f2 [ >Hcrd % | @eq_f2 // @eq_f cases Hcrd // ] ] ]
qed.
lemma binaryTM_bin3_O :
∀sig,M,t,q,ch.
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin3,ch,O〉) t)
- = mk_config ?? (〈q,bin0,None ?,to_initN (FS_crd sig) ??〉) t. [2,3://]
+ = mk_config ?? (〈q,bin0,None ?,to_initN (FS_crd sig) ??〉) t. [2,3:@le_S //]
#sig #M #t #q #ch %
qed.
lemma binaryTM_bin3_S :
- ∀sig,M,t,q,ch,k. S k <S (2*FS_crd sig) →
+ ∀sig,M,t,q,ch,k. S k ≤ S (2*FS_crd sig) →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin3,ch,S k〉) t)
- = mk_config ?? (〈q,bin3,ch,to_initN k ??〉) (tape_move ? t L). [2,3:/2 by lt_S_to_lt/]
+ = mk_config ?? (〈q,bin3,ch,to_initN k ??〉) (tape_move ? t L). [2,3: @le_S_S /2 by lt_to_le/]
#sig #M #t #q #ch #k #HSk %
qed.
-lemma binaryTM_phase3 :∀sig,M,q,ls1,ls2,ch,k,n,cur,rs.
- |ls1| = n → n<S (2*FS_crd sig) → (cur = None ? → rs = [ ]) →
- loopM ? (mk_binaryTM sig M) (S n + k)
- (mk_config ?? (〈q,bin3,ch,n〉) (mk_tape ? (ls1@ls2) cur rs))
- = loopM ? (mk_binaryTM sig M) k
+lemma binaryTM_phase3 :∀sig,M,q,ch,n.
+ n ≤ S (2*FS_crd sig) →
+ ∀t,k.S n ≤ k →
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (〈q,bin3,ch,n〉) t)
+ = loopM ? (mk_binaryTM sig M) (k - S n)
(mk_config ?? (〈q,bin0,None ?,FS_crd sig〉)
- (mk_tape ? ls2 (option_hd ? (reverse ? ls1@option_cons ? cur rs))
- (tail ? (reverse ? ls1@option_cons ? cur rs)))). [2,3://]
-#sig #M #q #ls1 #ls2 #ch #k elim ls1
-[ #n normalize in ⊢ (%→?); #cur #rs #Hn <Hn #Hcrd #Hcur >loopM_unfold >loop_S_false [| % ]
- >binaryTM_bin3_O cases cur in Hcur;
- [ #H >(H (refl ??)) -H %
- | #cur' #_ % ]
-| #l0 #ls0 #IH * [ #cur #rs normalize in ⊢ (%→?); #H destruct (H) ]
- #n #cur #rs normalize in ⊢ (%→?); #H destruct (H) #Hlt #Hcur
- >loopM_unfold >loop_S_false [|%] >binaryTM_bin3_S
- <(?:mk_tape ? (ls0@ls2) (Some ? l0) (option_cons ? cur rs) =
- tape_move FinBool (mk_tape FinBool ((l0::ls0)@ls2) cur rs) L)
- [| cases cur in Hcur; [ #H >(H ?) // | #cur' #_ % ] ]
- >(?:loop (config FinBool (states FinBool (mk_binaryTM sig M))) (S (|ls0|)+k)
- (step FinBool (mk_binaryTM sig M))
- (λc:config FinBool (states FinBool (mk_binaryTM sig M))
- .halt FinBool (mk_binaryTM sig M)
- (cstate FinBool (states FinBool (mk_binaryTM sig M)) c))
- (mk_config FinBool (states FinBool (mk_binaryTM sig M))
- 〈q,bin3,ch,to_initN (|ls0|) (S (2*FS_crd sig))
- (lt_S_to_lt (|ls0|) (S (2*FS_crd sig)) Hlt)〉
- (mk_tape FinBool (ls0@ls2) (Some FinBool l0) (option_cons FinBool cur rs)))
- = loopM FinBool (mk_binaryTM sig M) k
- (mk_config FinBool (states FinBool (mk_binaryTM sig M))
- 〈q,bin0,〈None ?,FS_crd sig〉〉
- (mk_tape FinBool ls2
- (option_hd FinBool (reverse FinBool ls0@l0::option_cons FinBool cur rs))
- (tail FinBool (reverse FinBool ls0@l0::option_cons FinBool cur rs)))))
- [| /2/
- | >(?: l0::option_cons ? cur rs = option_cons ? (Some ? l0) (option_cons ? cur rs)) [| % ]
- @trans_eq [|| @(IH ??? (refl ??)) [ /2 by lt_S_to_lt/ | #H destruct (H) ] ]
- %
- ]
- >reverse_cons >associative_append %
-]
+ (iter ? (λt0.tape_move ? t0 L) n t)). [2,3: /2 by lt_S_to_lt, le_to_lt_to_lt/]
+#sig #M #q #ch #n #Hcrd #t #k #Hk
+cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >(minus_tech (S n) k0)
+lapply t lapply Hcrd -t -Hcrd elim n
+[ #Hcrd #t >loopM_unfold >loop_S_false [| % ] >binaryTM_bin3_O //
+| #n0 #IH #Hlt #t >loopM_unfold >loop_S_false [|%] >binaryTM_bin3_S [|@Hlt]
+ <IH [|@lt_to_le @Hlt ]
+ <loopM_unfold % ]
qed.
lemma binaryTM_bin4_None :
∀sig,M,t,q,ch.
current ? t = None ? →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin4,ch,O〉) t)
- = mk_config ?? (〈q,bin2,ch,to_initN (FS_crd sig) ??〉) t. [2,3://]
+ = mk_config ?? (〈q,bin2,ch,to_initN (FS_crd sig) ??〉) t. [|@le_S_S @le_O_n | @le_S_S // ]
#sig #M #t #q #ch #Hcur whd in ⊢ (??%?); >Hcur %
qed.
+lemma binaryTM_phase4_write : ∀sig,M,q,ch,t.current ? t = None ? →
+ ∀k.O < k →
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (〈q,bin4,ch,O〉) t)
+ = loopM ? (mk_binaryTM sig M) (k-1)
+ (mk_config ?? (〈q,bin2,ch,to_initN (FS_crd sig) ??〉) t). [|@le_S_S @le_O_n|@le_S_S //]
+#sig #M #q #ch #t #Hcur #k #Hk
+cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >minus_tech
+>loopM_unfold >loop_S_false // <loopM_unfold >binaryTM_bin4_None [|//] %
+qed.
+
+(* we don't get here any more! *
lemma binaryTM_bin4_noextend :
∀sig,M,t,q,ch,cur,qn,mv.
current ? t = Some ? cur →
whd in ⊢ (??%?); >Hcur whd in ⊢ (??%?);
whd in match (trans FinBool ??); <Htrans %
qed.
+*)
lemma binaryTM_bin4_extend :
∀sig,M,t,q,ch,cur,qn,an,mv.
current ? t = Some ? cur →
〈qn,Some ? an,mv〉 = trans sig M 〈q,ch〉 →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin4,ch,O〉) t)
- = mk_config ?? (〈q,bin5,ch,to_initN (FS_crd sig) ??〉) (tape_move ? t L). [2,3://]
+ = mk_config ?? (〈q,bin5,ch,to_initN (FS_crd sig) ??〉) (tape_move ? t L). [2,3:@le_S //]
#sig #M #t #q #ch #cur #qn #an #mv #Hcur #Htrans
whd in ⊢ (??%?); >Hcur whd in ⊢ (??%?);
whd in match (trans FinBool ??); <Htrans %
qed.
+lemma binaryTM_phase4_extend : ∀sig,M,q,ch,t,cur,qn,an,mv.
+ current ? t = Some ? cur → 〈qn,Some ? an,mv〉 = trans sig M 〈q,ch〉 →
+ ∀k.O < k →
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (〈q,bin4,ch,O〉) t)
+ = loopM ? (mk_binaryTM sig M) (k-1)
+ (mk_config ?? (〈q,bin5,ch,to_initN (FS_crd sig) ??〉) (tape_move ? t L)). [2,3: @le_S //]
+#sig #M #q #ch #t #cur #qn #an #mv #Hcur #Htrans #k #Hk
+cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >minus_tech
+>loopM_unfold >loop_S_false // <loopM_unfold >(binaryTM_bin4_extend … Hcur) [|*://] %
+qed.
+
lemma binaryTM_bin5_O :
∀sig,M,t,q,ch.
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin5,ch,O〉) t)
- = mk_config ?? (〈q,bin2,ch,to_initN (FS_crd sig) ??〉) t. [2,3://]
+ = mk_config ?? (〈q,bin2,ch,to_initN (FS_crd sig) ??〉) (tape_move ? t R). [2,3:@le_S //]
#sig #M #t #q #ch %
qed.
lemma binaryTM_bin5_S :
∀sig,M,t,q,ch,k. S k <S (2*FS_crd sig) →
step ? (mk_binaryTM sig M) (mk_config ?? (〈q,bin5,ch,S k〉) t)
- = mk_config ?? (〈q,bin5,ch,to_initN k ??〉) (tape_move ? (tape_write ? t (Some ? false)) L). [2,3:/2 by lt_S_to_lt/]
+ = mk_config ?? (〈q,bin5,ch,to_initN k ??〉) (tape_move ? (tape_write ? t (Some ? false)) L). [2,3:@le_S /2 by lt_S_to_lt/]
#sig #M #t #q #ch #k #HSk %
qed.
(* extends the tape towards the left with an unimportant sequence that will be
immediately overwritten *)
-lemma binaryTM_phase5 :∀sig,M,q,ch,k,n,rs.
- n<S (2*FS_crd sig) →
+lemma binaryTM_phase5 :∀sig,M,q,ch,n.
+ ∀rs.n<S (2*FS_crd sig) →
∃bs.|bs| = n ∧
- loopM ? (mk_binaryTM sig M) (S n + k)
+ ∀k.S n ≤ k →
+ loopM ? (mk_binaryTM sig M) k
(mk_config ?? (〈q,bin5,ch,n〉) (mk_tape ? [] (None ?) rs))
- = loopM ? (mk_binaryTM sig M) k
+ = loopM ? (mk_binaryTM sig M) (k - S n)
(mk_config ?? (〈q,bin2,ch,FS_crd sig〉)
- (mk_tape ? [] (None ?) (bs@rs))). [2,3://]
-#sig #M #q #ch #k #n elim n
-[ #rs #Hlt %{[]} % %
-| #n0 #IH #rs #Hn0 cases (IH (false::rs) ?) [|/2 by lt_S_to_lt/]
- #bs * #Hbs -IH #IH
- %{(bs@[false])} % [ <Hbs >length_append /2 by plus_to_minus/ ]
+ (mk_tape ? [] (option_hd ? (bs@rs)) (tail ? (bs@rs)))). [2,3:@le_S //]
+#sig #M #q #ch #n elim n
+[ #rs #Hlt %{[]} % // #k #Hk cases (le_to_eq … Hk) #k0 #Hk0 >Hk0 >minus_tech -Hk0
+ cases rs //
+| #n0 #IH #rs #Hn0 cases (IH (false::rs) ?) [|/2 by lt_S_to_lt/]
+ #bs * #Hbs -IH #IH %{(bs@[false])} % [ <Hbs >length_append /2 by increasing_to_injective/ ]
+ #k #Hk cases (le_to_eq … Hk) #k0 #Hk0 >Hk0
>loopM_unfold >loop_S_false // >binaryTM_bin5_S
- >associative_append normalize in match ([false]@?); <IH
+ >associative_append normalize in match ([false]@?); <(IH (S n0 + k0)) [|//]
>loopM_unfold @eq_f @eq_f cases rs //
]
qed.
+lemma current_None_or_midtape :
+ ∀sig,t.current sig t = None sig ∨ ∃ls,c,rs.t = midtape sig ls c rs.
+#sig * normalize /2/ #ls #c #rs %2 /4 by ex_intro/
+qed.
+
+lemma state_bin_lift_unfold :
+ ∀sig.∀M:TM sig.∀q:states sig M.
+ state_bin_lift sig M q = 〈q,bin0,None ?,FS_crd sig〉.// qed.
+
+axiom current_tape_bin_list :
+ ∀sig,t.current sig t = None ? → current ? (tape_bin_lift sig t) = None ?.
+
+lemma tape_bin_lift_unfold :
+ ∀sig,t. tape_bin_lift sig t =
+ mk_tape ? (rev_bin_list ? (left ? t)) (option_hd ? (opt_bin_char sig (current ? t)))
+ (tail ? (opt_bin_char sig (current ? t))@bin_list ? (right ? t)). //
+qed.
+
+lemma reverse_bin_char_list : ∀sig,c,l.
+ reverse ? (bin_char sig c)@rev_bin_list ? l = rev_bin_list ? (c::l). // qed.
+
+lemma left_midtape : ∀sig,ls,c,rs.left ? (midtape sig ls c rs) = ls.// qed.
+lemma current_midtape : ∀sig,ls,c,rs.current ? (midtape sig ls c rs) = Some ? c.// qed.
+lemma right_midtape : ∀sig,ls,c,rs.right ? (midtape sig ls c rs) = rs.// qed.
+lemma opt_bin_char_Some : ∀sig,c.opt_bin_char sig (Some ? c) = bin_char ? c.// qed.
+
+lemma opt_cons_hd_tl : ∀A,l.option_cons A (option_hd ? l) (tail ? l) = l.
+#A * // qed.
+
+lemma le_tech : ∀a,b,c.a ≤ b → a * c ≤ b * c.
+#a #b #c #H /2 by monotonic_le_times_r/
+qed.
+
+lemma iter_split : ∀T,f,m,n,x.
+ iter T f (m+n) x = iter T f m (iter T f n x).
+#T #f #m #n elim n /2/
+#n0 #IH #x <plus_n_Sm whd in ⊢ (??%(????%)); >IH %
+qed.
+
+lemma iter_O : ∀T,f,x.iter T f O x = x.// qed.
+
+lemma iter_tape_move_R : ∀T,n,ls,cs,rs.|cs| = n →
+ iter ? (λt0.tape_move T t0 R) n (mk_tape ? ls (option_hd ? (cs@rs)) (tail ? (cs@rs)))
+ = mk_tape ? (reverse ? cs@ls) (option_hd ? rs) (tail ? rs).
+#T #n elim n
+[ #ls * [| #c0 #cs0 #rs #H normalize in H; destruct (H) ] #rs #_ %
+| #n0 #IH #ls * [ #rs #H normalize in H; destruct (H) ] #c #cs #rs #Hlen
+ whd in ⊢ (??%?);
+ >(?: (tape_move T (mk_tape T ls (option_hd T ((c::cs)@rs)) (tail T ((c::cs)@rs))) R)
+ = mk_tape ? (c::ls) (option_hd ? (cs@rs)) (tail ? (cs@rs))) in ⊢ (??(????%)?);
+ [| cases cs // cases rs // ] >IH
+ [ >reverse_cons >associative_append %
+ | normalize in Hlen; destruct (Hlen) % ]
+]
+qed.
+
+lemma tail_tech : ∀T,l1,l2.O < |l1| → tail T (l1@l2) = tail ? l1@l2.
+#T * normalize // #l2 #Hfalse @False_ind cases (not_le_Sn_O O) /2/
+qed.
+
+lemma hd_tech : ∀T,l1,l2.O < |l1| → option_hd T (l1@l2) = option_hd ? l1.
+#T * normalize // #l2 #Hfalse @False_ind cases (not_le_Sn_O O) /2/
+qed.
+
+lemma iter_tape_move_L_nil : ∀T,n,rs.
+ iter ? (λt0.tape_move T t0 L) n (mk_tape ? [ ] (None ?) rs) =
+ mk_tape ? [ ] (None ?) rs.
+#T #n #rs elim n // #n0 #IH <IH in ⊢ (???%); cases rs //
+qed.
+
+lemma iter_tape_move_R_nil : ∀T,n,ls.
+ iter ? (λt0.tape_move T t0 R) n (mk_tape ? ls (None ?) [ ]) =
+ mk_tape ? ls (None ?) [ ].
+#T #n #ls elim n // #n0 #IH <IH in ⊢ (???%); cases ls //
+qed.
+
+lemma iter_tape_move_L_left : ∀T,n,cs,rs. O < n →
+ iter ? (λt0.tape_move T t0 L) n
+ (mk_tape ? [ ] (option_hd ? cs) (tail ? cs@rs)) =
+ mk_tape ? [ ] (None ?) (cs@rs).
+#T #n #cs #rs *
+[ cases cs // cases rs //
+| #m #_ whd in ⊢ (??%?); <(iter_tape_move_L_nil ? m) cases cs // cases rs // ]
+qed.
+
+lemma iter_tape_move_L : ∀T,n,ls,cs,rs.|cs| = n →
+ iter ? (λt0.tape_move T t0 L) n (mk_tape ? (reverse ? cs@ls) (option_hd ? rs) (tail ? rs))
+ = mk_tape ? ls (option_hd ? (cs@rs)) (tail ? (cs@rs)).
+#T #n elim n
+[ #ls * [| #c0 #cs0 #rs #H normalize in H; destruct (H) ] #rs #_ %
+| #n0 #IH #ls #cs #rs @(list_elim_left … cs)
+ [ #H normalize in H; destruct (H) ] -cs
+ #c #cs #_ #Hlen >reverse_append whd in ⊢ (??%?);
+ >(?: tape_move T (mk_tape T ((reverse T [c]@reverse T cs)@ls) (option_hd T rs) (tail T rs)) L
+ = mk_tape ? (reverse T cs@ls) (option_hd ? (c::rs)) (tail ? (c::rs))) in ⊢ (??(????%)?);
+ [| cases rs // ] >IH
+ [ >associative_append %
+ | >length_append in Hlen; normalize // ]
+]
+qed.
+
+lemma tape_move_niltape :
+ ∀sig,mv.tape_move sig (niltape ?) mv = niltape ?. #sig * // qed.
+
+lemma iter_tape_move_niltape :
+ ∀sig,mv,n.iter … (λt.tape_move sig t mv) n (niltape ?) = niltape ?.
+#sig #mv #n elim n // -n #n #IH whd in ⊢ (??%?); >tape_move_niltape //
+qed.
+
+lemma tape_move_R_left :
+ ∀sig,rs.tape_move sig (mk_tape ? [ ] (None ?) rs) R =
+ mk_tape ? [ ] (option_hd ? rs) (tail ? rs). #sig * //
+qed.
+
lemma binaryTM_loop :
- ∀sig,M,i,t,q,tf,qf.
- loopM sig M i (mk_config ?? q t) = Some ? (mk_config ?? qf tf) →
- ∃k.loopM ? (mk_binaryTM sig M) k
- (mk_config ?? (state_bin_lift ? M q) (tape_bin_lift ? t)) =
- Some ? (mk_config ?? (state_bin_lift ? M qf) (tape_bin_lift ? tf)).
-#sig #M #i elim i
-[ #t #q #qf #tf change with (None ?) in ⊢ (??%?→?); #H destruct (H)
-| -i #i #IH #t #q #tf #qf
- >loopM_unfold
+ ∀sig,M,i,tf,qf. O < FS_crd sig →
+ ∀t,q.∃k.i ≤ k ∧
+ ((loopM sig M i (mk_config ?? q t) = Some ? (mk_config ?? qf tf) →
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (state_bin_lift ? M q) (tape_bin_lift ? t)) =
+ Some ? (mk_config ?? (state_bin_lift ? M qf) (tape_bin_lift ? tf))) ∧
+ (loopM sig M i (mk_config ?? q t) = None ? →
+ loopM ? (mk_binaryTM sig M) k
+ (mk_config ?? (state_bin_lift ? M q) (tape_bin_lift ? t)) = None ?)).
+#sig #M #i #tf #qf #Hcrd elim i
+[ #t #q %{O} % // % // change with (None ?) in ⊢ (??%?→?); #H destruct (H)
+| -i #i #IH #t #q >loopM_unfold
lapply (refl ? (halt sig M (cstate ?? (mk_config ?? q t))))
cases (halt ?? q) in ⊢ (???%→?); #Hhalt
- [ >(loop_S_true ??? (λc.halt ?? (cstate ?? c)) (mk_config ?? q t) Hhalt)
- #H destruct (H) %{1} >loopM_unfold >loop_S_true // ]
+ [ %{(S i)} % //
+ >(loop_S_true ??? (λc.halt ?? (cstate ?? c)) (mk_config ?? q t) Hhalt) %
+ [| #H destruct (H)]
+ #H destruct (H) >loopM_unfold >loop_S_true // ]
(* interesting case: more than one step *)
- >(loop_S_false ??? (λc.halt ?? (cstate ?? c)) (mk_config ?? q t) Hhalt)
- <loopM_unfold >(config_expand ?? (step ???)) #Hloop
- lapply (IH … Hloop) -IH * #k0 #IH <config_expand in Hloop; #Hloop
- %{(S k0)}
-
-
-
-(*
-theorem sem_binaryTM : ∀sig,M.
- mk_binaryTM sig M ⊫ R_bin_lift ? (R_TM ? M (start ? M)).
-#sig #M #t #i generalize in match t; -t
-@(nat_elim1 … i) #m #IH #intape #outc #Hloop
+ >(loop_S_false ??? (λc.halt ?? (cstate ?? c)) (mk_config ?? q t) Hhalt)cases (current_None_or_midtape ? t)
+ (*** current = None ***)
+ [ #Hcur lapply (current_tape_bin_list … Hcur) #Hcur'
+ cut (∃qn,chn,mv.〈qn,chn,mv〉 = trans ? M 〈q,None ?〉)
+ [ cases (trans ? M 〈q,None ?〉) * #qn #chn #mv /4 by ex_intro/ ]
+ * #qn * #chn * #mv cases chn -chn
+ [ #Htrans lapply (binaryTM_phase0_None_None … (None ?) (FS_crd sig) … Hhalt Hcur' Htrans) // [/2 by monotonic_lt_plus_l/]
+ lapply (binaryTM_phase3 ? M qn (None ?) (displ2_of_move sig mv) ? (tape_move FinBool (tape_bin_lift sig t) (mv_tech mv))) [//]
+ cases (IH (tape_move ? t mv) qn) -IH #k0 * #Hk0 * #IH #IHNone
+ #phase3 #phase0 %{(S (S (displ2_of_move sig mv))+k0)} %
+ [ @le_S_S @(le_plus O) // ]
+ >state_bin_lift_unfold >phase0 [|//]
+ >phase3 [|//]
+ >(?: S (S (displ2_of_move sig mv))+k0-1-S (displ2_of_move sig mv) = k0)
+ [| /2 by refl, plus_to_minus/ ]
+ cut (tape_move sig t mv=tape_move sig (tape_write sig t (None sig)) mv) [%] #Hcut
+ >(?: iter ? (λt0.tape_move ? t0 L) (displ2_of_move sig mv) (tape_move ? (tape_bin_lift ? t) (mv_tech mv))
+ =tape_bin_lift ? (tape_move ? t mv))
+ [|cases t in Hcur;
+ [4: #ls #c #rs normalize in ⊢ (%→?); #H destruct (H)
+ | #_ whd in match (tape_bin_lift ??);
+ >tape_move_niltape >iter_tape_move_niltape >tape_move_niltape %
+ | #r0 #rs0 #_ cases mv
+ [ >tape_bin_lift_unfold whd in match (mv_tech L); whd in match (displ2_of_move sig L);
+ whd in match (rev_bin_list ??); whd in match (option_hd ??);
+ whd in match (right ??); >(?: []@bin_list ? (r0::rs0) = bin_char ? r0@bin_list ? rs0) [|%]
+ >tape_move_R_left >hd_tech [| >eq_length_bin_char_FS_crd // ]
+ >tail_tech [| >eq_length_bin_char_FS_crd // ]
+ >iter_tape_move_L_left //
+ | >tape_bin_lift_unfold whd in match (mv_tech R); whd in match (displ2_of_move sig R);
+ whd in match (rev_bin_list ??); whd in match (option_hd ??);
+ whd in match (right ??); >(?: []@bin_list ? (r0::rs0) = bin_char ? r0@bin_list ? rs0) [|%]
+ whd in match (tape_move ? (leftof ???) R);
+ >tape_bin_lift_unfold >left_midtape >opt_bin_char_Some >right_midtape
+ >iter_O >tape_move_R_left >hd_tech [| >eq_length_bin_char_FS_crd // ]
+ >tail_tech [| >eq_length_bin_char_FS_crd // ] //
+ | >tape_bin_lift_unfold % ]
+ | #l0 #ls0 #_ cases mv
+ [ >tape_bin_lift_unfold whd in match (mv_tech L); whd in match (displ2_of_move sig L);
+ whd in match (bin_list ??); >append_nil whd in match (option_hd ??);
+ whd in match (left ??); whd in match (tail ??);
+ whd in match (tape_move ? (rightof ???) L);
+ >(?: rev_bin_list ? (l0::ls0) = reverse ? (bin_char ? l0)@rev_bin_list ? ls0) [|%]
+ >(?:tape_move ? (mk_tape ? ? (None ?) [ ]) R =
+ mk_tape ? (reverse ? (bin_char ? l0)@rev_bin_list ? ls0) (None ?) [ ])
+ [| cases (reverse ? (bin_char ? l0)@rev_bin_list ? ls0) //]
+ >(?:None ? = option_hd ? [ ]) // >iter_tape_move_L [|@eq_length_bin_char_FS_crd]
+ >append_nil >tape_bin_lift_unfold >left_midtape >current_midtape >right_midtape
+ >opt_bin_char_Some >append_nil %
+ | >tape_bin_lift_unfold whd in match (mv_tech R); whd in match (displ2_of_move sig R);
+ whd in match (bin_list ??); >append_nil whd in match (option_hd ??);
+ whd in match (left ??); whd in match (tail ??); >iter_O cases (rev_bin_list ??) //
+ | >tape_bin_lift_unfold % ]
+ ]
+ ]
+ %
+ [ #Hloop @IH <Hloop @eq_f whd in ⊢ (???%); >Hcur <Htrans @eq_f @Hcut
+ | #Hloop @IHNone <Hloop @eq_f whd in ⊢ (???%); >Hcur <Htrans @eq_f @Hcut ]
+ | #chn #Htrans
+ lapply (binaryTM_phase0_None_Some … (None ?) (FS_crd sig) … Hhalt Hcur' Htrans) // [/2 by monotonic_lt_plus_l/]
+ cases t in Hcur;
+ [ 4: #ls #c #rs normalize in ⊢ (%→?); #H destruct (H)
+ | 2: #r0 #rs0 #_ cut (∃b,bs.bin_char ? r0 = b::bs)
+ [ <(eq_length_bin_char_FS_crd sig r0) in Hcrd; cases (bin_char ? r0)
+ [ cases (not_le_Sn_O O) #H #H1 cases (H H1) |/3 by ex_intro/] ]
+ * #b * #bs #Hbs
+ lapply (binaryTM_phase4_extend ???? (tape_move ? (tape_bin_lift ? (leftof ? r0 rs0)) R) b … Htrans)
+ [ >tape_bin_lift_unfold whd in match (option_hd ??); whd in match (tail ??);
+ whd in match (right ??);
+ >(?:bin_list ? (r0::rs0) = bin_char ? r0@bin_list ? rs0) [|%]
+ >Hbs % ]
+ cases (binaryTM_phase5 ? M q (None ?) (FS_crd sig) (bin_list ? (r0::rs0)) ?) [|//]
+ #cs * #Hcs
+ lapply (binaryTM_phase2_Some_ow ?? q (None ?) … [ ] ? (bin_list ? (r0::rs0)) Htrans Hcs)
+ lapply (binaryTM_phase3 ? M qn (None ?) (displ_of_move sig mv) ?
+ (mk_tape FinBool (reverse bool (bin_char sig chn)@[])
+ (option_hd FinBool (bin_list sig (r0::rs0))) (tail FinBool (bin_list sig (r0::rs0))))) [//]
+ cases (IH (tape_move ? (tape_write ? (leftof ? r0 rs0) (Some ? chn)) mv) qn) -IH #k0 * #Hk0 * #IH #IHNone
+ #phase3 #phase2 #phase5 #phase4 #phase0
+ %{(1 + 1 + (S (FS_crd sig)) + (S (FS_crd sig)) + S (displ_of_move sig mv) + k0)} %
+ [ @le_S_S @(le_plus O) // ]
+ >state_bin_lift_unfold >phase0 [|//]
+ >phase4 [|//]
+ >(?: loopM ? (mk_binaryTM ??) ? (mk_config ?? 〈q,bin5,None ?,to_initN ???〉 ?) = ?)
+ [|| @(trans_eq ????? (phase5 ??))
+ [ @eq_f @eq_f
+ >tape_bin_lift_unfold whd in match (rev_bin_list ??);
+ whd in match (right ??); whd in match (bin_list ??);
+ <(eq_length_bin_char_FS_crd sig r0) in Hcrd; cases (bin_char ? r0) //
+ cases (not_le_Sn_O O) #H #H1 cases (H H1)
+ | @le_S_S >associative_plus >associative_plus >commutative_plus @(le_plus O) //
+ |]]
+ >phase2
+ [|<plus_minus [|//] <plus_minus [|//] <plus_minus [|//] // ]
+ >phase3 [|<plus_minus [|//] <plus_minus [|//] // ]
+ >(?: 1+1+S (FS_crd sig)+S (FS_crd sig)+S (displ_of_move sig mv)+k0-1-1
+ -S (FS_crd sig)-S (FS_crd sig) -S (displ_of_move sig mv) = k0)
+ [|<plus_minus [|//] <plus_minus [|//] // ]
+ -phase0 -phase2 -phase3 -phase4 -phase5 <state_bin_lift_unfold
+ >(?: iter ? (λt0.tape_move ? t0 L) (displ_of_move sig mv)
+ (mk_tape ? (reverse ? (bin_char sig chn)@[])
+ (option_hd FinBool (bin_list sig (r0::rs0)))
+ (tail FinBool (bin_list sig (r0::rs0))))
+ = tape_bin_lift ? (tape_move ? (tape_write ? (leftof ? r0 rs0) (Some ? chn)) mv))
+ [ % #Hloop
+ [ @IH <Hloop @eq_f whd in ⊢ (???%); <Htrans %
+ | @IHNone <Hloop @eq_f whd in ⊢ (???%); <Htrans % ]
+ | >(?:bin_list ? (r0::rs0) = bin_char ? r0@bin_list ? rs0) [|%]
+ cases mv
+ [ >(?:displ_of_move sig L = FS_crd sig+FS_crd sig) [|normalize //]
+ >iter_split >iter_tape_move_L [|@eq_length_bin_char_FS_crd]
+ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ] >iter_tape_move_L_left [|//]
+ whd in match (tape_move ???); >tape_bin_lift_unfold %
+ | normalize in match (displ_of_move ??); >iter_O
+ normalize in match (tape_move ???);
+ >tape_bin_lift_unfold >opt_bin_char_Some
+ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [| >eq_length_bin_char_FS_crd // ] %
+ | normalize in match (displ_of_move ??);
+ >iter_tape_move_L [|>eq_length_bin_char_FS_crd // ]
+ normalize in match (tape_move ???); >tape_bin_lift_unfold
+ >opt_bin_char_Some >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ] % ]
+ ]
+ | #_ lapply (binaryTM_phase4_write ? M q (None ?) (niltape ?) (refl ??))
+ lapply (binaryTM_phase2_Some_of ?? q (None ?) … [ ] Htrans)
+ lapply (binaryTM_phase3 ? M qn (None ?) (displ_of_move sig mv) ?
+ (mk_tape FinBool (reverse bool (bin_char sig chn)@[]) (None ?) [ ])) [//]
+ cases (IH (tape_move ? (midtape ? [ ] chn [ ]) mv) qn) -IH #k0 * #Hk0 * #IH #IHNone
+ #phase3 #phase2 #phase4 #phase0
+ %{(1 + 1 + (S (FS_crd sig)) + S (displ_of_move sig mv) + k0)} %
+ [ @le_S_S @(le_plus O) // ]
+ >state_bin_lift_unfold >phase0 [|//]
+ >phase4 [|//]
+ >phase2 [| <plus_minus [|//] // ]
+ >phase3 [| <plus_minus [|//] <plus_minus [|//] // ]
+ >(?: 1+1+S (FS_crd sig) + S (displ_of_move sig mv)+k0-1-1
+ -S (FS_crd sig)-S (displ_of_move sig mv) = k0)
+ [| <plus_minus [|//] <plus_minus [|//] // ]
+ -phase0 -phase2 -phase3 -phase4 <state_bin_lift_unfold
+ >(?: iter ? (λt0.tape_move ? t0 L) (displ_of_move sig mv)
+ (mk_tape ? (reverse ? (bin_char sig chn)@[]) (None ?) [ ])
+ = tape_bin_lift ? (tape_move ? (tape_write ? (niltape ?) (Some ? chn)) mv))
+ [ % #Hloop
+ [ @IH <Hloop @eq_f whd in ⊢ (???%); <Htrans %
+ | @IHNone <Hloop @eq_f whd in ⊢ (???%); <Htrans % ]
+ | cases mv
+ [ >(?:displ_of_move sig L = FS_crd sig+FS_crd sig) [|normalize //]
+ >iter_split change with (mk_tape ?? (option_hd ? [ ]) (tail ? [ ])) in ⊢ (??(????(????%))?);
+ >iter_tape_move_L [| >eq_length_bin_char_FS_crd // ]
+ >append_nil in ⊢ (??(????(???%?))?);
+ >tail_tech [| >eq_length_bin_char_FS_crd // ]
+ >iter_tape_move_L_left [|//]
+ normalize in match (tape_move ???);
+ >tape_bin_lift_unfold %
+ | normalize in match (displ_of_move ??); >iter_O
+ normalize in match (tape_move ???);
+ >tape_bin_lift_unfold %
+ | normalize in match (displ_of_move ??);
+ change with (mk_tape ?? (option_hd ? [ ]) (tail ? [ ])) in ⊢ (??(????%)?);
+ >iter_tape_move_L [|>eq_length_bin_char_FS_crd // ]
+ normalize in match (tape_move ???); >tape_bin_lift_unfold
+ >opt_bin_char_Some >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ] % ]
+ ]
+ | #l0 #ls0 #_ lapply (binaryTM_phase4_write ? M q (None ?) (tape_bin_lift ? (rightof ? l0 ls0)) ?)
+ [ >tape_bin_lift_unfold >current_mk_tape % ]
+ lapply (binaryTM_phase2_Some_of ?? q (None ?) … (rev_bin_list ? (l0::ls0)) Htrans)
+ lapply (binaryTM_phase3 ? M qn (None ?) (displ_of_move sig mv) ?
+ (mk_tape FinBool (reverse bool (bin_char sig chn)@rev_bin_list ? (l0::ls0)) (None ?) [ ])) [//]
+ cases (IH (tape_move ? (midtape ? (l0::ls0) chn [ ]) mv) qn) -IH #k0 * #Hk0 * #IH #IHNone
+ #phase3 #phase2 #phase4 #phase0
+ %{(1 + 1 + (S (FS_crd sig)) + S (displ_of_move sig mv) + k0)} %
+ [ @le_S_S @(le_plus O) // ]
+ >state_bin_lift_unfold >phase0 [|//]
+ >(?:tape_move ? (tape_bin_lift ? (rightof ? l0 ls0)) R = tape_bin_lift ? (rightof ? l0 ls0))
+ [| >tape_bin_lift_unfold normalize in match (option_hd ??); normalize in match (right ??);
+ normalize in match (tail ??); normalize in match (left ??);
+ >(?:rev_bin_list ? (l0::ls0) = reverse ? (bin_char ? l0)@rev_bin_list ? ls0) [|%]
+ cases (reverse ? (bin_char ? l0)) // cases (rev_bin_list ? ls0) // ]
+ >phase4 [|//]
+ >phase2 [|<plus_minus [|//] // ]
+ >phase3 [|<plus_minus [|//] <plus_minus [|//] // ]
+ >(?: 1+1+S (FS_crd sig) + S (displ_of_move sig mv)+k0-1-1
+ -S (FS_crd sig)-S (displ_of_move sig mv) = k0)
+ [| <plus_minus [|//] <plus_minus [|//] // ]
+ -phase0 -phase2 -phase3 -phase4 <state_bin_lift_unfold
+ >(?: iter ? (λt0.tape_move ? t0 L) (displ_of_move sig mv)
+ (mk_tape ? (reverse ? (bin_char sig chn)@rev_bin_list ? (l0::ls0)) (None ?) [ ])
+ = tape_bin_lift ? (tape_move ? (tape_write ? (rightof ? l0 ls0) (Some ? chn)) mv))
+ [ % #Hloop
+ [ @IH <Hloop @eq_f whd in ⊢ (???%); <Htrans %
+ | @IHNone <Hloop @eq_f whd in ⊢ (???%); <Htrans % ]
+ | cases mv
+ [ >(?:displ_of_move sig L = FS_crd sig+FS_crd sig) [|normalize //]
+ >iter_split change with (mk_tape ?? (option_hd ? [ ]) (tail ? [ ])) in ⊢ (??(????(????%))?);
+ >iter_tape_move_L [|>eq_length_bin_char_FS_crd // ]
+ >append_nil in ⊢ (??(????(???%?))?); >tail_tech [|>eq_length_bin_char_FS_crd // ]
+ >(?:rev_bin_list ? (l0::ls0) = reverse ? (bin_char ? l0)@rev_bin_list ? ls0) [|%]
+ >append_nil >iter_tape_move_L [|>eq_length_bin_char_FS_crd // ]
+ normalize in match (tape_move ???);
+ >tape_bin_lift_unfold @eq_f2
+ [ >hd_tech [|>eq_length_bin_char_FS_crd // ] %
+ | >tail_tech [|>eq_length_bin_char_FS_crd // ] >opt_bin_char_Some
+ normalize in match (bin_list ??); >append_nil %]
+ | normalize in match (displ_of_move ??); >iter_O
+ normalize in match (tape_move ???);
+ >tape_bin_lift_unfold %
+ | normalize in match (displ_of_move ??);
+ change with (mk_tape ?? (option_hd ? [ ]) (tail ? [ ])) in ⊢ (??(????%)?);
+ >iter_tape_move_L [|>eq_length_bin_char_FS_crd // ]
+ normalize in match (tape_move ???); >tape_bin_lift_unfold
+ >opt_bin_char_Some >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ] % ]
+ ]
+ ]
+ ]
+ (*** midtape ***)
+ | * #ls * #c * #rs #Ht >Ht
+ cut (∃qn,chn,mv.〈qn,chn,mv〉 = trans ? M 〈q,Some ? c〉)
+ [ cases (trans ? M 〈q,Some ? c〉) * #qn #chn #mv /4 by ex_intro/ ]
+ * #qn * #chn * #mv #Htrans
+ cut (tape_bin_lift ? t = ?) [| >tape_bin_lift_unfold % ]
+ >Ht in ⊢ (???%→?); >opt_bin_char_Some >left_midtape >right_midtape #Ht'
+ lapply (binaryTM_phase0_midtape ?? (tape_bin_lift ? t) q … (None ?) Hcrd Hhalt Ht')
+ lapply (binaryTM_phase1 ?? q (reverse ? (bin_char ? c)) (rev_bin_list ? ls)
+ (option_hd ? (bin_list ? rs)) (tail ? (bin_list ? rs)) (Some ? c) ??)
+ [ cases (bin_list ? rs) // #r0 #rs0 normalize in ⊢ (%→?); #H destruct (H)
+ | >length_reverse >eq_length_bin_char_FS_crd // |]
+ >opt_cons_hd_tl >reverse_reverse
+ cases chn in Htrans; -chn
+ [ #Htrans
+ lapply (binaryTM_phase2_None … Htrans (FS_crd sig) ?
+ (mk_tape FinBool (rev_bin_list sig ls)
+ (option_hd FinBool (bin_char sig c@bin_list sig rs))
+ (tail FinBool (bin_char sig c@bin_list sig rs)))) [//]
+ lapply (binaryTM_phase3 ? M qn (Some ? c) (displ_of_move sig mv) ?
+ (mk_tape FinBool (reverse bool (bin_char sig c)@rev_bin_list ? ls)
+ (option_hd FinBool (bin_list sig rs)) (tail FinBool (bin_list sig rs)))) [//]
+ cases (IH (tape_move ? (tape_write ? (midtape ? ls c rs) (None ?)) mv) qn) -IH #k0 * #Hk0 * #IH #IHNone
+ #phase3 #phase2 #phase1 #phase0
+ %{(S (FS_crd sig) + S (FS_crd sig) + S (FS_crd sig) + S (displ_of_move sig mv) + k0)} %
+ [ @le_S_S @(le_plus O) // ]
+ >state_bin_lift_unfold <Ht >phase0 [|//]
+ >phase1 [|/2 by monotonic_le_minus_l/]
+ >phase2 [|/2 by monotonic_le_minus_l/]
+ >iter_tape_move_R [|>eq_length_bin_char_FS_crd // ]
+ >phase3 [|/2 by monotonic_le_minus_l/]
+ -phase0 -phase1 -phase2 -phase3
+ >(?: S (FS_crd sig) + S (FS_crd sig) + S (FS_crd sig) + S (displ_of_move sig mv) + k0
+ - S (FS_crd sig) - S (FS_crd sig) - S (FS_crd sig) - S (displ_of_move sig mv)
+ = k0) [| <plus_minus [|//] <plus_minus [|//] <plus_minus [|//] // ]
+ <state_bin_lift_unfold
+ >(?: iter ? (λt0.tape_move ? t0 L) (displ_of_move sig mv)
+ (mk_tape ? (reverse ? (bin_char sig c)@rev_bin_list ? ls)
+ (option_hd ? (bin_list ? rs)) (tail ? (bin_list ? rs)))
+ = tape_bin_lift ? (tape_move ? (tape_write ? (midtape ? ls c rs) (None ?)) mv))
+ [ % #Hloop
+ [ @IH <Hloop @eq_f whd in ⊢ (???%); >Ht <Htrans %
+ | @IHNone <Hloop @eq_f whd in ⊢ (???%); >Ht <Htrans % ]
+ | normalize in match (tape_write ???); cases mv in Htrans; #Htrans
+ [ >(?:displ_of_move sig L = FS_crd sig+FS_crd sig) [|normalize //]
+ >iter_split >iter_tape_move_L [| >eq_length_bin_char_FS_crd // ]
+ cases ls
+ [ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ]
+ >iter_tape_move_L_left [|//]
+ >tape_bin_lift_unfold %
+ | #l0 #ls0 >(?:rev_bin_list ? (l0::ls0) = reverse ? (bin_char ? l0)@rev_bin_list ? ls0) [|%]
+ normalize in match (tape_move ???);
+ >iter_tape_move_L [|>eq_length_bin_char_FS_crd // ]
+ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ]
+ >tape_bin_lift_unfold % ]
+ | normalize in match (displ_of_move ??); >iter_O cases rs
+ [ normalize in match (tape_move ???); >tape_bin_lift_unfold %
+ | #r0 #rs0 normalize in match (tape_move ???);
+ >tape_bin_lift_unfold >opt_bin_char_Some
+ >left_midtape >right_midtape
+ >(?:bin_list ? (r0::rs0) = bin_char ? r0@bin_list ? rs0) [|%]
+ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ] %
+ ]
+ | normalize in match (displ_of_move ??); >iter_tape_move_L
+ [|>eq_length_bin_char_FS_crd // ]
+ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ] >tape_bin_lift_unfold %
+ ]
+ ]
+ | #chn #Htrans
+ lapply (binaryTM_phase2_Some_ow ?? q (Some ? c) ??? (rev_bin_list ? ls) (bin_char ? c) (bin_list ? rs) Htrans ?)
+ [>eq_length_bin_char_FS_crd // ]
+ lapply (binaryTM_phase3 ? M qn (Some ? c) (displ_of_move sig mv) ?
+ (mk_tape FinBool (reverse bool (bin_char sig chn)@rev_bin_list ? ls)
+ (option_hd FinBool (bin_list sig rs)) (tail FinBool (bin_list sig rs)))) [//]
+ cases (IH (tape_move ? (tape_write ? (midtape ? ls c rs) (Some ? chn)) mv) qn) -IH #k0 * #Hk0 * #IH #IHNone
+ #phase3 #phase2 #phase1 #phase0
+ %{(S (FS_crd sig) + S (FS_crd sig) + S (FS_crd sig) + S (displ_of_move sig mv) + k0)} %
+ [ @le_S_S @(le_plus O) // ]
+ >state_bin_lift_unfold <Ht >phase0 [|//]
+ >phase1 [|/2 by monotonic_le_minus_l/]
+ >phase2 [|/2 by monotonic_le_minus_l/]
+ >phase3 [|/2 by monotonic_le_minus_l/]
+ -phase0 -phase1 -phase2 -phase3
+ >(?: S (FS_crd sig) + S (FS_crd sig) + S (FS_crd sig) + S (displ_of_move sig mv) + k0
+ - S (FS_crd sig) - S (FS_crd sig) - S (FS_crd sig) - S (displ_of_move sig mv)
+ = k0)
+ [| <plus_minus [|//] <plus_minus [|//] <plus_minus [|//] // ]
+ <state_bin_lift_unfold
+ >(?: iter ? (λt0.tape_move ? t0 L) (displ_of_move sig mv)
+ (mk_tape ? (reverse ? (bin_char sig chn)@rev_bin_list ? ls)
+ (option_hd ? (bin_list ? rs)) (tail ? (bin_list ? rs)))
+ = tape_bin_lift ? (tape_move ? (tape_write ? (midtape ? ls c rs) (Some ? chn)) mv))
+ [ % #Hloop
+ [ @IH <Hloop @eq_f whd in ⊢ (???%); >Ht <Htrans %
+ | @IHNone <Hloop @eq_f whd in ⊢ (???%); >Ht <Htrans % ]
+ | normalize in match (tape_write ???); cases mv in Htrans; #Htrans
+ [ >(?:displ_of_move sig L = FS_crd sig+FS_crd sig) [|normalize //]
+ >iter_split >iter_tape_move_L [|>eq_length_bin_char_FS_crd // ]
+ cases ls
+ [ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ] >iter_tape_move_L_left [|//]
+ >tape_bin_lift_unfold %
+ | #l0 #ls0 >(?:rev_bin_list ? (l0::ls0) = reverse ? (bin_char ? l0)@rev_bin_list ? ls0) [|%]
+ normalize in match (tape_move ???);
+ >iter_tape_move_L [|>eq_length_bin_char_FS_crd // ]
+ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ]
+ >tape_bin_lift_unfold % ]
+ | normalize in match (displ_of_move ??); >iter_O cases rs
+ [ normalize in match (tape_move ???); >tape_bin_lift_unfold %
+ | #r0 #rs0 normalize in match (tape_move ???);
+ >tape_bin_lift_unfold >opt_bin_char_Some
+ >left_midtape >right_midtape
+ >(?:bin_list ? (r0::rs0) = bin_char ? r0@bin_list ? rs0) [|%]
+ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ] %
+ ]
+ | normalize in match (displ_of_move ??); >iter_tape_move_L [|>eq_length_bin_char_FS_crd // ]
+ >hd_tech [|>eq_length_bin_char_FS_crd // ]
+ >tail_tech [|>eq_length_bin_char_FS_crd // ] >tape_bin_lift_unfold %
+ ]
+ ]
+ ]
+ ]
+]
+qed.
-*)
\ No newline at end of file
+definition R_bin_lift ≝ λsig,R,t1,t2.
+ ∀u1.t1 = tape_bin_lift sig u1 →
+ ∃u2.t2 = tape_bin_lift sig u2 ∧ R u1 u2.
+
+theorem sem_binaryTM :
+ ∀sig,M,R.O < FS_crd sig → M ⊫ R → mk_binaryTM sig M ⊫ R_bin_lift ? R.
+#sig #M #R #Hcrd #HM #t #k #outc #Hloopbin #u #Ht
+lapply (refl ? (loopM ? M k (initc ? M u))) cases (loopM ? M k (initc ? M u)) in ⊢ (???%→?);
+[ #H cases (binaryTM_loop ? M k u (start ? M) Hcrd u (start ? M))
+ #k0 * #Hlt * #_ #H1 lapply (H1 H) -H -H1 <Ht
+ whd in match (initc ???) in Hloopbin; whd in match (start ??) in Hloopbin;
+ >state_bin_lift_unfold >(loop_incr2 … Hlt Hloopbin) #H destruct (H)
+| * #qf #tf #H cases (binaryTM_loop ? M k tf qf Hcrd u (start ? M))
+ #k0 * #Hlt * #H1 #_ lapply (H1 H) -H1 <Ht
+ whd in match (initc ???) in Hloopbin; whd in match (start ??) in Hloopbin;
+ >state_bin_lift_unfold >(loop_incr2 … Hlt Hloopbin) #Heq destruct (Heq)
+ % [| % [%]] @(HM … H)
+qed.
\ No newline at end of file
projects / helm.git / blobdiff