Theorem uzind3 9694

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

Hypotheses

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

Assertion

Ref	Expression
uzind3	|- ( ( M e. ZZ /\ N e. { k e. ZZ | M <_ k } ) -> ta )

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

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

Proof of Theorem uzind3

Step	Hyp	Ref	Expression
1		breq2 4115	. . 3 |- ( k = N -> ( M <_ k <-> M <_ N ) )
2	1	elrab 2975	. 2 |- ( N e. { k e. ZZ | M <_ k } <-> ( N e. ZZ /\ M <_ N ) )
3		uzind3.1	. . . 4 |- ( j = M -> ( ph <-> ps ) )
4		uzind3.2	. . . 4 |- ( j = m -> ( ph <-> ch ) )
5		uzind3.3	. . . 4 |- ( j = ( m + 1 ) -> ( ph <-> th ) )
6		uzind3.4	. . . 4 |- ( j = N -> ( ph <-> ta ) )
7		uzind3.5	. . . 4 |- ( M e. ZZ -> ps )
8		breq2 4115	. . . . . . 7 |- ( k = m -> ( M <_ k <-> M <_ m ) )
9	8	elrab 2975	. . . . . 6 |- ( m e. { k e. ZZ | M <_ k } <-> ( m e. ZZ /\ M <_ m ) )
10		uzind3.6	. . . . . 6 |- ( ( M e. ZZ /\ m e. { k e. ZZ | M <_ k } ) -> ( ch -> th ) )
11	9, 10	sylan2br 288	. . . . 5 |- ( ( M e. ZZ /\ ( m e. ZZ /\ M <_ m ) ) -> ( ch -> th ) )
12	11	3impb 1226	. . . 4 |- ( ( M e. ZZ /\ m e. ZZ /\ M <_ m ) -> ( ch -> th ) )
13	3, 4, 5, 6, 7, 12	uzind 9692	. . 3 |- ( ( M e. ZZ /\ N e. ZZ /\ M <_ N ) -> ta )
14	13	3expb 1231	. 2 |- ( ( M e. ZZ /\ ( N e. ZZ /\ M <_ N ) ) -> ta )
15	2, 14	sylan2b 287	1 |- ( ( M e. ZZ /\ N e. { k e. ZZ | M <_ k } ) -> ta )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2205   {crab 2526   class class class wbr 4111  (class class class)co 6052   1c1 8130   + caddc 8132   <_ cle 8311   ZZcz 9579

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-ltadd 8245

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-br 4112  df-opab 4174  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-iota 5314  df-fun 5356  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-inn 9240  df-n0 9499  df-z 9580

This theorem is referenced by:  uzind4  9923  algfx  12753