[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 7 from proof ext-setequal (
previous step
)
⊦ ¬ ¬((∀ a. a ∈ x → a ∈ y) ∧ (∀ a. a ∈ y → a ∈ x)) ↔ (∀ a. a ∈ x ↔ a ∈ y)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 8
:
⊦ (∀ a. a ∈ x → a ∈ y) ∧ (∀ a. a ∈ y → a ∈ x) ↔ (∀ a. a ∈ x ↔ a ∈ y)
Rule argument
Additional information