Metamath Proof Explorer


Theorem nn0seqcvg

Description: A strictly-decreasing nonnegative integer sequence with initial term N reaches zero by the N th term. Inference version. (Contributed by Paul Chapman, 31-Mar-2011)

Ref Expression
Hypotheses nn0seqcvg.1 F:00
nn0seqcvg.2 N=F0
nn0seqcvg.3 k0Fk+10Fk+1<Fk
Assertion nn0seqcvg FN=0

Proof

Step Hyp Ref Expression
1 nn0seqcvg.1 F:00
2 nn0seqcvg.2 N=F0
3 nn0seqcvg.3 k0Fk+10Fk+1<Fk
4 eqid 1=1
5 1 a1i 1=1F:00
6 2 a1i 1=1N=F0
7 3 adantl 1=1k0Fk+10Fk+1<Fk
8 5 6 7 nn0seqcvgd 1=1FN=0
9 4 8 ax-mp FN=0