Metamath Proof Explorer


Theorem fimact

Description: The image by a function of a countable set is countable. The proof uses imadomnum rather than imadomg , and so does not require ax-ac . (Contributed by Thierry Arnoux, 27-Mar-2018) (Revised by Vincent Gonzalez, 25-Aug-2026)

Ref Expression
Assertion fimact ⊢ A ≼ ω ∧ Fun ⁡ F → F A ≼ ω

Proof

Step Hyp Ref Expression
1 omelon ⊢ ω ∈ On
2 1 a1i ⊢ A ≼ ω ∧ Fun ⁡ F → ω ∈ On
3 simpl ⊢ A ≼ ω ∧ Fun ⁡ F → A ≼ ω
4 ondomen ⊢ ω ∈ On ∧ A ≼ ω → A ∈ dom ⁡ card
5 2 3 4 syl2anc ⊢ A ≼ ω ∧ Fun ⁡ F → A ∈ dom ⁡ card
6 simpr ⊢ A ≼ ω ∧ Fun ⁡ F → Fun ⁡ F
7 imadomnum ⊢ A ∈ dom ⁡ card → Fun ⁡ F → F A ≼ A
8 5 6 7 sylc ⊢ A ≼ ω ∧ Fun ⁡ F → F A ≼ A
9 domtr ⊢ F A ≼ A ∧ A ≼ ω → F A ≼ ω
10 8 3 9 syl2anc ⊢ A ≼ ω ∧ Fun ⁡ F → F A ≼ ω