[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 two-eq (conclusion)
⊦ 2 * i = 2 * j ↔ i = j
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ i ≠ 0 → (i * j = i * j0 ↔ j = j0)
Rule argument
spec: int-mult inst: name: eq-nonzero seq: ⊦ i ≠ 0 → (i * j = i * j0 ↔ j = j0) subst: [j0, j, i] → [j, i, 2] flags: rewrite, current
Additional information
Used terms: j, i, 2