[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 coinduction
monotone(f), ∀ x. φ(x) → f(λ x. ν(f)(x) ∨ φ(x))(x) ⊦ ∀ x. φ(x) → ν(f)(x)
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: 13
Proof steps: 19
Used lemmas:
Used spec theorems:
monotone-set-fixpoint
/
nu-is-UN
monotone-set-fixpoint
/
union-def
monotone-set-fixpoint
/
monotone-def
monotone-set-fixpoint
/
subseteq-def
monotone-set-fixpoint
/
fixpoint-nu
Used simplifier rules: