Metamath Proof Explorer


Theorem fnct

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

Ref Expression
Assertion fnct F Fn A A ω F ω

Proof

Step Hyp Ref Expression
1 ctex A ω A V
2 1 adantl F Fn A A ω A V
3 fndm F Fn A dom F = A
4 3 eleq1d F Fn A dom F V A V
5 4 adantr F Fn A A ω dom F V A V
6 2 5 mpbird F Fn A A ω dom F V
7 fnfun F Fn A Fun F
8 7 adantr F Fn A A ω Fun F
9 funrnex dom F V Fun F ran F V
10 6 8 9 sylc F Fn A A ω ran F V
11 2 10 xpexd F Fn A A ω A × ran F V
12 dffn3 F Fn A F : A ran F
13 12 birani F Fn A A ω F : A ran F
14 fssxp F : A ran F F A × ran F
15 13 14 syl F Fn A A ω F A × ran F
16 ssdomg A × ran F V F A × ran F F A × ran F
17 11 15 16 sylc F Fn A A ω F A × ran F
18 xpdom1g ran F V A ω A × ran F ω × ran F
19 10 18 sylancom F Fn A A ω A × ran F ω × ran F
20 omex ω V
21 omelon ω On
22 21 a1i F Fn A A ω ω On
23 simpr F Fn A A ω A ω
24 ondomen ω On A ω A dom card
25 22 23 24 syl2anc F Fn A A ω A dom card
26 simpl F Fn A A ω F Fn A
27 fnrndomnum A dom card F Fn A ran F A
28 25 26 27 sylc F Fn A A ω ran F A
29 domtr ran F A A ω ran F ω
30 28 29 sylancom F Fn A A ω ran F ω
31 xpdom2g ω V ran F ω ω × ran F ω × ω
32 20 30 31 sylancr F Fn A A ω ω × ran F ω × ω
33 domtr A × ran F ω × ran F ω × ran F ω × ω A × ran F ω × ω
34 19 32 33 syl2anc F Fn A A ω A × ran F ω × ω
35 xpomen ω × ω ω
36 domentr A × ran F ω × ω ω × ω ω A × ran F ω
37 34 35 36 sylancl F Fn A A ω A × ran F ω
38 domtr F A × ran F A × ran F ω F ω
39 17 37 38 syl2anc F Fn A A ω F ω