Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Tag for questions about induction such as mathematical induction, structural induction or well-founded induction (Noetherian).
3
votes
1
answer
104
views
Stuck in a proof about sum types and nonempty lists
Here is my attempt at proving the goal:
Proof.
induction l as [[ | [ | ]] | [ | [ | ]] l IH]; auto.
- cbn.
rewrite IH.
destruct (filter l) as [l' | e'] eqn: Hfilter; [ | reflexivity].
cbn. … If it is true, then it appears that it cannot be proved by a simple structural induction.
Would you have a proof? A counterexample? A hint? …