Coq: (a :: L1) = (b :: L2) ⇒ a = b ∧ L1 = L2?











up vote
1
down vote

favorite












This statement seems obvious to me, unless I'm overlooking some counterexample, but I couldn't find anything in the Coq lists library that does this. Is there a command that does something to this effect?










share|improve this question


























    up vote
    1
    down vote

    favorite












    This statement seems obvious to me, unless I'm overlooking some counterexample, but I couldn't find anything in the Coq lists library that does this. Is there a command that does something to this effect?










    share|improve this question
























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      This statement seems obvious to me, unless I'm overlooking some counterexample, but I couldn't find anything in the Coq lists library that does this. Is there a command that does something to this effect?










      share|improve this question













      This statement seems obvious to me, unless I'm overlooking some counterexample, but I couldn't find anything in the Coq lists library that does this. Is there a command that does something to this effect?







      coq






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked Nov 10 at 19:20









      Harry Qu

      205




      205
























          1 Answer
          1






          active

          oldest

          votes

















          up vote
          3
          down vote



          accepted










          This can be usually derived using the injection tactic. A version of the lemma for rewriting can be found in math-comp:



          eqseq_cons (T : eqType) (x1 x2 : T) (s1 s2 : seq T) :
          (x1 :: s1 == x2 :: s2) = (x1 == x2) && (s1 == s2).





          share|improve this answer





















            Your Answer






            StackExchange.ifUsing("editor", function () {
            StackExchange.using("externalEditor", function () {
            StackExchange.using("snippets", function () {
            StackExchange.snippets.init();
            });
            });
            }, "code-snippets");

            StackExchange.ready(function() {
            var channelOptions = {
            tags: "".split(" "),
            id: "1"
            };
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function() {
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled) {
            StackExchange.using("snippets", function() {
            createEditor();
            });
            }
            else {
            createEditor();
            }
            });

            function createEditor() {
            StackExchange.prepareEditor({
            heartbeatType: 'answer',
            convertImagesToLinks: true,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            });


            }
            });














             

            draft saved


            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53242574%2fcoq-a-l1-b-l2-%25e2%2587%2592-a-b-%25e2%2588%25a7-l1-l2%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            3
            down vote



            accepted










            This can be usually derived using the injection tactic. A version of the lemma for rewriting can be found in math-comp:



            eqseq_cons (T : eqType) (x1 x2 : T) (s1 s2 : seq T) :
            (x1 :: s1 == x2 :: s2) = (x1 == x2) && (s1 == s2).





            share|improve this answer

























              up vote
              3
              down vote



              accepted










              This can be usually derived using the injection tactic. A version of the lemma for rewriting can be found in math-comp:



              eqseq_cons (T : eqType) (x1 x2 : T) (s1 s2 : seq T) :
              (x1 :: s1 == x2 :: s2) = (x1 == x2) && (s1 == s2).





              share|improve this answer























                up vote
                3
                down vote



                accepted







                up vote
                3
                down vote



                accepted






                This can be usually derived using the injection tactic. A version of the lemma for rewriting can be found in math-comp:



                eqseq_cons (T : eqType) (x1 x2 : T) (s1 s2 : seq T) :
                (x1 :: s1 == x2 :: s2) = (x1 == x2) && (s1 == s2).





                share|improve this answer












                This can be usually derived using the injection tactic. A version of the lemma for rewriting can be found in math-comp:



                eqseq_cons (T : eqType) (x1 x2 : T) (s1 s2 : seq T) :
                (x1 :: s1 == x2 :: s2) = (x1 == x2) && (s1 == s2).






                share|improve this answer












                share|improve this answer



                share|improve this answer










                answered Nov 10 at 19:36









                ejgallego

                5,2341825




                5,2341825






























                     

                    draft saved


                    draft discarded



















































                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53242574%2fcoq-a-l1-b-l2-%25e2%2587%2592-a-b-%25e2%2588%25a7-l1-l2%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    Xamarin.iOS Cant Deploy on Iphone

                    Glorious Revolution

                    Dulmage-Mendelsohn matrix decomposition in Python