Step
*
of Lemma
comb_for_gcd_p_wf
λa,b,y,z. GCD(a;b;y) ∈ a:ℤ ⟶ b:ℤ ⟶ y:ℤ ⟶ (↓True) ⟶ ℙ
BY
{ (ProveOpCombinatorTyping Auto) `gcd_p_wf` }
Latex:
Latex:
\mlambda{}a,b,y,z.  GCD(a;b;y)  \mmember{}  a:\mBbbZ{}  {}\mrightarrow{}  b:\mBbbZ{}  {}\mrightarrow{}  y:\mBbbZ{}  {}\mrightarrow{}  (\mdownarrow{}True)  {}\mrightarrow{}  \mBbbP{}
By
Latex:
(ProveOpCombinatorTyping  Auto)  `gcd\_p\_wf`
Home
Index