[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 18 from proof nu-is-UN (
previous step
)
∀ x. compl(f)(S)(x) → S(x) ⊦ S(x), f(λ x0. ¬ S(x0))(x0), S(x0)
User applied rule all left
And obtained the following new goals
Proof step 19
:
compl(f)(S)(x0) → S(x0) ⊦ S(x), f(λ x0. ¬ S(x0))(x0), S(x0)
Rule argument
pos: left 1 terms: x0 abort: F discard: T computed: T
Additional information
Used terms: x0