Metamath Proof Explorer


Theorem imadomnum

Description: A version of imadomg that does not require the axiom of choice ax-ac . (Contributed by Vincent Gonzalez, 25-Aug-2026)

Ref Expression
Assertion imadomnum A dom card Fun F F A A

Proof

Step Hyp Ref Expression
1 df-ima F A = ran F A
2 inss1 A dom F A
3 ssnum A dom card A dom F A A dom F dom card
4 2 3 mpan2 A dom card A dom F dom card
5 4 adantr A dom card Fun F A dom F dom card
6 funres Fun F Fun F A
7 funfn Fun F A F A Fn dom F A
8 6 7 sylib Fun F F A Fn dom F A
9 dmres dom F A = A dom F
10 9 fneq2i F A Fn dom F A F A Fn A dom F
11 8 10 sylib Fun F F A Fn A dom F
12 11 adantl A dom card Fun F F A Fn A dom F
13 dffn4 F A Fn A dom F F A : A dom F onto ran F A
14 fodomnum A dom F dom card F A : A dom F onto ran F A ran F A A dom F
15 13 14 biimtrid A dom F dom card F A Fn A dom F ran F A A dom F
16 5 12 15 sylc A dom card Fun F ran F A A dom F
17 1 16 eqbrtrid A dom card Fun F F A A dom F
18 elex A dom card A V
19 ssdomg A V A dom F A A dom F A
20 18 19 syl A dom card A dom F A A dom F A
21 2 20 mpi A dom card A dom F A
22 21 adantr A dom card Fun F A dom F A
23 domtr F A A dom F A dom F A F A A
24 17 22 23 syl2anc A dom card Fun F F A A
25 24 ex A dom card Fun F F A A