[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 13 from proof subset-del (
previous step
)
a0 ∈ x, ∀ a. a ∈ x → a ∈ y ⊦ a0 ∈ y -l a, a ∈ x
Heuristic quantifier applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: a0
Additional information
Used simplifier rules: ⊦ a ∈ x -l b ↔ a ∈ x ∧ a ≠ b; (ws) Used terms: a0