[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
,
Theorem cong-mult
⊦ ≡mod(j0 * j + i, i0, j) ↔ ≡mod(i, i0, j)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
cong-add
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
mod-mult-add
,
congmod-def
,
congmod-def-mod
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-04
int-abs
/
lels
int-gcd
/
div-abs-02
int-basic2
/
add-in
int-gcd
/
divides-mult-add
int-gcd
/
divides-add
int-gcd
/
div-mult
int-abs
/
elim-sub
int-abs
/
forward-le-05
int-basic2
/
add-c
int-basic2
/
add-a
int-mult
/
commutativity
int-mult
/
associativity