Theorem iseqeq2 9435

Description: Equality theorem for the sequence builder operation. (Contributed by Jim Kingdon, 30-May-2020.)

Assertion

Ref	Expression
iseqeq2	|- ( .+ = Q -> seq M ( .+ , F , S ) = seq M ( Q , F , S ) )

Proof of Theorem iseqeq2

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 938	. . . . . . 7 |- ( ( .+ = Q /\ x e. ( ZZ>= ` M ) /\ y e. S ) -> .+ = Q )
2	1	oveqd 5549	. . . . . 6 |- ( ( .+ = Q /\ x e. ( ZZ>= ` M ) /\ y e. S ) -> ( y .+ ( F ` ( x + 1 ) ) ) = ( y Q ( F ` ( x + 1 ) ) ) )
3	2	opeq2d 3577	. . . . 5 |- ( ( .+ = Q /\ x e. ( ZZ>= ` M ) /\ y e. S ) -> <. ( x + 1 ) , ( y .+ ( F ` ( x + 1 ) ) ) >. = <. ( x + 1 ) , ( y Q ( F ` ( x + 1 ) ) ) >. )
4	3	mpt2eq3dva 5589	. . . 4 |- ( .+ = Q -> ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y .+ ( F ` ( x + 1 ) ) ) >. ) = ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y Q ( F ` ( x + 1 ) ) ) >. ) )
5		freceq1 6002	. . . 4 |- ( ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y .+ ( F ` ( x + 1 ) ) ) >. ) = ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y Q ( F ` ( x + 1 ) ) ) >. ) -> frec ( ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y .+ ( F ` ( x + 1 ) ) ) >. ) , <. M , ( F ` M ) >. ) = frec ( ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y Q ( F ` ( x + 1 ) ) ) >. ) , <. M , ( F ` M ) >. ) )
6	4, 5	syl 14	. . 3 |- ( .+ = Q -> frec ( ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y .+ ( F ` ( x + 1 ) ) ) >. ) , <. M , ( F ` M ) >. ) = frec ( ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y Q ( F ` ( x + 1 ) ) ) >. ) , <. M , ( F ` M ) >. ) )
7	6	rneqd 4581	. 2 |- ( .+ = Q -> ran frec ( ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y .+ ( F ` ( x + 1 ) ) ) >. ) , <. M , ( F ` M ) >. ) = ran frec ( ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y Q ( F ` ( x + 1 ) ) ) >. ) , <. M , ( F ` M ) >. ) )
8		df-iseq 9432	. 2 |- seq M ( .+ , F , S ) = ran frec ( ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y .+ ( F ` ( x + 1 ) ) ) >. ) , <. M , ( F ` M ) >. )
9		df-iseq 9432	. 2 |- seq M ( Q , F , S ) = ran frec ( ( x e. ( ZZ>= ` M ) , y e. S |-> <. ( x + 1 ) , ( y Q ( F ` ( x + 1 ) ) ) >. ) , <. M , ( F ` M ) >. )
10	7, 8, 9	3eqtr4g 2138	1 |- ( .+ = Q -> seq M ( .+ , F , S ) = seq M ( Q , F , S ) )

Syntax hints:   -> wi 4   /\ w3a 919   = wceq 1284   e. wcel 1433   <.cop 3401   ran crn 4364   ` cfv 4922  (class class class)co 5532   |-> cmpt2 5534  freccfrec 6000   1c1 6982   + caddc 6984   ZZ>=cuz 8619   seqcseq 9431

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-cnv 4371  df-dm 4373  df-rn 4374  df-res 4375  df-iota 4887  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-recs 5943  df-frec 6001  df-iseq 9432

This theorem is referenced by:  resqrex  9912