[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 10 from proof ran-put-new (previous step)

⊦ ran map[r0, r1] = ran map ++ r1, r0 ∈ map

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 1:
⊦ rs = rs0 ↔ (∀ r. (r ∈ rs ↔ r ∈ rs0))

Rule argument

spec:set-basic inst:refset name:Extension seq: ⊦ rs = rs0 ↔ (∀ r. (r ∈ rs ↔ r ∈ rs0)) subst:[rs0, rs] → [ran map ++ r1, ran map[r0, r1]] flags:rewrite

Additional information

[Concretesimprules(()), Extraterms((ran map ++ r1ran map[r0, r1]))]