[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 14 from proof map-in0 (
previous step
)
∀ r. r ∈ rs → g(r) = a, ∀ r0. (r0 ∈ rs ↔ r0 = r) ∧ (r0 ∈ rs → f(r0) = (∅ ++ r)[r0]) ⊦ r = null, r ∈ rs
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: r
Additional information
Used terms: r