[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 1 from proof firstn-last-rec (conclusion)
⊦ n ≠ 0 ∧ n ≤ # x → firstn(n, x) = firstn(n -1, x) + x[n -1]
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n ≤ # x ⊦ firstn(n, x) = firstn(n -1, x) + x[n -1], n = 0
Rule argument
Additional information