[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-ls-01
⊦ i ≤ j ∧ 0 ≤ i → (2 ^ i - 1) % 2 ^ j = 2 ^ i - 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: 1
Proof steps: 1
Used lemmas:
two-minus
,
two-le
,
pot2-pos
,
Used spec theorems:
int-div
/
mod-zero-03
Used simplifier rules:
int-abs
/
sub-eq
int-abs
/
sub-le-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
leone
int-abs
/
zero-gels-04
int-abs
/
sub-ls
int-abs
/
succ-02
int-abs
/
lels-01
int-abs
/
forward-lsle
int-abs
/
forward-le-02
int-abs
/
forward-le-01
int-abs
/
forward-lele
int-abs
/
forward-lels
int-abs
/
numadd-01
int-abs
/
zero-gels-01
int-abs
/
lenls