(3steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc

At: list-dec-length

L: List, i:||L||. 0 < L[i] ||L[i--]|| = ||L||

By:
Auto
THEN
Unfold `list-dec` 0
THEN
RWO Thm* n:, f:(nT). ||mklist(n;f)|| = n 0
THEN
Try (Complete Auto)


Generated subgoal:

11. L: List
2. i: ||L||
3. 0 < L[i]
(j.if j=i L[j]-1 else L[j] fi) ||L||
2 steps

About:
listifthenelseintnatural_numbersubtractless_than
lambdafunctionuniverseequalmemberimplies
all

(3steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc