[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 1 from proof nodups-new (conclusion)
# ax0 = # ndx0 ⊦ ¬ dups(ax0) ∧ ¬ dups(ax1) ∧ new(ax1, fs1) ∧ fs1 = fs0[ax0, ndx0] → ¬ dups(ax0 + ax1)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
# ax0 = # ndx0, fs1 = fs0[ax0, ndx0], dups(ax0 + ax1), new(ax1, fs1) ⊦ dups(ax1), dups(ax0)
Rule argument
Additional information