[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 11 from proof nu-is-UN (
previous step
)
monotone(f) ⊦ ¬ μ(compl(f))(x) ↔ (∃ S. S ⊆ f(S) ∧ S(x)), monotone(compl(f))
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 12
:
⊦ monotone(f) → (monotone(compl(f)) ↔ true)
Rule argument
spec: <toplevel> name: compl-monotone seq: ⊦ monotone(f) → (monotone(compl(f)) ↔ true) subst: [f] → [f] flags: <all paths>
Additional information
Used terms: f