Metamath Proof Explorer


Theorem abrexctf

Description: An image set of a countable set is countable, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Thierry Arnoux, 8-Mar-2017)

Ref Expression
Hypothesis mptctf.1 𝑥 𝐴
Assertion abrexctf ( 𝐴 ≼ ω → { 𝑦 ∣ ∃ 𝑥𝐴 𝑦 = 𝐵 } ≼ ω )

Proof

Step Hyp Ref Expression
1 mptctf.1 𝑥 𝐴
2 eqid ( 𝑥𝐴𝐵 ) = ( 𝑥𝐴𝐵 )
3 2 rnmpt ran ( 𝑥𝐴𝐵 ) = { 𝑦 ∣ ∃ 𝑥𝐴 𝑦 = 𝐵 }
4 1 mptctf ( 𝐴 ≼ ω → ( 𝑥𝐴𝐵 ) ≼ ω )
5 rnct ( ( 𝑥𝐴𝐵 ) ≼ ω → ran ( 𝑥𝐴𝐵 ) ≼ ω )
6 4 5 syl ( 𝐴 ≼ ω → ran ( 𝑥𝐴𝐵 ) ≼ ω )
7 3 6 eqbrtrrid ( 𝐴 ≼ ω → { 𝑦 ∣ ∃ 𝑥𝐴 𝑦 = 𝐵 } ≼ ω )