[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 (conclusion)
⊦ m ≠ 0 ∧ m ≤ # x → firstn(m, x).last = x[m -1]
System applied rule normalize
And obtained the following new goals
Proof step 2
:
m ≤ # x ⊦ firstn(m, x).last = x[m -1], m = 0
Rule argument
Additional information