[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 6 from proof coprimes-ordered (
previous step
)
⊦ ordered≤(count-i2j(1, i)), ordered≤(filterFun(λ j. gcd(i, j) = 1, count-i2j(1, i)))
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 7
:
⊦ ordered≤(count-i2j(i, j))
Rule argument
spec: inst: name: count-i2j-ordered seq: ⊦ ordered≤(count-i2j(i, j)) subst: [j, i] → [i, 1] flags: rewrite, current
Additional information
Used terms: i, 1