---

Step * of Lemma permutation_weakening

∀[A:Type]. ∀as,bs:A List.  permutation(A;as;bs) supposing as = bs ∈ (A List)
BY
{ (Auto THEN Unfold `permutation` 0 THEN InstConcl [⌜λi.i⌝]⋅ THEN Auto THEN RepUR ``inject`` 0 THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[A:Type].  \mforall{}as,bs:A  List.    permutation(A;as;bs)  supposing  as  =  bs


By

---

Latex:
(Auto
  THEN  Unfold  `permutation`  0
  THEN  InstConcl  [\mkleeneopen{}\mlambda{}i.i\mkleeneclose{}]\mcdot{}
  THEN  Auto
  THEN  RepUR  ``inject``  0
  THEN  Auto)

---

Home Index