Theorem dmct 10519

Description: The domain of a countable set is countable. (Contributed by Thierry Arnoux, 29-Dec-2016.)

Assertion

Ref	Expression
dmct	⊢ (𝐴 ≼ ω → dom 𝐴 ≼ ω)

Proof of Theorem dmct

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmresv 6201	. 2 ⊢ dom (𝐴 ↾ V) = dom 𝐴
2		resss 6002	. . . . 5 ⊢ (𝐴 ↾ V) ⊆ 𝐴
3		ctex 8962	. . . . 5 ⊢ (𝐴 ≼ ω → 𝐴 ∈ V)
4		ssexg 5292	. . . . 5 ⊢ (((𝐴 ↾ V) ⊆ 𝐴 ∧ 𝐴 ∈ V) → (𝐴 ↾ V) ∈ V)
5	2, 3, 4	sylancr 599	. . . 4 ⊢ (𝐴 ≼ ω → (𝐴 ↾ V) ∈ V)
6		fvex 6898	. . . . . . 7 ⊢ (1st ‘𝑥) ∈ V
7		eqid 2765	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)) = (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥))
8	6, 7	fnmpti 6682	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)) Fn (𝐴 ↾ V)
9		dffn4 6802	. . . . . 6 ⊢ ((𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)) Fn (𝐴 ↾ V) ↔ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)):(𝐴 ↾ V)–onto→ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)))
10	8, 9	mpbi 233	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)):(𝐴 ↾ V)–onto→ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥))
11		relres 6006	. . . . . 6 ⊢ Rel (𝐴 ↾ V)
12		reldm 8043	. . . . . 6 ⊢ (Rel (𝐴 ↾ V) → dom (𝐴 ↾ V) = ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)))
13		foeq3 6794	. . . . . 6 ⊢ (dom (𝐴 ↾ V) = ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)) → ((𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)):(𝐴 ↾ V)–onto→dom (𝐴 ↾ V) ↔ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)):(𝐴 ↾ V)–onto→ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥))))
14	11, 12, 13	mp2b 10	. . . . 5 ⊢ ((𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)):(𝐴 ↾ V)–onto→dom (𝐴 ↾ V) ↔ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)):(𝐴 ↾ V)–onto→ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)))
15	10, 14	mpbir 234	. . . 4 ⊢ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)):(𝐴 ↾ V)–onto→dom (𝐴 ↾ V)
16		fodomg 10517	. . . 4 ⊢ ((𝐴 ↾ V) ∈ V → ((𝑥 ∈ (𝐴 ↾ V) ↦ (1st ‘𝑥)):(𝐴 ↾ V)–onto→dom (𝐴 ↾ V) → dom (𝐴 ↾ V) ≼ (𝐴 ↾ V)))
17	5, 15, 16	mpisyl 22	. . 3 ⊢ (𝐴 ≼ ω → dom (𝐴 ↾ V) ≼ (𝐴 ↾ V))
18		ssdomg 8999	. . . . 5 ⊢ (𝐴 ∈ V → ((𝐴 ↾ V) ⊆ 𝐴 → (𝐴 ↾ V) ≼ 𝐴))
19	3, 2, 18	mpisyl 22	. . . 4 ⊢ (𝐴 ≼ ω → (𝐴 ↾ V) ≼ 𝐴)
20		domtr 9006	. . . 4 ⊢ (((𝐴 ↾ V) ≼ 𝐴 ∧ 𝐴 ≼ ω) → (𝐴 ↾ V) ≼ ω)
21	19, 20	mpancom 701	. . 3 ⊢ (𝐴 ≼ ω → (𝐴 ↾ V) ≼ ω)
22		domtr 9006	. . 3 ⊢ ((dom (𝐴 ↾ V) ≼ (𝐴 ↾ V) ∧ (𝐴 ↾ V) ≼ ω) → dom (𝐴 ↾ V) ≼ ω)
23	17, 21, 22	syl2anc 596	. 2 ⊢ (𝐴 ≼ ω → dom (𝐴 ↾ V) ≼ ω)
24	1, 23	eqbrtrrid 5149	1 ⊢ (𝐴 ≼ ω → dom 𝐴 ≼ ω)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2146  Vcvv 3457   ⊆ wss 3906   class class class wbr 5111   ↦ cmpt 5194  dom cdm 5663  ran crn 5664   ↾ cres 5665  Rel wrel 5668   Fn wfn 6535  –onto→wfo 6538  ‘cfv 6540  ωcom 7864  1^st c1st 7986   ≼ cdom 8943

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-ac2 10458

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-er 8696  df-map 8828  df-en 8946  df-dom 8947  df-card 9937  df-acn 9940  df-ac 10112

This theorem is used by:  rnct  10520