Metamath Proof Explorer


Theorem dmct

Description: The domain of a countable set is countable. The proof uses fodomnum rather than fodomg , and so does not require ax-ac . (Contributed by Thierry Arnoux, 29-Dec-2016) (Revised by Vincent Gonzalez, 24-Aug-2026)

Ref Expression
Assertion dmct A ω dom A ω

Proof

Step Hyp Ref Expression
1 dmresv dom A V = dom A
2 omelon ω On
3 2 a1i A ω ω On
4 id A ω A ω
5 ondomen ω On A ω A dom card
6 3 4 5 syl2anc A ω A dom card
7 resss A V A
8 7 a1i A ω A V A
9 ssnum A dom card A V A A V dom card
10 6 8 9 syl2anc A ω A V dom card
11 fvex 1 st x V
12 eqid x A V 1 st x = x A V 1 st x
13 11 12 fnmpti x A V 1 st x Fn A V
14 dffn4 x A V 1 st x Fn A V x A V 1 st x : A V onto ran x A V 1 st x
15 13 14 mpbi x A V 1 st x : A V onto ran x A V 1 st x
16 relres Rel A V
17 reldm Rel A V dom A V = ran x A V 1 st x
18 foeq3 dom A V = ran x A V 1 st x x A V 1 st x : A V onto dom A V x A V 1 st x : A V onto ran x A V 1 st x
19 16 17 18 mp2b x A V 1 st x : A V onto dom A V x A V 1 st x : A V onto ran x A V 1 st x
20 15 19 mpbir x A V 1 st x : A V onto dom A V
21 fodomnum A V dom card x A V 1 st x : A V onto dom A V dom A V A V
22 10 20 21 mpisyl A ω dom A V A V
23 ctex A ω A V
24 ssdomg A V A V A A V A
25 23 7 24 mpisyl A ω A V A
26 domtr A V A A ω A V ω
27 25 26 mpancom A ω A V ω
28 domtr dom A V A V A V ω dom A V ω
29 22 27 28 syl2anc A ω dom A V ω
30 1 29 eqbrtrrid A ω dom A ω