[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 elim-firstn-restn (conclusion)
⊦ n ≤ # x → (y = firstn(n, x) ∧ z = restn(n, x) ↔ x = y + z ∧ # y = n)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n ≤ # x ⊦ y = firstn(n, x) ∧ z = restn(n, x) ↔ x = y + z ∧ # y = n
Rule argument
Additional information