Theorem acfun 7290

Description: A convenient form of choice. The goal here is to state choice as the existence of a choice function on a set of inhabited sets, while making full use of our notation around functions and function values. (Contributed by Jim Kingdon, 20-Nov-2023.)

Hypotheses

Ref	Expression
acfun.ac	|- ( ph -> CHOICE )
acfun.a	|- ( ph -> A e. V )
acfun.m	|- ( ph -> A. x e. A E. w w e. x )

Assertion

Ref	Expression
acfun	|- ( ph -> E. f ( f Fn A /\ A. x e. A ( f ` x ) e. x ) )

Distinct variable groups:   A, f, x   ph, f, x   x, w

Allowed substitution hints:   ph( w)   A( w)   V( x, w, f)

Proof of Theorem acfun

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

Step	Hyp	Ref	Expression
1		acfun.a	. . . . 5 |- ( ph -> A e. V )
2	1	elexd 2776	. . . 4 |- ( ph -> A e. _V )
3		abid2 2317	. . . . . 6 |- { v | v e. u } = u
4		vex 2766	. . . . . 6 |- u e. _V
5	3, 4	eqeltri 2269	. . . . 5 |- { v | v e. u } e. _V
6	5	a1i 9	. . . 4 |- ( ( ph /\ u e. A ) -> { v | v e. u } e. _V )
7	2, 6	opabex3d 6187	. . 3 |- ( ph -> { <. u , v >. | ( u e. A /\ v e. u ) } e. _V )
8		acfun.ac	. . . 4 |- ( ph -> CHOICE )
9		df-ac 7289	. . . 4 |- (CHOICE <-> A. y E. f ( f C_ y /\ f Fn dom y ) )
10	8, 9	sylib 122	. . 3 |- ( ph -> A. y E. f ( f C_ y /\ f Fn dom y ) )
11		sseq2 3208	. . . . . 6 |- ( y = { <. u , v >. | ( u e. A /\ v e. u ) } -> ( f C_ y <-> f C_ { <. u , v >. | ( u e. A /\ v e. u ) } ) )
12		dmeq 4867	. . . . . . 7 |- ( y = { <. u , v >. | ( u e. A /\ v e. u ) } -> dom y = dom { <. u , v >. | ( u e. A /\ v e. u ) } )
13	12	fneq2d 5350	. . . . . 6 |- ( y = { <. u , v >. | ( u e. A /\ v e. u ) } -> ( f Fn dom y <-> f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) )
14	11, 13	anbi12d 473	. . . . 5 |- ( y = { <. u , v >. | ( u e. A /\ v e. u ) } -> ( ( f C_ y /\ f Fn dom y ) <-> ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) )
15	14	exbidv 1839	. . . 4 |- ( y = { <. u , v >. | ( u e. A /\ v e. u ) } -> ( E. f ( f C_ y /\ f Fn dom y ) <-> E. f ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) )
16	15	spcgv 2851	. . 3 |- ( { <. u , v >. | ( u e. A /\ v e. u ) } e. _V -> ( A. y E. f ( f C_ y /\ f Fn dom y ) -> E. f ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) )
17	7, 10, 16	sylc 62	. 2 |- ( ph -> E. f ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) )
18		simprr 531	. . . . . 6 |- ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) -> f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } )
19		acfun.m	. . . . . . . . . 10 |- ( ph -> A. x e. A E. w w e. x )
20		elequ2 2172	. . . . . . . . . . . . 13 |- ( x = u -> ( w e. x <-> w e. u ) )
21	20	exbidv 1839	. . . . . . . . . . . 12 |- ( x = u -> ( E. w w e. x <-> E. w w e. u ) )
22	21	cbvralv 2729	. . . . . . . . . . 11 |- ( A. x e. A E. w w e. x <-> A. u e. A E. w w e. u )
23		elequ1 2171	. . . . . . . . . . . . 13 |- ( w = v -> ( w e. u <-> v e. u ) )
24	23	cbvexv 1933	. . . . . . . . . . . 12 |- ( E. w w e. u <-> E. v v e. u )
25	24	ralbii 2503	. . . . . . . . . . 11 |- ( A. u e. A E. w w e. u <-> A. u e. A E. v v e. u )
26	22, 25	bitri 184	. . . . . . . . . 10 |- ( A. x e. A E. w w e. x <-> A. u e. A E. v v e. u )
27	19, 26	sylib 122	. . . . . . . . 9 |- ( ph -> A. u e. A E. v v e. u )
28		dmopab3 4880	. . . . . . . . 9 |- ( A. u e. A E. v v e. u <-> dom { <. u , v >. | ( u e. A /\ v e. u ) } = A )
29	27, 28	sylib 122	. . . . . . . 8 |- ( ph -> dom { <. u , v >. | ( u e. A /\ v e. u ) } = A )
30	29	fneq2d 5350	. . . . . . 7 |- ( ph -> ( f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } <-> f Fn A ) )
31	30	adantr 276	. . . . . 6 |- ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) -> ( f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } <-> f Fn A ) )
32	18, 31	mpbid 147	. . . . 5 |- ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) -> f Fn A )
33		simplrl 535	. . . . . . . . 9 |- ( ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) /\ x e. A ) -> f C_ { <. u , v >. | ( u e. A /\ v e. u ) } )
34		fnopfv 5695	. . . . . . . . . 10 |- ( ( f Fn A /\ x e. A ) -> <. x , ( f ` x ) >. e. f )
35	32, 34	sylan 283	. . . . . . . . 9 |- ( ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) /\ x e. A ) -> <. x , ( f ` x ) >. e. f )
36	33, 35	sseldd 3185	. . . . . . . 8 |- ( ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) /\ x e. A ) -> <. x , ( f ` x ) >. e. { <. u , v >. | ( u e. A /\ v e. u ) } )
37		vex 2766	. . . . . . . . 9 |- x e. _V
38		vex 2766	. . . . . . . . . 10 |- f e. _V
39	38, 37	fvex 5581	. . . . . . . . 9 |- ( f ` x ) e. _V
40		eleq1 2259	. . . . . . . . . 10 |- ( u = x -> ( u e. A <-> x e. A ) )
41		elequ2 2172	. . . . . . . . . 10 |- ( u = x -> ( v e. u <-> v e. x ) )
42	40, 41	anbi12d 473	. . . . . . . . 9 |- ( u = x -> ( ( u e. A /\ v e. u ) <-> ( x e. A /\ v e. x ) ) )
43		eleq1 2259	. . . . . . . . . 10 |- ( v = ( f ` x ) -> ( v e. x <-> ( f ` x ) e. x ) )
44	43	anbi2d 464	. . . . . . . . 9 |- ( v = ( f ` x ) -> ( ( x e. A /\ v e. x ) <-> ( x e. A /\ ( f ` x ) e. x ) ) )
45	37, 39, 42, 44	opelopab 4307	. . . . . . . 8 |- ( <. x , ( f ` x ) >. e. { <. u , v >. | ( u e. A /\ v e. u ) } <-> ( x e. A /\ ( f ` x ) e. x ) )
46	36, 45	sylib 122	. . . . . . 7 |- ( ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) /\ x e. A ) -> ( x e. A /\ ( f ` x ) e. x ) )
47	46	simprd 114	. . . . . 6 |- ( ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) /\ x e. A ) -> ( f ` x ) e. x )
48	47	ralrimiva 2570	. . . . 5 |- ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) -> A. x e. A ( f ` x ) e. x )
49	32, 48	jca 306	. . . 4 |- ( ( ph /\ ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) ) -> ( f Fn A /\ A. x e. A ( f ` x ) e. x ) )
50	49	ex 115	. . 3 |- ( ph -> ( ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) -> ( f Fn A /\ A. x e. A ( f ` x ) e. x ) ) )
51	50	eximdv 1894	. 2 |- ( ph -> ( E. f ( f C_ { <. u , v >. | ( u e. A /\ v e. u ) } /\ f Fn dom { <. u , v >. | ( u e. A /\ v e. u ) } ) -> E. f ( f Fn A /\ A. x e. A ( f ` x ) e. x ) ) )
52	17, 51	mpd 13	1 |- ( ph -> E. f ( f Fn A /\ A. x e. A ( f ` x ) e. x ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   A.wal 1362   = wceq 1364   E.wex 1506   e. wcel 2167   {cab 2182   A.wral 2475   _Vcvv 2763   C_ wss 3157   <.cop 3626   {copab 4094   dom cdm 4664   Fn wfn 5254   ` cfv 5259  CHOICEwac 7288

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ac 7289

This theorem is referenced by:  exmidaclem  7291