[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 12 from proof min-le-diff-third (
previous step
)
n2 ≤ n2 - (n0 < (n1 < n2 ⊃ n1;n2) ⊃ n0;(n1 < n2 ⊃ n1;n2)) ⊦ n2 ≤ n2 - (n0 < (n1 < n2 ⊃ n1;n2) ⊃ n0;(n1 < n2 ⊃ n1;n2)) ↔ n0 = 0, n1 = 0, n2 = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 13
:
n2 ≤ n2 - (n0 < (n1 < n2 ⊃ n1;n2) ⊃ n0;(n1 < n2 ⊃ n1;n2)) ⊦ n0 = 0, n1 = 0, n2 = 0
Rule argument
Additional information