[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 4 from proof subseteq-inter-same (
previous step
)
⊦ (∀ adr. adr ∈ as → adr ∈ as0) ↔ as ⊆ as0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 5
:
⊦ as ⊆ as0 ↔ (∀ adr. adr ∈ as → adr ∈ as0)
Rule argument
spec: set-basic, inst: node-store name: Subset seq: ⊦ as ⊆ as0 ↔ (∀ adr. adr ∈ as → adr ∈ as0) subst: [as0, as] → [as0, as] flags: <all paths>
Additional information
Used terms: as0, as