[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 eq-write-left
⊦ cu[nx, ny, nz := a] = cu ↔ ¬ nx < #x cu ∨ ¬ ny < #y cu ∨ ¬ nz < #z cu ∨ cu[nx, ny, nz] = a
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
size-0-d
,
size-0-h
,
size-0-w
,
Used by units in proved state:
rowcol-upd
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
putgetinv
,
ngp-07-h
,
ngp-07-d
,
ngp-07-w
,
put-same
,
height-put
,
depth-put
,
width-put
,
extension
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat
/
lels
nat
/
fle