[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 15 from proof gcd-a (
previous step
)
gcd(gcd(n, m), n0) | m ∧ gcd(gcd(n, m), n0) | gcd(n, n0) → gcd(gcd(n, m), n0) | gcd(m, gcd(n, n0)) ⊦ gcd(gcd(n, m), n0) | gcd(m, gcd(n, n0))
User applied rule case distinction
And obtained the following new goals
Proof step 16
:
⊦ gcd(gcd(n, m), n0) | m ∧ gcd(gcd(n, m), n0) | gcd(n, n0), gcd(gcd(n, m), n0) | gcd(m, gcd(n, n0))
Rule argument
pos: left 1
Additional information