Theorem uzind4i 9924

Description: Induction on the upper integers that start at M. The first four give us the substitution instances we need, and the last two are the basis and the induction step. This is a stronger version of uzind4 9920 assuming that ps holds unconditionally. Notice that N e. ( ZZ>= ` M ) implies that the lower bound M is an integer ( M e. ZZ, see eluzel2 9858). (Contributed by NM, 4-Sep-2005.) (Revised by AV, 13-Jul-2022.)

Hypotheses

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

Assertion

Ref	Expression
uzind4i	|- ( N e. ( ZZ>= ` M ) -> 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 uzind4i

Step	Hyp	Ref	Expression
1		uzind4i.1	. 2 |- ( j = M -> ( ph <-> ps ) )
2		uzind4i.2	. 2 |- ( j = k -> ( ph <-> ch ) )
3		uzind4i.3	. 2 |- ( j = ( k + 1 ) -> ( ph <-> th ) )
4		uzind4i.4	. 2 |- ( j = N -> ( ph <-> ta ) )
5		uzind4i.5	. . 3 |- ps
6	5	a1i 9	. 2 |- ( M e. ZZ -> ps )
7		uzind4i.6	. 2 |- ( k e. ( ZZ>= ` M ) -> ( ch -> th ) )
8	1, 2, 3, 4, 6, 7	uzind4 9920	1 |- ( N e. ( ZZ>= ` M ) -> ta )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1398   e. wcel 2203   ` cfv 5352  (class class class)co 6050   1c1 8128   + caddc 8130   ZZcz 9577   ZZ>=cuz 9853

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 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-ltadd 8243

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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-inn 9238  df-n0 9497  df-z 9578  df-uz 9854

This theorem is referenced by:  rebtwn2zlemshrink  10613  seqfveq2g  10839  seqhomog  10892  2expltfac  13137