---

Step * of Lemma comb_for_eqmod_wf

λm,a,b,z. (a ≡ b mod m) ∈ m:ℤ ⟶ a:ℤ ⟶ b:ℤ ⟶ (↓True) ⟶ ℙ
BY
{ (ProveOpCombinatorTyping Auto) `eqmod_wf` }

---

Latex:

---

Latex:
\mlambda{}m,a,b,z.  (a  \mequiv{}  b  mod  m)  \mmember{}  m:\mBbbZ{}  {}\mrightarrow{}  a:\mBbbZ{}  {}\mrightarrow{}  b:\mBbbZ{}  {}\mrightarrow{}  (\mdownarrow{}True)  {}\mrightarrow{}  \mBbbP{}


By

---

Latex:
(ProveOpCombinatorTyping  Auto)  `eqmod\_wf`

---

Home Index