[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 pot-mod-add-zero
⊦ 0 ≤ j ∧ 0 < j0 → ((i + i0 * j ^ j0) % j = 0 ↔ i % j = 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 14
Used lemmas:
Pot-pos
,
Used spec theorems:
int-abs
/
add-shift
int-mult
/
dist-sub-split
int-div
/
modex
int-mult
/
dist-lsplit
Used simplifier rules:
int-abs
/
sub-pred
int-abs
/
elim-sub
int-abs
/
forward-le-01
int-abs
/
mone-06
int-abs
/
numls-02
int-mult
/
zero-left
int-basic2
/
add-zero-rev
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
forward-le-05
int-abs
/
lels-02
int-div
/
mod-mult-04
int-mult
/
associativity
int-mult
/
commutativity