Theorem domomsubct 16767

Description: A set dominated by om is subcountable. (Contributed by Jim Kingdon, 11-Nov-2025.)

Assertion

Ref	Expression
domomsubct	|- ( A ~<_ om -> E. s ( s C_ om /\ E. f f : s -onto-> A ) )

Distinct variable group:   A, f, s

Proof of Theorem domomsubct

Dummy variable g is distinct from all other variables.

Step	Hyp	Ref	Expression
1		brdomi 6985	. 2 |- ( A ~<_ om -> E. g g : A -1-1-> om )
2		imassrn 5111	. . . . 5 |- ( g " A ) C_ ran g
3		f1rn 5573	. . . . 5 |- ( g : A -1-1-> om -> ran g C_ om )
4	2, 3	sstrid 3248	. . . 4 |- ( g : A -1-1-> om -> ( g " A ) C_ om )
5		ssid 3257	. . . . . . . . 9 |- A C_ A
6		f1ores 5628	. . . . . . . . 9 |- ( ( g : A -1-1-> om /\ A C_ A ) -> ( g |` A ) : A -1-1-onto-> ( g " A ) )
7	5, 6	mpan2 425	. . . . . . . 8 |- ( g : A -1-1-> om -> ( g |` A ) : A -1-1-onto-> ( g " A ) )
8		f1fn 5574	. . . . . . . . . 10 |- ( g : A -1-1-> om -> g Fn A )
9		fnresdm 5466	. . . . . . . . . 10 |- ( g Fn A -> ( g |` A ) = g )
10	8, 9	syl 14	. . . . . . . . 9 |- ( g : A -1-1-> om -> ( g |` A ) = g )
11	10	f1oeq1d 5608	. . . . . . . 8 |- ( g : A -1-1-> om -> ( ( g |` A ) : A -1-1-onto-> ( g " A ) <-> g : A -1-1-onto-> ( g " A ) ) )
12	7, 11	mpbid 147	. . . . . . 7 |- ( g : A -1-1-> om -> g : A -1-1-onto-> ( g " A ) )
13		f1ocnv 5626	. . . . . . 7 |- ( g : A -1-1-onto-> ( g " A ) -> `' g : ( g " A ) -1-1-onto-> A )
14	12, 13	syl 14	. . . . . 6 |- ( g : A -1-1-> om -> `' g : ( g " A ) -1-1-onto-> A )
15		f1ofo 5620	. . . . . 6 |- ( `' g : ( g " A ) -1-1-onto-> A -> `' g : ( g " A ) -onto-> A )
16	14, 15	syl 14	. . . . 5 |- ( g : A -1-1-> om -> `' g : ( g " A ) -onto-> A )
17		vex 2815	. . . . . . 7 |- g e. _V
18	17	cnvex 5300	. . . . . 6 |- `' g e. _V
19		foeq1 5585	. . . . . 6 |- ( f = `' g -> ( f : ( g " A ) -onto-> A <-> `' g : ( g " A ) -onto-> A ) )
20	18, 19	spcev 2911	. . . . 5 |- ( `' g : ( g " A ) -onto-> A -> E. f f : ( g " A ) -onto-> A )
21	16, 20	syl 14	. . . 4 |- ( g : A -1-1-> om -> E. f f : ( g " A ) -onto-> A )
22	17	imaex 5115	. . . . 5 |- ( g " A ) e. _V
23		sseq1 3260	. . . . . 6 |- ( s = ( g " A ) -> ( s C_ om <-> ( g " A ) C_ om ) )
24		foeq2 5586	. . . . . . 7 |- ( s = ( g " A ) -> ( f : s -onto-> A <-> f : ( g " A ) -onto-> A ) )
25	24	exbidv 1874	. . . . . 6 |- ( s = ( g " A ) -> ( E. f f : s -onto-> A <-> E. f f : ( g " A ) -onto-> A ) )
26	23, 25	anbi12d 473	. . . . 5 |- ( s = ( g " A ) -> ( ( s C_ om /\ E. f f : s -onto-> A ) <-> ( ( g " A ) C_ om /\ E. f f : ( g " A ) -onto-> A ) ) )
27	22, 26	spcev 2911	. . . 4 |- ( ( ( g " A ) C_ om /\ E. f f : ( g " A ) -onto-> A ) -> E. s ( s C_ om /\ E. f f : s -onto-> A ) )
28	4, 21, 27	syl2anc 411	. . 3 |- ( g : A -1-1-> om -> E. s ( s C_ om /\ E. f f : s -onto-> A ) )
29	28	exlimiv 1647	. 2 |- ( E. g g : A -1-1-> om -> E. s ( s C_ om /\ E. f f : s -onto-> A ) )
30	1, 29	syl 14	1 |- ( A ~<_ om -> E. s ( s C_ om /\ E. f f : s -onto-> A ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   E.wex 1541   C_ wss 3210   class class class wbr 4108   omcom 4711   `'ccnv 4747   ran crn 4749   |` cres 4750   "cima 4751   Fn wfn 5346   -1-1->wf1 5348   -onto->wfo 5349   -1-1-onto->wf1o 5350   ~<_ cdom 6973

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 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-opab 4171  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-dom 6976

This theorem is referenced by: (None)