proposition: Lemma finite_set_induction1 (A B:property): (A emptyset -> B emptyset) -> (forall a b, (A a -> B a) -> A(a +s1 b) -> B(a +s1 b)) -> forall x, finite_set x -> A x -> B x.
proof: Proof. exact: (finite_set_induction). Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat)