[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-crt
≡mod(i ^ i0, i, j), ≡mod(i ^ i0, i, j0), prime(j), prime(j0), 0 < i, j ≠ j0, 0 ≤ i0 ⊦ i ^ i0 |%| (j * j0) = i |%| (j * j0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
RSA-decrypt-ij-vars
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
congmod-def-mod
,
cong-crt-01
,
Used spec theorems:
int-mult
/
zero-le
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
forward-le-01
int-abs
/
zero-gels-04
int-abs
/
forward-le-04
int-abs
/
forward-lele
int-abs
/
forward-lels
int-gcd
/
prime-not-neg-01
int-abs
/
lels
int-mult
/
zero-le-03
int-mult
/
associativity
int-mult
/
commutativity