[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 4 from proof butlast-last (
previous step
)
⊦ x.butlast + x.last = x, x = []
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 5
:
⊦ x ≠ [] → x.butlast + x.last = x
Rule argument
spec: list-last inst: name: last-02 seq: ⊦ x ≠ [] → x.butlast + x.last = x subst: [x] → [x] flags: rewrite, current
Additional information
Used terms: x