---

Step * 1 2 of Lemma funinv-permutes-permutations-list


1. n : ℕ
2. b : {p:ℕn ⟶ ℕn| Inj(ℕn;ℕn;p)} 
⊢ ∃a:{p:ℕn ⟶ ℕn| Inj(ℕn;ℕn;p)} . (inv(a) = b ∈ {p:ℕn ⟶ ℕn| Inj(ℕn;ℕn;p)} )
BY
{ (D 0 With ⌜inv(b)⌝  THEN Auto) }

---

Latex:

---

Latex:

1.  n  :  \mBbbN{}
2.  b  :  \{p:\mBbbN{}n  {}\mrightarrow{}  \mBbbN{}n|  Inj(\mBbbN{}n;\mBbbN{}n;p)\} 
\mvdash{}  \mexists{}a:\{p:\mBbbN{}n  {}\mrightarrow{}  \mBbbN{}n|  Inj(\mBbbN{}n;\mBbbN{}n;p)\}  .  (inv(a)  =  b)


By

---

Latex:
(D  0  With  \mkleeneopen{}inv(b)\mkleeneclose{}    THEN  Auto)

---

Home Index