[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-2-h
⊦ nz ≠ nz0 → ( (cu[nx, ny, nz := a0])[nx0, ny0, nz0 := a1] = (cu[nx0, ny0, nz0 := b1])[nx, ny, nz := b0] ↔ (nx < #x cu ∧ ny < #y cu ∧ nz < #z cu → a0 = b0) ∧ (nx0 < #x cu ∧ ny0 < #y cu ∧ nz0 < #z cu → a1 = b1))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
cputput-reverse-h
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 24
Used lemmas:
put-otherdepth
,
put-otherwidth
,
ngp-07-w
,
put-same
,
put-otherheight
,
height-put
,
depth-put
,
width-put
,
extension
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat
/
fle
nat
/
lels