[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem gcd-rec1
⊦ n ≤ m → gcd(m, n) = gcd(m - n, n)
Type: An axiom
Validity: The proof is valid.
Features: nokodkodax,
Comment:
Used by:
gcd-id
,
gcd-mod
,
gcd-mult
,
gcd-rec2
,
gcd-twicerev
,
Used by units in proved state:
Proof exists?: No