---

Step * of Lemma comb_for_app_permf_wf

λm,n,p,q,z. app_permf(m;n;p;q) ∈ m:ℕ ⟶ n:ℕ ⟶ p:(ℕm ⟶ ℕm) ⟶ q:(ℕn ⟶ ℕn) ⟶ (↓True) ⟶ ℕm + n ⟶ ℕm + n
BY
{ (ProveOpCombinatorTyping Auto) `app_permf_wf` }

---

Latex:

---

Latex:
\mlambda{}m,n,p,q,z.  app\_permf(m;n;p;q)  \mmember{}  m:\mBbbN{}  {}\mrightarrow{}  n:\mBbbN{}  {}\mrightarrow{}  p:(\mBbbN{}m  {}\mrightarrow{}  \mBbbN{}m)  {}\mrightarrow{}  q:(\mBbbN{}n  {}\mrightarrow{}  \mBbbN{}n)  {}\mrightarrow{}  (\mdownarrow{}True)  {}\mrightarrow{}  \mBbbN{}m  +  n  {}\mrightarrow{}  \000C\mBbbN{}m  +  n


By

---

Latex:
(ProveOpCombinatorTyping  Auto)  `app\_permf\_wf`

---

Home Index