[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 gstepf-DoEnq
⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), invEnq, ADoEnq(tid)) = gs.queue:= (gs.queue + ival)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
DQ-refines-DurQ
,
DMSQ-refines-DQ
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 5
Used lemmas:
sel-mkls-dotival
,
sel-mkgs-dotqueue
,
sel-mkls-dottid
,
gstepf-invEnq-ADOENQ
,
upd-mkgs-dotqueue
,
elim-mkgs
,
Used spec theorems:
Used simplifier rules:
list
/
Last