[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 2 from proof lr-01 (
previous step
)
⊦ x = [], y = [], # x.tail + # y.tail < # x + # y
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
# x + # y ≤ # x.tail + # y.tail ⊦ x = [], y = []
Rule argument
Additional information
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)