[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
,
Proof step 3 from proof gcd-alldiv (
previous step
)
m < n, n0 | m, n0 | n ⊦ n0 | gcd(m, n)
User applied rule insert lemma
And obtained the following new goals
Proof step 4
:
m < n, n0 | n, n0 | m ⊦ n0 | gcd(m, n)
Rule argument
spec: inst: name: gcd-alldiv-h seq: m < n, n0 | n, n0 | m ⊦ n0 | gcd(m, n) subst: [m, n, n0] → [m, n, n0] flags: current, []
Additional information
Used terms: m, n, n0