Theorem find 4635

Description: The Principle of Finite Induction (mathematical induction). Corollary 7.31 of [TakeutiZaring] p. 43. The simpler hypothesis shown here was suggested in an email from "Colin" on 1-Oct-2001. The hypothesis states that A is a set of natural numbers, zero belongs to A, and given any member of A the member's successor also belongs to A. The conclusion is that every natural number is in A. (Contributed by NM, 22-Feb-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Hypothesis

Ref	Expression
find.1	|- ( A C_ om /\ (/) e. A /\ A. x e. A suc x e. A )

Assertion

Ref	Expression
find	|- A = om

Distinct variable group:   x, A

Proof of Theorem find

Step	Hyp	Ref	Expression
1		find.1	. . 3 |- ( A C_ om /\ (/) e. A /\ A. x e. A suc x e. A )
2	1	simp1i 1008	. 2 |- A C_ om
3		3simpc 998	. . . . 5 |- ( ( A C_ om /\ (/) e. A /\ A. x e. A suc x e. A ) -> ( (/) e. A /\ A. x e. A suc x e. A ) )
4	1, 3	ax-mp 5	. . . 4 |- ( (/) e. A /\ A. x e. A suc x e. A )
5		df-ral 2480	. . . . . 6 |- ( A. x e. A suc x e. A <-> A. x ( x e. A -> suc x e. A ) )
6		alral 2542	. . . . . 6 |- ( A. x ( x e. A -> suc x e. A ) -> A. x e. om ( x e. A -> suc x e. A ) )
7	5, 6	sylbi 121	. . . . 5 |- ( A. x e. A suc x e. A -> A. x e. om ( x e. A -> suc x e. A ) )
8	7	anim2i 342	. . . 4 |- ( ( (/) e. A /\ A. x e. A suc x e. A ) -> ( (/) e. A /\ A. x e. om ( x e. A -> suc x e. A ) ) )
9	4, 8	ax-mp 5	. . 3 |- ( (/) e. A /\ A. x e. om ( x e. A -> suc x e. A ) )
10		peano5 4634	. . 3 |- ( ( (/) e. A /\ A. x e. om ( x e. A -> suc x e. A ) ) -> om C_ A )
11	9, 10	ax-mp 5	. 2 |- om C_ A
12	2, 11	eqssi 3199	1 |- A = om

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 980   A.wal 1362   = wceq 1364   e. wcel 2167   A.wral 2475   C_ wss 3157   (/)c0 3450   suc csuc 4400   omcom 4626

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-iinf 4624

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-uni 3840  df-int 3875  df-suc 4406  df-iom 4627

This theorem is referenced by: (None)