[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 geom-mod
⊦ i ≠ 1 ∧ 0 ≤ j → (1 - i ^ j) % (1 - i) = 0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 21
Proof steps: 26
Used lemmas:
succ
,
Pot-zero
,
Used spec theorems:
int-div
/
modex
int-div
/
mod-neg
int-abs
/
minus-sub
int-abs
/
sub-minus
int-mult
/
minus-left
int-abs
/
neg-02
int-mult
/
dist-sub-merge
Used simplifier rules:
int-div
/
mod-zero-04
int-abs
/
forward-le-05
int-abs
/
sub-le-01
int-abs
/
leone
int-abs
/
lels
int-abs
/
lels-02
int-basic1
/
ls-01
intnat
/
abs-pred
int-abs
/
elim-sub
int-abs
/
forward-le-01
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
numadd-01
int-abs
/
sub-sub-04
int-abs
/
sub-add-01
int-mult
/
dist-rmerge
int-abs
/
sub-add
int-mult
/
one
int-basic2
/
add-zero
int-abs
/
sub-eq-01
int-abs
/
minus-sub
int-abs
/
minus-02
int-mult
/
minus-one-01
int-abs
/
Sub-def
int-abs
/
sub-eq
int-abs
/
neg-15
int-basic2
/
add-a
int-basic2
/
add-c
int-div
/
mod-mult-04
int-mult
/
associativity
int-mult
/
commutativity