---

Step * of Lemma comb_for_remainder_wf

λa,n,z. (a rem n) ∈ a:ℕ ⟶ n:ℕ+ ⟶ (↓True) ⟶ ℕ
BY
{ (ProveOpCombinatorTyping Auto) `remainder_wf` }

---

Latex:

---

Latex:
\mlambda{}a,n,z.  (a  rem  n)  \mmember{}  a:\mBbbN{}  {}\mrightarrow{}  n:\mBbbN{}\msupplus{}  {}\mrightarrow{}  (\mdownarrow{}True)  {}\mrightarrow{}  \mBbbN{}


By

---

Latex:
(ProveOpCombinatorTyping  Auto)  `remainder\_wf`

---

Home Index