Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  dmct Structured version   Visualization version   GIF version

Theorem dmct 9984
 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.
StepHypRef Expression
1 dmresv 6029 . 2 dom (𝐴 ↾ V) = dom 𝐴
2 resss 5848 . . . . 5 (𝐴 ↾ V) ⊆ 𝐴
3 ctex 8542 . . . . 5 (𝐴 ≼ ω → 𝐴 ∈ V)
4 ssexg 5193 . . . . 5 (((𝐴 ↾ V) ⊆ 𝐴𝐴 ∈ V) → (𝐴 ↾ V) ∈ V)
52, 3, 4sylancr 590 . . . 4 (𝐴 ≼ ω → (𝐴 ↾ V) ∈ V)
6 fvex 6671 . . . . . . 7 (1st𝑥) ∈ V
7 eqid 2758 . . . . . . 7 (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)) = (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥))
86, 7fnmpti 6474 . . . . . 6 (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)) Fn (𝐴 ↾ V)
9 dffn4 6582 . . . . . 6 ((𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)) Fn (𝐴 ↾ V) ↔ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)):(𝐴 ↾ V)–onto→ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)))
108, 9mpbi 233 . . . . 5 (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)):(𝐴 ↾ V)–onto→ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥))
11 relres 5852 . . . . . 6 Rel (𝐴 ↾ V)
12 reldm 7747 . . . . . 6 (Rel (𝐴 ↾ V) → dom (𝐴 ↾ V) = ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)))
13 foeq3 6574 . . . . . 6 (dom (𝐴 ↾ V) = ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)) → ((𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)):(𝐴 ↾ V)–onto→dom (𝐴 ↾ V) ↔ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)):(𝐴 ↾ V)–onto→ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥))))
1411, 12, 13mp2b 10 . . . . 5 ((𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)):(𝐴 ↾ V)–onto→dom (𝐴 ↾ V) ↔ (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)):(𝐴 ↾ V)–onto→ran (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)))
1510, 14mpbir 234 . . . 4 (𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)):(𝐴 ↾ V)–onto→dom (𝐴 ↾ V)
16 fodomg 9982 . . . 4 ((𝐴 ↾ V) ∈ V → ((𝑥 ∈ (𝐴 ↾ V) ↦ (1st𝑥)):(𝐴 ↾ V)–onto→dom (𝐴 ↾ V) → dom (𝐴 ↾ V) ≼ (𝐴 ↾ V)))
175, 15, 16mpisyl 21 . . 3 (𝐴 ≼ ω → dom (𝐴 ↾ V) ≼ (𝐴 ↾ V))
18 ssdomg 8573 . . . . 5 (𝐴 ∈ V → ((𝐴 ↾ V) ⊆ 𝐴 → (𝐴 ↾ V) ≼ 𝐴))
193, 2, 18mpisyl 21 . . . 4 (𝐴 ≼ ω → (𝐴 ↾ V) ≼ 𝐴)
20 domtr 8580 . . . 4 (((𝐴 ↾ V) ≼ 𝐴𝐴 ≼ ω) → (𝐴 ↾ V) ≼ ω)
2119, 20mpancom 687 . . 3 (𝐴 ≼ ω → (𝐴 ↾ V) ≼ ω)
22 domtr 8580 . . 3 ((dom (𝐴 ↾ V) ≼ (𝐴 ↾ V) ∧ (𝐴 ↾ V) ≼ ω) → dom (𝐴 ↾ V) ≼ ω)
2317, 21, 22syl2anc 587 . 2 (𝐴 ≼ ω → dom (𝐴 ↾ V) ≼ ω)
241, 23eqbrtrrid 5068 1 (𝐴 ≼ ω → dom 𝐴 ≼ ω)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   = wceq 1538   ∈ wcel 2111  Vcvv 3409   ⊆ wss 3858   class class class wbr 5032   ↦ cmpt 5112  dom cdm 5524  ran crn 5525   ↾ cres 5526  Rel wrel 5529   Fn wfn 6330  –onto→wfo 6333  ‘cfv 6335  ωcom 7579  1st c1st 7691   ≼ cdom 8525 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-rep 5156  ax-sep 5169  ax-nul 5176  ax-pow 5234  ax-pr 5298  ax-un 7459  ax-ac2 9923 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-reu 3077  df-rmo 3078  df-rab 3079  df-v 3411  df-sbc 3697  df-csb 3806  df-dif 3861  df-un 3863  df-in 3865  df-ss 3875  df-pss 3877  df-nul 4226  df-if 4421  df-pw 4496  df-sn 4523  df-pr 4525  df-tp 4527  df-op 4529  df-uni 4799  df-int 4839  df-iun 4885  df-br 5033  df-opab 5095  df-mpt 5113  df-tr 5139  df-id 5430  df-eprel 5435  df-po 5443  df-so 5444  df-fr 5483  df-se 5484  df-we 5485  df-xp 5530  df-rel 5531  df-cnv 5532  df-co 5533  df-dm 5534  df-rn 5535  df-res 5536  df-ima 5537  df-pred 6126  df-ord 6172  df-on 6173  df-suc 6175  df-iota 6294  df-fun 6337  df-fn 6338  df-f 6339  df-f1 6340  df-fo 6341  df-f1o 6342  df-fv 6343  df-isom 6344  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7693  df-2nd 7694  df-wrecs 7957  df-recs 8018  df-er 8299  df-map 8418  df-en 8528  df-dom 8529  df-card 9401  df-acn 9404  df-ac 9576 This theorem is referenced by:  rnct  9985
 Copyright terms: Public domain W3C validator