---

Step * 1 1 of Lemma permutation-generators2

.....subterm..... T:t
2:n
1. n : ℕ
2. λx.x ∈ {f:ℕn ⟶ ℕn| Inj(ℕn;ℕn;f)} 
3. P : {f:ℕn ⟶ ℕn| Inj(ℕn;ℕn;f)}  ⟶ ℙ
4. P (λx.x)
⊢ inv(λx.x) = (λx.x) ∈ {f:ℕn ⟶ ℕn| Inj(ℕn;ℕn;f)} 
BY
{ (BLemma `funinv-unique` THEN Auto)⋅ }

---

Latex:

---

Latex:
.....subterm.....  T:t
2:n
1.  n  :  \mBbbN{}
2.  \mlambda{}x.x  \mmember{}  \{f:\mBbbN{}n  {}\mrightarrow{}  \mBbbN{}n|  Inj(\mBbbN{}n;\mBbbN{}n;f)\} 
3.  P  :  \{f:\mBbbN{}n  {}\mrightarrow{}  \mBbbN{}n|  Inj(\mBbbN{}n;\mBbbN{}n;f)\}    {}\mrightarrow{}  \mBbbP{}
4.  P  (\mlambda{}x.x)
\mvdash{}  inv(\mlambda{}x.x)  =  (\mlambda{}x.x)


By

---

Latex:
(BLemma  `funinv-unique`  THEN  Auto)\mcdot{}

---

Home Index