[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 min-put
⊦ a ≠ st[a, d].min → st[a, d].min = st.min
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
butmin-rewput
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
empty
,
inf
,
Min-min
,
Keys
,
notempty
,
insert-03
,
min-def
,
Used spec theorems:
oset
/
min-insert
oset
/
min-ins-01
Used simplifier rules:
store
/
neq
oset
/
min-one
set-basic
/
size-zero
set-basic
/
size-zero-01
oset
/
min-inn
oelem
/
transitivity
oelem
/
sls
set-basic
/
Size-empty