[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 24 from proof nu-is-UN (
previous step
)
S ⊆ f(S), S(x), compl(f)(λ x0. ¬ S(x0)) ⊆ (λ x0. ¬ S(x0)) → ¬ S(x) ⊦
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 25
:
S ⊆ f(S), S(x) ⊦ compl(f)(λ x0. ¬ S(x0)) ⊆ (λ x0. ¬ S(x0))
Rule argument
Additional information