[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 int2int-lastn-2pot
⊦ i % 2 ^ n→i(m) = 0 ∧ m ≤ # int2bits(i) ∧ m ≠ 0 → bits2int(lastn(m, int2bits(i))) = 0
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: 2
Proof steps: 5
Used lemmas:
bits2int-zeros-03
,
bits2int-zero
,
int2bits-zero
,
int2bits-2pot-04
,
Used spec theorems:
int-div
/
modex
Used simplifier rules:
list
/bitlista/
a
list-del
/bitlista/
lastn-mklist-01
intnat
/
n2n
intnat
/
nat2int
int-mult
/
Mult-zero
int-mult
/
associativity
int-mult
/
commutativity
list
/bitlista/
len-02
nat
/
one-02
list-del
/bitlista/
lastn-one-01
int-pot
/
two-zero-01