[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-two-ge-01
⊦ j < i ∧ 0 ≤ j → (2 ^ i - 1) % 2 ^ j = 2 ^ j - 1
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: 5
Proof steps: 14
Used lemmas:
pot-dist-pos
,
pot2-pos
,
pot2-pos-01
,
two-zero
,
Used spec theorems:
int-div
/
mod-rew
int-div
/
mult-05
Used simplifier rules:
int-abs
/
mone-06
int-abs
/
forward-lels
int-abs
/
numlef-01
int-mult
/
succ-rmerge
int-abs
/
sub-eq
int-abs
/
sub-sub
int-abs
/
Sub-def
int-mult
/
eq-pos
int-abs
/
leone
int-abs
/
numlsf-02
int-basic2
/
ls-02
int-abs
/
forward-le-05
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
anti
int-mult
/
one
int-mult
/
associativity
int-div
/
one
int-basic2
/
add-in
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
elim-sub
int-mult
/
commutativity
int-abs
/
lels-01
int-basic1
/
ls-01