[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 3 from proof forward-pos (
previous step
)
0 < j, 0 < i, i < j ⊦ 1 ≠ j
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
0 < i, i < 1 ⊦
Rule argument
Additional information
Used simplifier rules: trans: ⊦ i < j ∧ j < j0 → i < j0;