[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 27 from proof coprimes-min (
previous step
)
∀ i0. ¬ i0 ∈ filterFun(λ j. gcd(i, j) = 1, count-i2j(1, i)), 0 < i ⊦
User applied rule all left
And obtained the following new goals
Proof step 28
:
¬ 1 ∈ filterFun(λ j. gcd(i, j) = 1, count-i2j(1, i)), 0 < i ⊦
Rule argument
pos: left 1 terms: 1 abort: F discard: T computed: F
Additional information
Used terms: 1