proposition: Theorem make_listtc4irA c l1 l2 ll1 ll2 : tc4it _ make_list l1 l2 (ll1++ll2) c = ll1 ++ tc4it _ make_list l1 l2 ll2 c.
proof: Proof. case c; unfold tc4it; auto with datatypes. intros cc1 cc2 cc3 cc4; repeat rewrite make_listtc5irA; auto. Qed.
imports: PrimInt63 Cyclic63 List BasicRubik