[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 divup-half
⊦ (m /↑ 2^ n) /↑ 2 = m /↑ 2^(n + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
shearsort-correct
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 23
Proof steps: 58
Used lemmas:
divup-def
,
divup2-def
,
Used spec theorems:
nat-div
/
mult
nat-div
/
zero-01
Used simplifier rules:
nat-basic
/
c
nat-basic
/
a
nat-pot
/
lemma-ax2
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-div
/
mult-01
nat-pot
/
zero
nat-div
/
div-elim
nat-basic
/
f
nat
/
l-num-05
nat-basic
/
one-01
nat-even
/
eo-02
nat-mult
/
coef-17
nat-basic
/
succ
nat-mult
/
rsucc-02
nat-basic
/
add-base
nat-even
/
modd-03
nat-mult
/
two-zero-01
nat-even
/
meven-02
nat-basic
/
eq-02
nat-mult
/
modeq-01
nat-basic
/
eq-01
nat-mult
/
zero
nat-mult
/
one-01
nat-even
/
oe-02
nat-basic
/
z-01
nat-div
/
mult
nat-div
/
zero-01
nat-pot
/
div-eq-zero
nat-mult
/
numeral-36
nat-mult
/
one
nat
/
lels
nat
/
ls-le-simp
nat-mult
/
modeq
nat-even
/
eo-01
nat-even
/
odd-div2
nat-mult
/
two-succ-05
nat-basic
/
one-03
nat-mult
/
twole
nat-div
/
two-rec
nat-mult
/
le-05