[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 twopot-mone-div
⊦ j ≤ i ∧ 0 ≤ j → (2 ^ i - 1) / 2 ^ j = 2 ^ i / 2 ^ j - 1
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: 7
Proof steps: 13
Used lemmas:
pot2-pos
,
eq-one
,
two-zero
,
Pot-pos
,
Used spec theorems:
int-mult
/
commutativity
int-div
/
div-two-01
int-div
/
two-mult
Used simplifier rules:
int-abs
/
forward-lele
int-abs
/
forward-le-01
int-div
/
zero
int-div
/
one-02
int-abs
/
lels
int-abs
/
anti
int-div
/
one
int-mult
/
eq-pos
int-abs
/
numls-02
int-abs
/
mone-06
int-abs
/
elim-sub
int-abs
/
forward-le-05
int-abs
/
sub-pred
int-abs
/
sub-le
int-abs
/
Sub-def
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-le-01
int-abs
/
leone
int-abs
/
sub-eq
intnat
/
abs-pred
int-div
/
div-mult-01
int-mult
/
associativity
int-mult
/
commutativity