[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 always-noincrease-stable
□ (A'' ≪ A ∨ A'' = A) ⊦ ◇ □ A'' = A
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: 21
Proof steps: 28
Used lemmas:
not-always-decrease-test
,
Used spec theorems:
Used simplifier rules:
wellfounded
/
irrefl
nat-basic
/
succ
nat-basic
/
s-04
nat-basic
/
refl-nat
nat-basic
/
a
nat-basic
/
c
wellfounded
/
trans