[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 two-mod-01
⊦ 1 < i → (2 ^ i - 1) % 2 = 1
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
two-mone
,
Pot-pos
,
Used spec theorems:
int-div
/
mod-two-03
Used simplifier rules:
int-abs
/
numlef-01
int-abs
/
numlsf-02
int-abs
/
lels
int-abs
/
forward-lsle