Theorem cc2 7598

Description: Countable choice using sequences instead of countable sets. (Contributed by Jim Kingdon, 27-Apr-2024.)

Hypotheses

Ref	Expression
cc2.cc	|- ( ph -> CCHOICE )
cc2.a	|- ( ph -> F Fn om )
cc2.m	|- ( ph -> A. x e. om E. w w e. ( F ` x ) )

Assertion

Ref	Expression
cc2	|- ( ph -> E. g ( g Fn om /\ A. n e. om ( g ` n ) e. ( F ` n ) ) )

Distinct variable groups:   g, F, n   w, F, x   ph, n

Allowed substitution hints:   ph( x, w, g)

Proof of Theorem cc2

Dummy variables f m v y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cc2.cc	. 2 |- ( ph -> CCHOICE )
2		cc2.a	. 2 |- ( ph -> F Fn om )
3		cc2.m	. . . 4 |- ( ph -> A. x e. om E. w w e. ( F ` x ) )
4		fveq2 5676	. . . . . . 7 |- ( x = y -> ( F ` x ) = ( F ` y ) )
5	4	eleq2d 2304	. . . . . 6 |- ( x = y -> ( w e. ( F ` x ) <-> w e. ( F ` y ) ) )
6	5	exbidv 1874	. . . . 5 |- ( x = y -> ( E. w w e. ( F ` x ) <-> E. w w e. ( F ` y ) ) )
7	6	cbvralv 2780	. . . 4 |- ( A. x e. om E. w w e. ( F ` x ) <-> A. y e. om E. w w e. ( F ` y ) )
8	3, 7	sylib 122	. . 3 |- ( ph -> A. y e. om E. w w e. ( F ` y ) )
9		eleq1w 2295	. . . . 5 |- ( w = v -> ( w e. ( F ` y ) <-> v e. ( F ` y ) ) )
10	9	cbvexv 1970	. . . 4 |- ( E. w w e. ( F ` y ) <-> E. v v e. ( F ` y ) )
11	10	ralbii 2550	. . 3 |- ( A. y e. om E. w w e. ( F ` y ) <-> A. y e. om E. v v e. ( F ` y ) )
12	8, 11	sylib 122	. 2 |- ( ph -> A. y e. om E. v v e. ( F ` y ) )
13		nfcv 2386	. . 3 |- F/_ n ( { m } X. ( F ` m ) )
14		nfcv 2386	. . 3 |- F/_ m ( { n } X. ( F ` n ) )
15		sneq 3706	. . . 4 |- ( m = n -> { m } = { n } )
16		fveq2 5676	. . . 4 |- ( m = n -> ( F ` m ) = ( F ` n ) )
17	15, 16	xpeq12d 4780	. . 3 |- ( m = n -> ( { m } X. ( F ` m ) ) = ( { n } X. ( F ` n ) ) )
18	13, 14, 17	cbvmpt 4211	. 2 |- ( m e. om |-> ( { m } X. ( F ` m ) ) ) = ( n e. om |-> ( { n } X. ( F ` n ) ) )
19		nfcv 2386	. . 3 |- F/_ n ( 2nd ` ( f ` ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` m ) ) )
20		nfcv 2386	. . . 4 |- F/_ m 2nd
21		nfcv 2386	. . . . 5 |- F/_ m f
22		nffvmpt1 5687	. . . . 5 |- F/_ m ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` n )
23	21, 22	nffv 5686	. . . 4 |- F/_ m ( f ` ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` n ) )
24	20, 23	nffv 5686	. . 3 |- F/_ m ( 2nd ` ( f ` ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` n ) ) )
25		2fveq3 5681	. . . 4 |- ( m = n -> ( f ` ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` m ) ) = ( f ` ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` n ) ) )
26	25	fveq2d 5680	. . 3 |- ( m = n -> ( 2nd ` ( f ` ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` m ) ) ) = ( 2nd ` ( f ` ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` n ) ) ) )
27	19, 24, 26	cbvmpt 4211	. 2 |- ( m e. om |-> ( 2nd ` ( f ` ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` m ) ) ) ) = ( n e. om |-> ( 2nd ` ( f ` ( ( m e. om |-> ( { m } X. ( F ` m ) ) ) ` n ) ) ) )
28	1, 2, 12, 18, 27	cc2lem 7597	1 |- ( ph -> E. g ( g Fn om /\ A. n e. om ( g ` n ) e. ( F ` n ) ) )

Syntax hints:   -> wi 4   /\ wa 104   E.wex 1541   e. wcel 2205   A.wral 2522   {csn 3695   |-> cmpt 4177   omcom 4718   X. cxp 4753   Fn wfn 5353   ` cfv 5358   2ndc2nd 6347  CCHOICEwacc 7593

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 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-coll 4231  ax-sep 4234  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-iinf 4716

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  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-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-int 3956  df-iun 3999  df-br 4116  df-opab 4178  df-mpt 4179  df-id 4420  df-iom 4719  df-xp 4761  df-rel 4762  df-cnv 4763  df-co 4764  df-dm 4765  df-rn 4766  df-res 4767  df-ima 4768  df-iota 5318  df-fun 5360  df-fn 5361  df-f 5362  df-f1 5363  df-fo 5364  df-f1o 5365  df-fv 5366  df-2nd 6349  df-er 6781  df-en 6990  df-cc 7594

This theorem is referenced by:  cc3  7599  acnccim  7603