[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 cong-mult-rew (conclusion)
⊦ ≡mod(i0, i2, j) → (≡mod(i * i0, i1, j) ↔ ≡mod(i * i2, i1, j))
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
≡mod(i0, i2, j) ⊦ ≡mod(i * i0, i1, j) ↔ ≡mod(i * i2, i1, j)
Rule argument
Additional information