Theorem iseqovex 10895

Description: Closure of a function used in proving sequence builder theorems. This can be thought of as a lemma for the small number of sequence builder theorems which need it. (Contributed by Jim Kingdon, 31-May-2020.)

Hypotheses

Ref	Expression
iseqovex.f	|- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. S )
iseqovex.pl	|- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) e. S )

Assertion

Ref	Expression
iseqovex	|- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> ( x ( z e. ( ZZ>= ` M ) , w e. S |-> ( w .+ ( F ` ( z + 1 ) ) ) ) y ) e. S )

Distinct variable groups:   w, F, x, y, z   w, .+ , x, y, z   w, S, x, y, z   ph, w, x, y, z   w, M, x, z

Allowed substitution hint:   M( y)

Proof of Theorem iseqovex

Step	Hyp	Ref	Expression
1		eqidd 2239	. . 3 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> ( z e. ( ZZ>= ` M ) , w e. S |-> ( w .+ ( F ` ( z + 1 ) ) ) ) = ( z e. ( ZZ>= ` M ) , w e. S |-> ( w .+ ( F ` ( z + 1 ) ) ) ) )
2		simprr 537	. . . 4 |- ( ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) /\ ( z = x /\ w = y ) ) -> w = y )
3		simprl 535	. . . . . 6 |- ( ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) /\ ( z = x /\ w = y ) ) -> z = x )
4	3	oveq1d 6100	. . . . 5 |- ( ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) /\ ( z = x /\ w = y ) ) -> ( z + 1 ) = ( x + 1 ) )
5	4	fveq2d 5699	. . . 4 |- ( ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) /\ ( z = x /\ w = y ) ) -> ( F ` ( z + 1 ) ) = ( F ` ( x + 1 ) ) )
6	2, 5	oveq12d 6103	. . 3 |- ( ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) /\ ( z = x /\ w = y ) ) -> ( w .+ ( F ` ( z + 1 ) ) ) = ( y .+ ( F ` ( x + 1 ) ) ) )
7		simprl 535	. . 3 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> x e. ( ZZ>= ` M ) )
8		simprr 537	. . 3 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> y e. S )
9		iseqovex.pl	. . . . . 6 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) e. S )
10	9	caovclg 6242	. . . . 5 |- ( ( ph /\ ( z e. S /\ w e. S ) ) -> ( z .+ w ) e. S )
11	10	adantlr 481	. . . 4 |- ( ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) /\ ( z e. S /\ w e. S ) ) -> ( z .+ w ) e. S )
12		fveq2 5695	. . . . . 6 |- ( z = ( x + 1 ) -> ( F ` z ) = ( F ` ( x + 1 ) ) )
13	12	eleq1d 2307	. . . . 5 |- ( z = ( x + 1 ) -> ( ( F ` z ) e. S <-> ( F ` ( x + 1 ) ) e. S ) )
14		iseqovex.f	. . . . . . . 8 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. S )
15	14	ralrimiva 2623	. . . . . . 7 |- ( ph -> A. x e. ( ZZ>= ` M ) ( F ` x ) e. S )
16		fveq2 5695	. . . . . . . . 9 |- ( x = z -> ( F ` x ) = ( F ` z ) )
17	16	eleq1d 2307	. . . . . . . 8 |- ( x = z -> ( ( F ` x ) e. S <-> ( F ` z ) e. S ) )
18	17	cbvralv 2786	. . . . . . 7 |- ( A. x e. ( ZZ>= ` M ) ( F ` x ) e. S <-> A. z e. ( ZZ>= ` M ) ( F ` z ) e. S )
19	15, 18	sylib 122	. . . . . 6 |- ( ph -> A. z e. ( ZZ>= ` M ) ( F ` z ) e. S )
20	19	adantr 276	. . . . 5 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> A. z e. ( ZZ>= ` M ) ( F ` z ) e. S )
21		peano2uz 9983	. . . . . 6 |- ( x e. ( ZZ>= ` M ) -> ( x + 1 ) e. ( ZZ>= ` M ) )
22	7, 21	syl 14	. . . . 5 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> ( x + 1 ) e. ( ZZ>= ` M ) )
23	13, 20, 22	rspcdva 2934	. . . 4 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> ( F ` ( x + 1 ) ) e. S )
24	11, 8, 23	caovcld 6243	. . 3 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> ( y .+ ( F ` ( x + 1 ) ) ) e. S )
25	1, 6, 7, 8, 24	ovmpod 6216	. 2 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> ( x ( z e. ( ZZ>= ` M ) , w e. S |-> ( w .+ ( F ` ( z + 1 ) ) ) ) y ) = ( y .+ ( F ` ( x + 1 ) ) ) )
26	25, 24	eqeltrd 2315	1 |- ( ( ph /\ ( x e. ( ZZ>= ` M ) /\ y e. S ) ) -> ( x ( z e. ( ZZ>= ` M ) , w e. S |-> ( w .+ ( F ` ( z + 1 ) ) ) ) y ) e. S )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   A.wral 2528   ` cfv 5377  (class class class)co 6085   e. cmpo 6087   1c1 8180   + caddc 8182   ZZ>=cuz 9921

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922

This theorem is used by:  seq3val  10897  seq3-1  10899  seq3p1  10902