[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 unchanged-levelsubset-equiv
⊦ ¬ junkref(str, r, st) ∧ level⊆(str, str0) → (unchanged(str, r, st, st0) ↔ unchanged(str0, r, st, st0))
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: 9
Proof steps: 16
Used lemmas:
unchanged-symmetric
,
unchanged-junkref-level
,
unchanged-def-keep
,
unchanged-def
,
unchanged-levelsubset
,
Used spec theorems:
cyclic
/
pathex-levelsubset-equiv
Used simplifier rules: