Theorem cc4n 7601

Description: Countable choice with a simpler restriction on how every set in the countable collection needs to be inhabited. That is, compared with cc4 7600, the hypotheses only require an A(n) for each value of n, not a single set A which suffices for every n e. om. (Contributed by Mario Carneiro, 7-Apr-2013.) (Revised by Jim Kingdon, 3-May-2024.)

Hypotheses

Ref	Expression
cc4n.cc	|- ( ph -> CCHOICE )
cc4n.1	|- ( ph -> A. n e. N { x e. A | ps } e. V )
cc4n.2	|- ( ph -> N ~~ om )
cc4n.3	|- ( x = ( f ` n ) -> ( ps <-> ch ) )
cc4n.m	|- ( ph -> A. n e. N E. x e. A ps )

Assertion

Ref	Expression
cc4n	|- ( ph -> E. f ( f Fn N /\ A. n e. N ch ) )

Distinct variable groups:   A, f, x   f, N, n   ch, x   ph, f, n   ps, f   x, n

Allowed substitution hints:   ph( x)   ps( x, n)   ch( f, n)   A( n)   N( x)   V( x, f, n)

Proof of Theorem cc4n

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cc4n.cc	. . 3 |- ( ph -> CCHOICE )
2		cc4n.1	. . . 4 |- ( ph -> A. n e. N { x e. A | ps } e. V )
3		elex 2827	. . . . 5 |- ( { x e. A | ps } e. V -> { x e. A | ps } e. _V )
4	3	ralimi 2607	. . . 4 |- ( A. n e. N { x e. A | ps } e. V -> A. n e. N { x e. A | ps } e. _V )
5	2, 4	syl 14	. . 3 |- ( ph -> A. n e. N { x e. A | ps } e. _V )
6		cc4n.m	. . . 4 |- ( ph -> A. n e. N E. x e. A ps )
7		rabn0m 3540	. . . . 5 |- ( E. w w e. { x e. A | ps } <-> E. x e. A ps )
8	7	ralbii 2550	. . . 4 |- ( A. n e. N E. w w e. { x e. A | ps } <-> A. n e. N E. x e. A ps )
9	6, 8	sylibr 134	. . 3 |- ( ph -> A. n e. N E. w w e. { x e. A | ps } )
10		cc4n.2	. . 3 |- ( ph -> N ~~ om )
11	1, 5, 9, 10	cc3 7598	. 2 |- ( ph -> E. f ( f Fn N /\ A. n e. N ( f ` n ) e. { x e. A | ps } ) )
12		simprl 531	. . . . 5 |- ( ( ph /\ ( f Fn N /\ A. n e. N ( f ` n ) e. { x e. A | ps } ) ) -> f Fn N )
13		cc4n.3	. . . . . . . . 9 |- ( x = ( f ` n ) -> ( ps <-> ch ) )
14	13	elrab 2976	. . . . . . . 8 |- ( ( f ` n ) e. { x e. A | ps } <-> ( ( f ` n ) e. A /\ ch ) )
15	14	simprbi 275	. . . . . . 7 |- ( ( f ` n ) e. { x e. A | ps } -> ch )
16	15	ralimi 2607	. . . . . 6 |- ( A. n e. N ( f ` n ) e. { x e. A | ps } -> A. n e. N ch )
17	16	ad2antll 491	. . . . 5 |- ( ( ph /\ ( f Fn N /\ A. n e. N ( f ` n ) e. { x e. A | ps } ) ) -> A. n e. N ch )
18	12, 17	jca 306	. . . 4 |- ( ( ph /\ ( f Fn N /\ A. n e. N ( f ` n ) e. { x e. A | ps } ) ) -> ( f Fn N /\ A. n e. N ch ) )
19	18	ex 115	. . 3 |- ( ph -> ( ( f Fn N /\ A. n e. N ( f ` n ) e. { x e. A | ps } ) -> ( f Fn N /\ A. n e. N ch ) ) )
20	19	eximdv 1929	. 2 |- ( ph -> ( E. f ( f Fn N /\ A. n e. N ( f ` n ) e. { x e. A | ps } ) -> E. f ( f Fn N /\ A. n e. N ch ) ) )
21	11, 20	mpd 13	1 |- ( ph -> E. f ( f Fn N /\ A. n e. N ch ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   E.wex 1541   e. wcel 2205   A.wral 2522   E.wrex 2523   {crab 2526   _Vcvv 2815   class class class wbr 4114   omcom 4717   Fn wfn 5352   ` cfv 5357   ~~ cen 6986  CCHOICEwacc 7592

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 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-iinf 4715

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 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-iom 4718  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-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-2nd 6348  df-er 6780  df-en 6989  df-cc 7593

This theorem is referenced by:  omctfn  13278