[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 lls-fold-tail (conclusion)
x ≠ [] ⊦ ((r1 => x.last × r2 * lls(r0, r1, x.butlast) * P))(H) → ((lls(r0, r2, x) * P))(H)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
((r1 => x.last × r2 * lls(r0, r1, x.butlast) * P))(H) ⊦ x = [], ((lls(r0, r2, x) * P))(H)
Rule argument
Additional information