[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 prepost-next2pot
2exp-size(n) ⊦ ⟪bin_min_heap_next_2pot(minsize; n)⟫ (2exp-size(n) ∧ n ≥ minsize)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
prepost-resize
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 7
Used lemmas:
Used spec theorems:
Used simplifier rules:
nat-basic
/
l-01
nat
/
fle
nat-basic
/
f
nat
/
lels
nat
/
ls
nat
/
ge
bin-min-heap-inv
/
2exp-size-mult2
nat
/
lep
nat-basic
/
a
nat-basic
/
c
nat
/
le-add
nat
/
lep-02
nat-mult
/
twole
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-mult
/
numeral-30
nat-mult
/
one
nat-basic
/
z-01
bin-min-heap-inv
/
2exp-size-0
nat
/
le-def
nat
/
lels-03
nat-basic
/
add-base
nat
/
ls-le-simp
nat
/
elim-sub