[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 mod2-2pot-01
⊦ 0 ≤ i ∧ 0 ≤ j → (j % 2 ^ (i + 1)) / 2 = (j / 2) % 2 ^ i
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
divmod2-2pot
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
two-lez
,
two-zero
,
Pot-pos
,
Used spec theorems:
int-div
/
mod-twoodd
Used simplifier rules:
int-abs
/
forward-lels
int-abs
/
numlef-01
int-mult
/
zero-ge-add
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
mone-06
int-abs
/
numls-02
int-basic2
/
pred
int-basic2
/
add-zero
int-div
/
mod-mult-02
int-div
/
div-mult-03
int-abs
/
lels-02
int-abs
/
lstwo-01
int-abs
/
lels
int-abs
/
leone
int-abs
/
numlsf-02
int-div
/
div-two
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-div
/
div-elim-pos