[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 map-in (
previous step
)
j ∈ ints0, intfun(j) ∈ mapFun(intfun, ints0), ∀ i, intfun. i ∈ mapFun(intfun, ints0) ↔ (∃ j. j ∈ ints0 ∧ intfun(j) = i) ⊦ intfun(j) = intfun(i0), ∃ j0. j0 ∈ ints0 ∧ intfun(j0) = intfun(j)
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
pos: right 2 terms: j
Additional information
Used terms: j