[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 le-one (
previous step
)
# x ≤ 1 ⊦ # x = 1, x = []
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules: l: ⊦ # x = 0 ↔ x = [];% ⊦ m < 1 ↔ m = 0; (s)% ⊦ m ≠ n → (m ≤ n ↔ m < n); (s)