[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 16 from proof nodups-butlastn (
previous step
)
a ∈ butlastn(n, x0), n ≤ # x0, n ≤ 1 + # x0, ∀ n0. ¬ dups(butlastn(n0, x0)) ∨ ¬ n0 ≤ # x0 ⊦ dups(x0), a ∈ x0
User applied rule weakening
And obtained the following new goals
Proof step 17
:
a ∈ butlastn(n, x0), n ≤ # x0 ⊦ a ∈ x0
Rule argument
poslist: left 3, left 4, right 1
Additional information