Theorem domomsubct 16396

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

Assertion

Ref	Expression
domomsubct	⊢ (𝐴 ≼ ω → ∃𝑠(𝑠 ⊆ ω ∧ ∃𝑓 𝑓:𝑠–onto→𝐴))

Distinct variable group:   𝐴,𝑓,𝑠

Proof of Theorem domomsubct

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		brdomi 6906	. 2 ⊢ (𝐴 ≼ ω → ∃𝑔 𝑔:𝐴–1-1→ω)
2		imassrn 5079	. . . . 5 ⊢ (𝑔 “ 𝐴) ⊆ ran 𝑔
3		f1rn 5534	. . . . 5 ⊢ (𝑔:𝐴–1-1→ω → ran 𝑔 ⊆ ω)
4	2, 3	sstrid 3235	. . . 4 ⊢ (𝑔:𝐴–1-1→ω → (𝑔 “ 𝐴) ⊆ ω)
5		ssid 3244	. . . . . . . . 9 ⊢ 𝐴 ⊆ 𝐴
6		f1ores 5589	. . . . . . . . 9 ⊢ ((𝑔:𝐴–1-1→ω ∧ 𝐴 ⊆ 𝐴) → (𝑔 ↾ 𝐴):𝐴–1-1-onto→(𝑔 “ 𝐴))
7	5, 6	mpan2 425	. . . . . . . 8 ⊢ (𝑔:𝐴–1-1→ω → (𝑔 ↾ 𝐴):𝐴–1-1-onto→(𝑔 “ 𝐴))
8		f1fn 5535	. . . . . . . . . 10 ⊢ (𝑔:𝐴–1-1→ω → 𝑔 Fn 𝐴)
9		fnresdm 5432	. . . . . . . . . 10 ⊢ (𝑔 Fn 𝐴 → (𝑔 ↾ 𝐴) = 𝑔)
10	8, 9	syl 14	. . . . . . . . 9 ⊢ (𝑔:𝐴–1-1→ω → (𝑔 ↾ 𝐴) = 𝑔)
11	10	f1oeq1d 5569	. . . . . . . 8 ⊢ (𝑔:𝐴–1-1→ω → ((𝑔 ↾ 𝐴):𝐴–1-1-onto→(𝑔 “ 𝐴) ↔ 𝑔:𝐴–1-1-onto→(𝑔 “ 𝐴)))
12	7, 11	mpbid 147	. . . . . . 7 ⊢ (𝑔:𝐴–1-1→ω → 𝑔:𝐴–1-1-onto→(𝑔 “ 𝐴))
13		f1ocnv 5587	. . . . . . 7 ⊢ (𝑔:𝐴–1-1-onto→(𝑔 “ 𝐴) → ◡𝑔:(𝑔 “ 𝐴)–1-1-onto→𝐴)
14	12, 13	syl 14	. . . . . 6 ⊢ (𝑔:𝐴–1-1→ω → ◡𝑔:(𝑔 “ 𝐴)–1-1-onto→𝐴)
15		f1ofo 5581	. . . . . 6 ⊢ (◡𝑔:(𝑔 “ 𝐴)–1-1-onto→𝐴 → ◡𝑔:(𝑔 “ 𝐴)–onto→𝐴)
16	14, 15	syl 14	. . . . 5 ⊢ (𝑔:𝐴–1-1→ω → ◡𝑔:(𝑔 “ 𝐴)–onto→𝐴)
17		vex 2802	. . . . . . 7 ⊢ 𝑔 ∈ V
18	17	cnvex 5267	. . . . . 6 ⊢ ◡𝑔 ∈ V
19		foeq1 5546	. . . . . 6 ⊢ (𝑓 = ◡𝑔 → (𝑓:(𝑔 “ 𝐴)–onto→𝐴 ↔ ◡𝑔:(𝑔 “ 𝐴)–onto→𝐴))
20	18, 19	spcev 2898	. . . . 5 ⊢ (◡𝑔:(𝑔 “ 𝐴)–onto→𝐴 → ∃𝑓 𝑓:(𝑔 “ 𝐴)–onto→𝐴)
21	16, 20	syl 14	. . . 4 ⊢ (𝑔:𝐴–1-1→ω → ∃𝑓 𝑓:(𝑔 “ 𝐴)–onto→𝐴)
22	17	imaex 5083	. . . . 5 ⊢ (𝑔 “ 𝐴) ∈ V
23		sseq1 3247	. . . . . 6 ⊢ (𝑠 = (𝑔 “ 𝐴) → (𝑠 ⊆ ω ↔ (𝑔 “ 𝐴) ⊆ ω))
24		foeq2 5547	. . . . . . 7 ⊢ (𝑠 = (𝑔 “ 𝐴) → (𝑓:𝑠–onto→𝐴 ↔ 𝑓:(𝑔 “ 𝐴)–onto→𝐴))
25	24	exbidv 1871	. . . . . 6 ⊢ (𝑠 = (𝑔 “ 𝐴) → (∃𝑓 𝑓:𝑠–onto→𝐴 ↔ ∃𝑓 𝑓:(𝑔 “ 𝐴)–onto→𝐴))
26	23, 25	anbi12d 473	. . . . 5 ⊢ (𝑠 = (𝑔 “ 𝐴) → ((𝑠 ⊆ ω ∧ ∃𝑓 𝑓:𝑠–onto→𝐴) ↔ ((𝑔 “ 𝐴) ⊆ ω ∧ ∃𝑓 𝑓:(𝑔 “ 𝐴)–onto→𝐴)))
27	22, 26	spcev 2898	. . . 4 ⊢ (((𝑔 “ 𝐴) ⊆ ω ∧ ∃𝑓 𝑓:(𝑔 “ 𝐴)–onto→𝐴) → ∃𝑠(𝑠 ⊆ ω ∧ ∃𝑓 𝑓:𝑠–onto→𝐴))
28	4, 21, 27	syl2anc 411	. . 3 ⊢ (𝑔:𝐴–1-1→ω → ∃𝑠(𝑠 ⊆ ω ∧ ∃𝑓 𝑓:𝑠–onto→𝐴))
29	28	exlimiv 1644	. 2 ⊢ (∃𝑔 𝑔:𝐴–1-1→ω → ∃𝑠(𝑠 ⊆ ω ∧ ∃𝑓 𝑓:𝑠–onto→𝐴))
30	1, 29	syl 14	1 ⊢ (𝐴 ≼ ω → ∃𝑠(𝑠 ⊆ ω ∧ ∃𝑓 𝑓:𝑠–onto→𝐴))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1395  ∃wex 1538   ⊆ wss 3197   class class class wbr 4083  ωcom 4682  ^◡ccnv 4718  ran crn 4720   ↾ cres 4721   “ cima 4722   Fn wfn 5313  –1-1→wf1 5315  –onto→wfo 5316  –1-1-onto→wf1o 5317   ≼ cdom 6894

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-dom 6897

This theorem is referenced by: (None)