FDL > PVS > Number Theory > gcd > gcd def > pf:gcd def > 1 > 2 > 1 > 1 > 1 > 2 > 1 > 1

Conclusion

-1. divides(nn!1, i!1)
-2. divides(nn!1, j!1)
-3. FORALL mm : (divides(mm, i!1) AND divides(mm, j!1)) IMPLIES (mm < = nn!1)
-4. (i!1 /= 0) OR (j!1 /= 0)

1. (i!1 = 0) = > (j!1 /= 0)
2. EXISTS UB : FORALL y:({k:posnat | divides(k, i!1) AND divides(k, j!1)}) : y < = UB
3. max({k:posnat | divides(k, i!1) AND divides(k, j!1)}) = nn!1