[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 3 from proof new-exists (
previous step
)
∃ ino. ino ≠ 0 ∧ (∀ n. n ∈ dirs ∨ n ∈ files → n < ino) ⊦ ∃ ino. ino ≠ 0 ∧ ¬ ino ∈ dirs ∧ ¬ ino ∈ files
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
∀ n. n ∈ dirs ∨ n ∈ files → n < ino ⊦ ino = 0, ∃ ino. ino ≠ 0 ∧ ¬ ino ∈ dirs ∧ ¬ ino ∈ files
Rule argument
Additional information