Some theorems about Fibonacci numbers

Theorem 1：gcd(F(n+1), F(n)) = 1 for all n ≥ 1
Theorem 2：F(m+n) = F(m−1)F(n) + F(m)F(n+1), for all m > 0 and n ≥ 0.
Theorem 3：For m ≥ 1, n ≥ 1, F(m)|F(mn).
lemma 1：If m = nq + r, for m, n > 0, then gcd(F(m), F(n)) = gcd(F(n), F( r )).
Theorem 4: The GCD of two fibonacci numbers is again a fibonacci number. In fact, gcd(F(n), F(m)) = F(gcd(n,m)).
Corollary 5: Converse of theorem 3. F(m)|F(n) implies m|n.
Theorem 6:
Theorem 7: Every positive integer may be expressed as the sum of distinct fibonacci numbers.