[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 min-comm (
previous step
)
⊦ n1 = (n1 < n0 ⊃ n1;n0), n0 < n1
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 5
:
n1 ≤ n0 ⊦ n1 = (n1 < n0 ⊃ n1;n0)
Rule argument
Additional information
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)