Theorem uzind2 9591

Description: Induction on the upper integers that start after an integer M. The first four hypotheses give us the substitution instances we need; the last two are the basis and the induction step. (Contributed by NM, 25-Jul-2005.)

Hypotheses

Ref	Expression
uzind2.1	|- ( j = ( M + 1 ) -> ( ph <-> ps ) )
uzind2.2	|- ( j = k -> ( ph <-> ch ) )
uzind2.3	|- ( j = ( k + 1 ) -> ( ph <-> th ) )
uzind2.4	|- ( j = N -> ( ph <-> ta ) )
uzind2.5	|- ( M e. ZZ -> ps )
uzind2.6	|- ( ( M e. ZZ /\ k e. ZZ /\ M < k ) -> ( ch -> th ) )

Assertion

Ref	Expression
uzind2	|- ( ( M e. ZZ /\ N e. ZZ /\ M < N ) -> ta )

Distinct variable groups:   j, N   ps, j   ch, j   th, j   ta, j   ph, k   j, k, M

Allowed substitution hints:   ph( j)   ps( k)   ch( k)   th( k)   ta( k)   N( k)

Proof of Theorem uzind2

Step	Hyp	Ref	Expression
1		zltp1le 9533	. . 3 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M < N <-> ( M + 1 ) <_ N ) )
2		peano2z 9514	. . . . . . 7 |- ( M e. ZZ -> ( M + 1 ) e. ZZ )
3		uzind2.1	. . . . . . . . . 10 |- ( j = ( M + 1 ) -> ( ph <-> ps ) )
4	3	imbi2d 230	. . . . . . . . 9 |- ( j = ( M + 1 ) -> ( ( M e. ZZ -> ph ) <-> ( M e. ZZ -> ps ) ) )
5		uzind2.2	. . . . . . . . . 10 |- ( j = k -> ( ph <-> ch ) )
6	5	imbi2d 230	. . . . . . . . 9 |- ( j = k -> ( ( M e. ZZ -> ph ) <-> ( M e. ZZ -> ch ) ) )
7		uzind2.3	. . . . . . . . . 10 |- ( j = ( k + 1 ) -> ( ph <-> th ) )
8	7	imbi2d 230	. . . . . . . . 9 |- ( j = ( k + 1 ) -> ( ( M e. ZZ -> ph ) <-> ( M e. ZZ -> th ) ) )
9		uzind2.4	. . . . . . . . . 10 |- ( j = N -> ( ph <-> ta ) )
10	9	imbi2d 230	. . . . . . . . 9 |- ( j = N -> ( ( M e. ZZ -> ph ) <-> ( M e. ZZ -> ta ) ) )
11		uzind2.5	. . . . . . . . . 10 |- ( M e. ZZ -> ps )
12	11	a1i 9	. . . . . . . . 9 |- ( ( M + 1 ) e. ZZ -> ( M e. ZZ -> ps ) )
13		zltp1le 9533	. . . . . . . . . . . . . . 15 |- ( ( M e. ZZ /\ k e. ZZ ) -> ( M < k <-> ( M + 1 ) <_ k ) )
14		uzind2.6	. . . . . . . . . . . . . . . 16 |- ( ( M e. ZZ /\ k e. ZZ /\ M < k ) -> ( ch -> th ) )
15	14	3expia 1231	. . . . . . . . . . . . . . 15 |- ( ( M e. ZZ /\ k e. ZZ ) -> ( M < k -> ( ch -> th ) ) )
16	13, 15	sylbird 170	. . . . . . . . . . . . . 14 |- ( ( M e. ZZ /\ k e. ZZ ) -> ( ( M + 1 ) <_ k -> ( ch -> th ) ) )
17	16	ex 115	. . . . . . . . . . . . 13 |- ( M e. ZZ -> ( k e. ZZ -> ( ( M + 1 ) <_ k -> ( ch -> th ) ) ) )
18	17	com3l 81	. . . . . . . . . . . 12 |- ( k e. ZZ -> ( ( M + 1 ) <_ k -> ( M e. ZZ -> ( ch -> th ) ) ) )
19	18	imp 124	. . . . . . . . . . 11 |- ( ( k e. ZZ /\ ( M + 1 ) <_ k ) -> ( M e. ZZ -> ( ch -> th ) ) )
20	19	3adant1 1041	. . . . . . . . . 10 |- ( ( ( M + 1 ) e. ZZ /\ k e. ZZ /\ ( M + 1 ) <_ k ) -> ( M e. ZZ -> ( ch -> th ) ) )
21	20	a2d 26	. . . . . . . . 9 |- ( ( ( M + 1 ) e. ZZ /\ k e. ZZ /\ ( M + 1 ) <_ k ) -> ( ( M e. ZZ -> ch ) -> ( M e. ZZ -> th ) ) )
22	4, 6, 8, 10, 12, 21	uzind 9590	. . . . . . . 8 |- ( ( ( M + 1 ) e. ZZ /\ N e. ZZ /\ ( M + 1 ) <_ N ) -> ( M e. ZZ -> ta ) )
23	22	3exp 1228	. . . . . . 7 |- ( ( M + 1 ) e. ZZ -> ( N e. ZZ -> ( ( M + 1 ) <_ N -> ( M e. ZZ -> ta ) ) ) )
24	2, 23	syl 14	. . . . . 6 |- ( M e. ZZ -> ( N e. ZZ -> ( ( M + 1 ) <_ N -> ( M e. ZZ -> ta ) ) ) )
25	24	com34 83	. . . . 5 |- ( M e. ZZ -> ( N e. ZZ -> ( M e. ZZ -> ( ( M + 1 ) <_ N -> ta ) ) ) )
26	25	pm2.43a 51	. . . 4 |- ( M e. ZZ -> ( N e. ZZ -> ( ( M + 1 ) <_ N -> ta ) ) )
27	26	imp 124	. . 3 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( ( M + 1 ) <_ N -> ta ) )
28	1, 27	sylbid 150	. 2 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M < N -> ta ) )
29	28	3impia 1226	1 |- ( ( M e. ZZ /\ N e. ZZ /\ M < N ) -> ta )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1004   = wceq 1397   e. wcel 2202   class class class wbr 4088  (class class class)co 6017   1c1 8032   + caddc 8034   < clt 8213   <_ cle 8214   ZZcz 9478

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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  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-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-ltadd 8147

This theorem depends on definitions:  df-bi 117  df-3or 1005  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-nel 2498  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-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-n0 9402  df-z 9479

This theorem is referenced by: (None)