[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 3 from proof diff-empty-sub (
previous step
)
⊦ (∀ a. a ∈ x → a ∈ y) ↔ x ⊆ y
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 4
:
⊦ x ⊆ y ↔ (∀ a. a ∈ x → a ∈ y)
Rule argument
spec: list-set inst: name: subset seq: ⊦ x ⊆ y ↔ (∀ a. a ∈ x → a ∈ y) subst: [y, x] → [y, x] flags: rewrite, current
Additional information
Used terms: y, x