[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 9 from proof indices-where-in-h (
previous step
)
m0 < # ar, n ∈ ar.indicesWhere(φ, m0), ∀ ar, n, φ. m0 ≤ # ar → (n ∈ ar.indicesWhere(φ, m0) ↔ n < m0 ∧ φ(ar[n])) ⊦ ¬ m0 < n ∧ φ(ar[n])
Heuristic quantifier applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: ar, n, φ
Additional information
Used simplifier rules: ⊦ m < n → m ≤ n; (s)% ⊦ m < n → ¬ n < m; (s) Used terms: ar, n, φ