Theorem ctiunctlemu2nd 12806

Description: Lemma for ctiunct 12811. (Contributed by Jim Kingdon, 28-Oct-2023.)

Hypotheses

Ref	Expression
ctiunct.som	|- ( ph -> S C_ om )
ctiunct.sdc	|- ( ph -> A. n e. om DECID n e. S )
ctiunct.f	|- ( ph -> F : S -onto-> A )
ctiunct.tom	|- ( ( ph /\ x e. A ) -> T C_ om )
ctiunct.tdc	|- ( ( ph /\ x e. A ) -> A. n e. om DECID n e. T )
ctiunct.g	|- ( ( ph /\ x e. A ) -> G : T -onto-> B )
ctiunct.j	|- ( ph -> J : om -1-1-onto-> ( om X. om ) )
ctiunct.u	|- U = { z e. om | ( ( 1st ` ( J ` z ) ) e. S /\ ( 2nd ` ( J ` z ) ) e. [_ ( F ` ( 1st ` ( J ` z ) ) ) / x ]_ T ) }
ctiunctlem.n	|- ( ph -> N e. U )

Assertion

Ref	Expression
ctiunctlemu2nd	|- ( ph -> ( 2nd ` ( J ` N ) ) e. [_ ( F ` ( 1st ` ( J ` N ) ) ) / x ]_ T )

Distinct variable groups:   z, F   z, J   z, N   z, S   z, T   x, z

Allowed substitution hints:   ph( x, z, n)   A( x, z, n)   B( x, z, n)   S( x, n)   T( x, n)   U( x, z, n)   F( x, n)   G( x, z, n)   J( x, n)   N( x, n)

Proof of Theorem ctiunctlemu2nd

Step	Hyp	Ref	Expression
1		ctiunctlem.n	. . . 4 |- ( ph -> N e. U )
2		2fveq3 5581	. . . . . . 7 |- ( z = N -> ( 1st ` ( J ` z ) ) = ( 1st ` ( J ` N ) ) )
3	2	eleq1d 2274	. . . . . 6 |- ( z = N -> ( ( 1st ` ( J ` z ) ) e. S <-> ( 1st ` ( J ` N ) ) e. S ) )
4		2fveq3 5581	. . . . . . 7 |- ( z = N -> ( 2nd ` ( J ` z ) ) = ( 2nd ` ( J ` N ) ) )
5	2	fveq2d 5580	. . . . . . . 8 |- ( z = N -> ( F ` ( 1st ` ( J ` z ) ) ) = ( F ` ( 1st ` ( J ` N ) ) ) )
6	5	csbeq1d 3100	. . . . . . 7 |- ( z = N -> [_ ( F ` ( 1st ` ( J ` z ) ) ) / x ]_ T = [_ ( F ` ( 1st ` ( J ` N ) ) ) / x ]_ T )
7	4, 6	eleq12d 2276	. . . . . 6 |- ( z = N -> ( ( 2nd ` ( J ` z ) ) e. [_ ( F ` ( 1st ` ( J ` z ) ) ) / x ]_ T <-> ( 2nd ` ( J ` N ) ) e. [_ ( F ` ( 1st ` ( J ` N ) ) ) / x ]_ T ) )
8	3, 7	anbi12d 473	. . . . 5 |- ( z = N -> ( ( ( 1st ` ( J ` z ) ) e. S /\ ( 2nd ` ( J ` z ) ) e. [_ ( F ` ( 1st ` ( J ` z ) ) ) / x ]_ T ) <-> ( ( 1st ` ( J ` N ) ) e. S /\ ( 2nd ` ( J ` N ) ) e. [_ ( F ` ( 1st ` ( J ` N ) ) ) / x ]_ T ) ) )
9		ctiunct.u	. . . . 5 |- U = { z e. om | ( ( 1st ` ( J ` z ) ) e. S /\ ( 2nd ` ( J ` z ) ) e. [_ ( F ` ( 1st ` ( J ` z ) ) ) / x ]_ T ) }
10	8, 9	elrab2 2932	. . . 4 |- ( N e. U <-> ( N e. om /\ ( ( 1st ` ( J ` N ) ) e. S /\ ( 2nd ` ( J ` N ) ) e. [_ ( F ` ( 1st ` ( J ` N ) ) ) / x ]_ T ) ) )
11	1, 10	sylib 122	. . 3 |- ( ph -> ( N e. om /\ ( ( 1st ` ( J ` N ) ) e. S /\ ( 2nd ` ( J ` N ) ) e. [_ ( F ` ( 1st ` ( J ` N ) ) ) / x ]_ T ) ) )
12	11	simprd 114	. 2 |- ( ph -> ( ( 1st ` ( J ` N ) ) e. S /\ ( 2nd ` ( J ` N ) ) e. [_ ( F ` ( 1st ` ( J ` N ) ) ) / x ]_ T ) )
13	12	simprd 114	1 |- ( ph -> ( 2nd ` ( J ` N ) ) e. [_ ( F ` ( 1st ` ( J ` N ) ) ) / x ]_ T )

Syntax hints:   -> wi 4   /\ wa 104  DECID wdc 836   = wceq 1373   e. wcel 2176   A.wral 2484   {crab 2488   [_csb 3093   C_ wss 3166   omcom 4638   X. cxp 4673   -onto->wfo 5269   -1-1-onto->wf1o 5270   ` cfv 5271   1stc1st 6224   2ndc2nd 6225

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-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-rex 2490  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-iota 5232  df-fv 5279

This theorem is referenced by:  ctiunctlemf  12809