[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 butmin-rewput
⊦ a ≠ (st[a := d]).min → (st[a := d]).butmin = st.butmin[a := d]
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 17
Used lemmas:
min-put
,
min-def
,
Min-in
,
min
,
Keys
,
inf
,
Min-min
,
Butmin
,
Used spec theorems:
map
/
Extension
map
/
Del-at
Used simplifier rules:
map
/
Del-in
map
/
insin
map
/
Del-at
map
/
At-same
map
/
At-other
map
/
in-neq
tord
/
sls
map
/
notmemlookup
map
/
lookupisempty
map
/
Del-notin
weakord
/tord/
irreflexivity
map
/
notin-del-notin