[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 prefix-subseteq-dom-nodes-rev (previous step)

dom st0 ⊆ dom st1, ∀ n. n ∈ st0 ∧ n ∈ st1 → st0[n].list ⊑ st1[n].list ∧ st0[n].ladrlist ⊑ st1[n].ladrlist ∧ # st0[n].list = # st0[n].ladrlist ∧ # st1[n].list = # st1[n].ladrlist ⊦ (∀ adr. adr ∈ st1 → adr ∈ st0) ↔ dom nodes(st1) = dom nodes(st0)

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 8:
⊦ as = as0 ↔ (∀ adr. adr ∈ as ↔ adr ∈ as0)
Proof step 9:
dom st0 ⊆ dom st1, ∀ n. n ∈ st0 ∧ n ∈ st1 → st0[n].list ⊑ st1[n].list ∧ st0[n].ladrlist ⊑ st1[n].ladrlist ∧ # st0[n].list = # st0[n].ladrlist ∧ # st1[n].list = # st1[n].ladrlist ⊦ (∀ adr. adr ∈ st1 → adr ∈ st0) ↔ (∀ adr. adr ∈ dom nodes(st1) ↔ adr ∈ dom nodes(st0))

Rule argument

spec: set-basic, inst: address-store name: Extension seq: ⊦ as = as0 ↔ (∀ adr. adr ∈ as ↔ adr ∈ as0) subst: [as0, as] → [dom nodes(st0), dom nodes(st1)] flags: <all paths>

Additional information

Used terms: dom nodes(st0), dom nodes(st1)