---

Step * of Lemma map-l-union-1

∀[T:Type]. ∀[f:T ⟶ T]. ∀[eq:EqDecider(T)]. ∀[as,bs:T List].
  map(f;as ⋃ bs) ~ map(f;as) ⋃ map(f;bs) supposing Inj({x:T| (x ∈ as ⋃ bs)} ;T;f)
BY
{ ((Auto THEN (InstLemma `map-l-union` [⌜T⌝;⌜T⌝;⌜f⌝;⌜eq⌝;⌜eq⌝]⋅ THENA Auto)) THEN BHyp -1  THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[f:T  {}\mrightarrow{}  T].  \mforall{}[eq:EqDecider(T)].  \mforall{}[as,bs:T  List].
    map(f;as  \mcup{}  bs)  \msim{}  map(f;as)  \mcup{}  map(f;bs)  supposing  Inj(\{x:T|  (x  \mmember{}  as  \mcup{}  bs)\}  ;T;f)


By

---

Latex:
((Auto  THEN  (InstLemma  `map-l-union`  [\mkleeneopen{}T\mkleeneclose{};\mkleeneopen{}T\mkleeneclose{};\mkleeneopen{}f\mkleeneclose{};\mkleeneopen{}eq\mkleeneclose{};\mkleeneopen{}eq\mkleeneclose{}]\mcdot{}  THENA  Auto))  THEN  BHyp  -1    THEN  Auto)

---

Home Index