[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 35 from proof no-dups-keyset-size (
previous step
)
# keyset(kar, m0) = m0, kar[m1] = kar[m0], m1 < m0, m1 < # kar, m0 < # kar, m1 + 1 < # kar ⊦ m1 = m0, ∃ m. m < m0 ∧ kar[m0] = kar[m]
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
pos: right 2 terms: m1
Additional information
Used terms: m1