[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 zero-gs (
previous step
)
i + j < 0 ⊦ i < 0, j < 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 3
:
¬ i < 0, ¬ j < 0 ⊦ ¬ i + j < 0
Rule argument
spec: int-basic2 inst: name: pls-01 seq: ¬ i < 0, ¬ j < 0 ⊦ ¬ i + j < 0 subst: [j, i] → [j, i] flags: rewrite
Additional information
Used terms: j, i