[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 add-eq2pot
⊦ 0 ≤ j ∧ 0 ≤ i ∧ 0 ≤ i0 → (2 ^ i = 2 ^ i0 + j ↔ j = 2 ^ i0 * (2 ^ (i - i0) - 1) ∧ i0 ≤ i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
add-eq2pot-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 13
Used lemmas:
eq-two
,
ls-pos-2pot
,
two-minus
,
pot-dist-pos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
elim-sub
int-abs
/
lep
int-abs
/
lels-03
int-abs
/
negeq
int-mult
/
minus-one-02
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-abs
/
numadd-01
int-abs
/
lels-01
int-abs
/
zero-gels-01
int-basic2
/
ls
int-abs
/
lenls
int-abs
/
forward-le-01
int-abs
/
sub-eq
int-abs
/
Sub-def
int-mult
/
eq-dist
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-04