Theorem find 7091

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 1070	. 2 |- A C_ om
3		3simpc 1060	. . . . 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 2917	. . . . . 6 |- ( A. x e. A suc x e. A <-> A. x ( x e. A -> suc x e. A ) )
6		alral 2928	. . . . . 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 207	. . . . 5 |- ( A. x e. A suc x e. A -> A. x e. om ( x e. A -> suc x e. A ) )
8	7	anim2i 593	. . . 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 7089	. . 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 3619	1 |- A = om

Syntax hints:   -> wi 4   /\ wa 384   /\ w3a 1037   A.wal 1481   = wceq 1483   e. wcel 1990   A.wral 2912   C_ wss 3574   (/)c0 3915   suc csuc 5725   omcom 7065

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-tr 4753  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-om 7066

This theorem is referenced by: (None)