Theorem uzind4s2 9941

Description: Induction on the upper set of integers that starts at an integer M, using explicit substitution. The hypotheses are the basis and the induction step. Use this instead of uzind4s 9940 when j and k must be distinct in [. ( k + 1 ) / j ]. ph. (Contributed by NM, 16-Nov-2005.)

Hypotheses

Ref	Expression
uzind4s2.1	|- ( M e. ZZ -> [. M / j ]. ph )
uzind4s2.2	|- ( k e. ( ZZ>= ` M ) -> ( [. k / j ]. ph -> [. ( k + 1 ) / j ]. ph ) )

Assertion

Ref	Expression
uzind4s2	|- ( N e. ( ZZ>= ` M ) -> [. N / j ]. ph )

Distinct variable groups:   k, M   ph, k   j, k

Allowed substitution hints:   ph( j)   M( j)   N( j, k)

Proof of Theorem uzind4s2

Dummy variables m n are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfsbcq 3047	. 2 |- ( m = M -> ( [. m / j ]. ph <-> [. M / j ]. ph ) )
2		dfsbcq 3047	. 2 |- ( m = n -> ( [. m / j ]. ph <-> [. n / j ]. ph ) )
3		dfsbcq 3047	. 2 |- ( m = ( n + 1 ) -> ( [. m / j ]. ph <-> [. ( n + 1 ) / j ]. ph ) )
4		dfsbcq 3047	. 2 |- ( m = N -> ( [. m / j ]. ph <-> [. N / j ]. ph ) )
5		uzind4s2.1	. 2 |- ( M e. ZZ -> [. M / j ]. ph )
6		dfsbcq 3047	. . . 4 |- ( k = n -> ( [. k / j ]. ph <-> [. n / j ]. ph ) )
7		oveq1 6065	. . . . 5 |- ( k = n -> ( k + 1 ) = ( n + 1 ) )
8	7	sbceq1d 3050	. . . 4 |- ( k = n -> ( [. ( k + 1 ) / j ]. ph <-> [. ( n + 1 ) / j ]. ph ) )
9	6, 8	imbi12d 234	. . 3 |- ( k = n -> ( ( [. k / j ]. ph -> [. ( k + 1 ) / j ]. ph ) <-> ( [. n / j ]. ph -> [. ( n + 1 ) / j ]. ph ) ) )
10		uzind4s2.2	. . 3 |- ( k e. ( ZZ>= ` M ) -> ( [. k / j ]. ph -> [. ( k + 1 ) / j ]. ph ) )
11	9, 10	vtoclga 2883	. 2 |- ( n e. ( ZZ>= ` M ) -> ( [. n / j ]. ph -> [. ( n + 1 ) / j ]. ph ) )
12	1, 2, 3, 4, 5, 11	uzind4 9938	1 |- ( N e. ( ZZ>= ` M ) -> [. N / j ]. ph )

Syntax hints:   -> wi 4   e. wcel 2205   [.wsbc 3045   ` cfv 5357  (class class class)co 6058   1c1 8144   + caddc 8146   ZZcz 9594   ZZ>=cuz 9871

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 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259

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 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872

This theorem is referenced by: (None)