Description: Lemma for prmrec . Show by induction that the indexed (nondisjoint) union Wk is at most the size of the prime reciprocal series. The key counting lemma is hashdvds , to show that the number of numbers in 1 ... N that divide k is at most N / k . (Contributed by Mario Carneiro, 6-Aug-2014)
Ref | Expression | ||
---|---|---|---|
Hypotheses | prmrec.1 | |
|
prmrec.2 | |
||
prmrec.3 | |
||
prmrec.4 | |
||
prmrec.5 | |
||
prmrec.6 | |
||
prmrec.7 | |
||
Assertion | prmreclem4 | |