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?
coq
add a comment |
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?
coq
add a comment |
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?
coq
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
coq
asked Nov 10 at 19:20
Harry Qu
205
205
add a comment |
add a comment |
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).
add a comment |
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).
add a comment |
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).
add a comment |
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).
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).
answered Nov 10 at 19:36
ejgallego
5,2541825
5,2541825
add a comment |
add a comment |
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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