[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 1 from proof not-mtwo (conclusion)
⊦ 0 ≤ j ∧ 0 ≤ i → i + j ≠ ~2
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
i + j = ~2 ⊦ j < 0, i < 0
Rule argument
Additional information
Used simplifier rules: le-def: ⊦ i ≤ j ↔ ¬ j < i;