d16862fd33
This PR lets `induction` accept eliminator where the motive application in the conclusion has complex arguments; these are abstracted over using `kabstract` if possible. This feature will go well with unfolding induction principles (#8088).
31 lines
1.3 KiB
Text
31 lines
1.3 KiB
Text
inductionErrors.lean:11:12-11:27: error: unsolved goals
|
|
case lower.h
|
|
p d : Nat
|
|
⊢ p ≤ p + d.succ
|
|
inductionErrors.lean:12:12-12:27: error: unsolved goals
|
|
case upper.h
|
|
q d : Nat
|
|
⊢ q + d.succ > q
|
|
inductionErrors.lean:16:19-16:26: error: unknown identifier 'elimEx2'
|
|
inductionErrors.lean:22:2-25:45: error: insufficient number of targets for 'elimEx'
|
|
inductionErrors.lean:28:16-28:23: error: expected resulting type of eliminator to be an application of one of its parameters (the motive):
|
|
Nat
|
|
inductionErrors.lean:35:11-35:15: error: unsolved goals
|
|
x : Nat
|
|
⊢ 0 + 0 = 0
|
|
inductionErrors.lean:36:11-36:15: error: unsolved goals
|
|
x y : Nat
|
|
⊢ 0 + (y + 1) = y + 1
|
|
inductionErrors.lean:40:14-40:18: error: unsolved goals
|
|
case zero
|
|
⊢ 0 + 0 = 0
|
|
inductionErrors.lean:41:14-41:18: error: unsolved goals
|
|
case succ
|
|
y : Nat
|
|
⊢ 0 + (y + 1) = y + 1
|
|
inductionErrors.lean:50:2-50:16: error: alternative 'cons' is not needed
|
|
inductionErrors.lean:55:2-55:16: error: alternative 'cons' is not needed
|
|
inductionErrors.lean:60:2-60:40: error: invalid alternative name 'upper2', expected 'diag' or 'upper'
|
|
inductionErrors.lean:66:2-66:28: error: invalid occurrence of wildcard alternative, it must be the last alternative
|
|
inductionErrors.lean:74:2-74:34: error: unused alternative '_'
|
|
inductionErrors.lean:80:2-80:56: error: duplicate alternative name 'lower'
|