[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 eq-one-neg (
previous step
)
~(i * j) = 1, i * j = ~1 ⊦ abs(j) = 1 ∧ j + i = 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 5
:
⊦ ~ i * j = ~(i * j)
Proof step 6
:
~ i * j = 1, i * j = ~1 ⊦ abs(j) = 1 ∧ j + i = 0
Rule argument
spec: int-mult inst: name: minus-left seq: ⊦ ~ i * j = ~(i * j) subst: [j, i] → [j, i] flags: rewrite, current
Additional information
Used terms: j, i