[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 mod-mod
⊦ 0 < j → (i |%| j) |%| j = i |%| j
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
congmod-def-mod
,
congmod-inverse-smallest
,
ex-modeq-half
,
fermat-for-rsa
,
mod-pot-pot
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
mod-le-same
,
mod-pos
,
mod-zero
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
lels-01
int-abs
/
lels