---

Step * of Lemma permutation-sv-list

∀[A:Type]. ∀[L1,L2:A List].  (single-valued-list(L1;A) ⇒ permutation(A;L1;L2) ⇒ (L1 = L2 ∈ (A List)))
BY
{ Auto }

1
1. A : Type
2. L1 : A List
3. L2 : A List
4. single-valued-list(L1;A)@i
5. permutation(A;L1;L2)@i
⊢ L1 = L2 ∈ (A List)

---

Latex:

---

Latex:
\mforall{}[A:Type].  \mforall{}[L1,L2:A  List].    (single-valued-list(L1;A)  {}\mRightarrow{}  permutation(A;L1;L2)  {}\mRightarrow{}  (L1  =  L2))


By

---

Latex:
Auto

---

Home Index