[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
,
Proof step 4 from proof coinduction (
previous step
)
ν(f) = UN(λ S. S ⊆ f(S)), φ(x), monotone(f), ∀ x. φ(x) → f(λ x. ν(f)(x) ∨ φ(x))(x) ⊦ ν(f)(x)
User applied rule insert equation
And obtained the following new goals
Proof step 5
:
φ(x), monotone(f), ∀ x. φ(x) → f(λ x. ν(f)(x) ∨ φ(x))(x) ⊦ UN(λ S. S ⊆ f(S))(x)
Rule argument
pos: left 1 flags: discard, [[2,1,0]]
Additional information