Database
ZFC (ZERMELO-FRAENKEL WITH CHOICE) SET THEORY
ZFC Set Theory - add the Axiom of Choice
AC equivalents: well-ordering, Zorn's lemma
rnct
Next ⟩
fodomb
Metamath Proof Explorer
Ascii
Unicode
Theorem
rnct
Description:
The range of a countable set is countable.
(Contributed by
Thierry Arnoux
, 29-Dec-2016)
Ref
Expression
Assertion
rnct
⊢
A
≼
ω
→
ran
⁡
A
≼
ω
Proof
Step
Hyp
Ref
Expression
1
cnvct
⊢
A
≼
ω
→
A
-1
≼
ω
2
dmct
⊢
A
-1
≼
ω
→
dom
⁡
A
-1
≼
ω
3
df-rn
⊢
ran
⁡
A
=
dom
⁡
A
-1
4
3
breq1i
⊢
ran
⁡
A
≼
ω
↔
dom
⁡
A
-1
≼
ω
5
4
biimpri
⊢
dom
⁡
A
-1
≼
ω
→
ran
⁡
A
≼
ω
6
1
2
5
3syl
⊢
A
≼
ω
→
ran
⁡
A
≼
ω