[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 div2-2pot-01
⊦ 0 ≤ i ∧ 0 ≤ j → (j / 2) / 2 ^ i = j / 2 ^ (i + 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: 5
Used lemmas:
Pot-pos
,
two-lez
,
Used spec theorems:
int-div
/
div-div-pos
Used simplifier rules:
int-abs
/
mone-06
int-abs
/
numlef-01
int-abs
/
lels
int-abs
/
leone
int-div
/
neqf
int-abs
/
numlsf-02
int-basic2
/
pred
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
commutativity
int-abs
/
succ-02
int-abs
/
le-def
int-abs
/
lels-04