[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 6 from proof map-ifn-0 (
previous step
)
⊦ n < # ar ∧ m ≤ # ar → ar.mapIf(φ, f, m)[n] = (n < m ∧ φ(ar[n]) ⊃ f(ar[n]);ar[n])
Lemma
map-ifn-at