[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 8 from proof in-index-in-union (
previous step
)
n < m0, adr ∈ asar[n], ∀ n, adr, asar. n < m0 ∧ adr ∈ asar[n] → # asar[n] = 0 ∨ asar[n] = ∅ ∨ adr ∈ union(asar, 0, m0) ⊦ # asar[n] = 0, asar[n] = ∅, adr ∈ union(asar, 0, m0), adr ∈ asar[m0]
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: n, adr, asar
Additional information
Used terms: n, adr, asar