Theorem nn1suc 9161

Description: If a statement holds for 1 and also holds for a successor, it holds for all positive integers. The first three hypotheses give us the substitution instances we need; the last two show that it holds for 1 and for a successor. (Contributed by NM, 11-Oct-2004.) (Revised by Mario Carneiro, 16-May-2014.)

Hypotheses

Ref	Expression
nn1suc.1	|- ( x = 1 -> ( ph <-> ps ) )
nn1suc.3	|- ( x = ( y + 1 ) -> ( ph <-> ch ) )
nn1suc.4	|- ( x = A -> ( ph <-> th ) )
nn1suc.5	|- ps
nn1suc.6	|- ( y e. NN -> ch )

Assertion

Ref	Expression
nn1suc	|- ( A e. NN -> th )

Distinct variable groups:   x, y, A   ps, x   ch, x   th, x   ph, y

Allowed substitution hints:   ph( x)   ps( y)   ch( y)   th( y)

Proof of Theorem nn1suc

Step	Hyp	Ref	Expression
1		nn1suc.5	. . . . 5 |- ps
2		1ex 8173	. . . . . 6 |- 1 e. _V
3		nn1suc.1	. . . . . 6 |- ( x = 1 -> ( ph <-> ps ) )
4	2, 3	sbcie 3066	. . . . 5 |- ( [. 1 / x ]. ph <-> ps )
5	1, 4	mpbir 146	. . . 4 |- [. 1 / x ]. ph
6		1nn 9153	. . . . . . 7 |- 1 e. NN
7		eleq1 2294	. . . . . . 7 |- ( A = 1 -> ( A e. NN <-> 1 e. NN ) )
8	6, 7	mpbiri 168	. . . . . 6 |- ( A = 1 -> A e. NN )
9		nn1suc.4	. . . . . . 7 |- ( x = A -> ( ph <-> th ) )
10	9	sbcieg 3064	. . . . . 6 |- ( A e. NN -> ( [. A / x ]. ph <-> th ) )
11	8, 10	syl 14	. . . . 5 |- ( A = 1 -> ( [. A / x ]. ph <-> th ) )
12		dfsbcq 3033	. . . . 5 |- ( A = 1 -> ( [. A / x ]. ph <-> [. 1 / x ]. ph ) )
13	11, 12	bitr3d 190	. . . 4 |- ( A = 1 -> ( th <-> [. 1 / x ]. ph ) )
14	5, 13	mpbiri 168	. . 3 |- ( A = 1 -> th )
15	14	a1i 9	. 2 |- ( A e. NN -> ( A = 1 -> th ) )
16		elisset 2817	. . . 4 |- ( ( A - 1 ) e. NN -> E. y y = ( A - 1 ) )
17		eleq1 2294	. . . . . 6 |- ( y = ( A - 1 ) -> ( y e. NN <-> ( A - 1 ) e. NN ) )
18	17	pm5.32ri 455	. . . . 5 |- ( ( y e. NN /\ y = ( A - 1 ) ) <-> ( ( A - 1 ) e. NN /\ y = ( A - 1 ) ) )
19		nn1suc.6	. . . . . . 7 |- ( y e. NN -> ch )
20	19	adantr 276	. . . . . 6 |- ( ( y e. NN /\ y = ( A - 1 ) ) -> ch )
21		nnre 9149	. . . . . . . . 9 |- ( y e. NN -> y e. RR )
22		peano2re 8314	. . . . . . . . 9 |- ( y e. RR -> ( y + 1 ) e. RR )
23		nn1suc.3	. . . . . . . . . 10 |- ( x = ( y + 1 ) -> ( ph <-> ch ) )
24	23	sbcieg 3064	. . . . . . . . 9 |- ( ( y + 1 ) e. RR -> ( [. ( y + 1 ) / x ]. ph <-> ch ) )
25	21, 22, 24	3syl 17	. . . . . . . 8 |- ( y e. NN -> ( [. ( y + 1 ) / x ]. ph <-> ch ) )
26	25	adantr 276	. . . . . . 7 |- ( ( y e. NN /\ y = ( A - 1 ) ) -> ( [. ( y + 1 ) / x ]. ph <-> ch ) )
27		oveq1 6024	. . . . . . . . 9 |- ( y = ( A - 1 ) -> ( y + 1 ) = ( ( A - 1 ) + 1 ) )
28	27	sbceq1d 3036	. . . . . . . 8 |- ( y = ( A - 1 ) -> ( [. ( y + 1 ) / x ]. ph <-> [. ( ( A - 1 ) + 1 ) / x ]. ph ) )
29	28	adantl 277	. . . . . . 7 |- ( ( y e. NN /\ y = ( A - 1 ) ) -> ( [. ( y + 1 ) / x ]. ph <-> [. ( ( A - 1 ) + 1 ) / x ]. ph ) )
30	26, 29	bitr3d 190	. . . . . 6 |- ( ( y e. NN /\ y = ( A - 1 ) ) -> ( ch <-> [. ( ( A - 1 ) + 1 ) / x ]. ph ) )
31	20, 30	mpbid 147	. . . . 5 |- ( ( y e. NN /\ y = ( A - 1 ) ) -> [. ( ( A - 1 ) + 1 ) / x ]. ph )
32	18, 31	sylbir 135	. . . 4 |- ( ( ( A - 1 ) e. NN /\ y = ( A - 1 ) ) -> [. ( ( A - 1 ) + 1 ) / x ]. ph )
33	16, 32	exlimddv 1947	. . 3 |- ( ( A - 1 ) e. NN -> [. ( ( A - 1 ) + 1 ) / x ]. ph )
34		nncn 9150	. . . . . 6 |- ( A e. NN -> A e. CC )
35		ax-1cn 8124	. . . . . 6 |- 1 e. CC
36		npcan 8387	. . . . . 6 |- ( ( A e. CC /\ 1 e. CC ) -> ( ( A - 1 ) + 1 ) = A )
37	34, 35, 36	sylancl 413	. . . . 5 |- ( A e. NN -> ( ( A - 1 ) + 1 ) = A )
38	37	sbceq1d 3036	. . . 4 |- ( A e. NN -> ( [. ( ( A - 1 ) + 1 ) / x ]. ph <-> [. A / x ]. ph ) )
39	38, 10	bitrd 188	. . 3 |- ( A e. NN -> ( [. ( ( A - 1 ) + 1 ) / x ]. ph <-> th ) )
40	33, 39	imbitrid 154	. 2 |- ( A e. NN -> ( ( A - 1 ) e. NN -> th ) )
41		nn1m1nn 9160	. 2 |- ( A e. NN -> ( A = 1 \/ ( A - 1 ) e. NN ) )
42	15, 40, 41	mpjaod 725	1 |- ( A e. NN -> th )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1397   e. wcel 2202   [.wsbc 3031  (class class class)co 6017   CCcc 8029   RRcr 8030   1c1 8032   + caddc 8034   - cmin 8349   NNcn 9142

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-sub 8351  df-inn 9143

This theorem is referenced by: (None)