[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 down-two-writtes
n < # avol0 ⊦ avol1 ↓ avol0[n, aleb0] → (avol1 ↓ avol0[n, aleb1] ↔ avol1[n] ↓ aleb1)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
awbuf-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 8
Used lemmas:
down-arrow-buf
,
down-arrow-block-def
,
down-arrow-def
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
array
/avolume/
Size-put
array
/avolume/
Put-same
nat-basic
/
lf-01
array
/avolume/
Put-other