[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 1 from proof map-int-append (conclusion) (back to tree)

⊦ (u + v) map ff = (u map ff) + (v map ff)

System applied rule normalize

And obtained the following new goals

Proof step 2:
(u + v) map ff ≠ (u map ff) + (v map ff) ⊦

Rule argument

Additional information

Proof step 2 from proof map-int-append (previous step) (back to tree)

(u + v) map ff ≠ (u map ff) + (v map ff) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Proof step 3:
⊦ (x + y) map f = (x map f) + (y map f)

Rule argument

spec: <toplevel>, name:map-append, seq: ⊦ (x + y) map f = (x map f) + (y map f), subst:[x, y, f] → [u, v, ff]; ['a, 'b] → [nat, nat], <all paths>

Additional information

Used terms: u, v, ff

Proof step 3 from proof map-int-append (previous step) (back to tree)

⊦ (x + y) map f = (x map f) + (y map f)

Lemma map-append

Proof Tree for map-int-append (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.