[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 5 from proof restn-nonempty (
previous step
)
restn(n, a ' + a0 ' + x0) = [], n ≤ # x0, (∃ n, a. restn(n, a ' + x0) = [] ∧ n < # x0) → x0 = [] ⊦ x0 = []
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 6
:
restn(n, a ' + a0 ' + x0) = [], n ≤ # x0 ⊦ x0 = [], ∃ n, a. restn(n, a ' + x0) = [] ∧ n < # x0
Rule argument
Additional information