| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cygctb | Structured version Visualization version GIF version | ||
| Description: A cyclic group is countable. (Contributed by Mario Carneiro, 21-Apr-2016.) |
| Ref | Expression |
|---|---|
| cygctb.1 | ⊢ 𝐵 = (Base‘𝐺) |
| Ref | Expression |
|---|---|
| cygctb | ⊢ (𝐺 ∈ CycGrp → 𝐵 ≼ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cygctb.1 | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2734 | . . . 4 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 3 | 1, 2 | iscyg 19847 | . . 3 ⊢ (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) |
| 4 | 3 | simprbi 496 | . 2 ⊢ (𝐺 ∈ CycGrp → ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵) |
| 5 | ovex 7433 | . . . . . 6 ⊢ (𝑛(.g‘𝐺)𝑥) ∈ V | |
| 6 | eqid 2734 | . . . . . 6 ⊢ (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) | |
| 7 | 5, 6 | fnmpti 6678 | . . . . 5 ⊢ (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) Fn ℤ |
| 8 | df-fo 6534 | . . . . 5 ⊢ ((𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)):ℤ–onto→𝐵 ↔ ((𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) Fn ℤ ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) | |
| 9 | 7, 8 | mpbiran 709 | . . . 4 ⊢ ((𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)):ℤ–onto→𝐵 ↔ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵) |
| 10 | omelon 9653 | . . . . . . . 8 ⊢ ω ∈ On | |
| 11 | onenon 9956 | . . . . . . . 8 ⊢ (ω ∈ On → ω ∈ dom card) | |
| 12 | 10, 11 | ax-mp 5 | . . . . . . 7 ⊢ ω ∈ dom card |
| 13 | znnen 16217 | . . . . . . . . 9 ⊢ ℤ ≈ ℕ | |
| 14 | nnenom 13988 | . . . . . . . . 9 ⊢ ℕ ≈ ω | |
| 15 | 13, 14 | entri 9017 | . . . . . . . 8 ⊢ ℤ ≈ ω |
| 16 | ennum 9954 | . . . . . . . 8 ⊢ (ℤ ≈ ω → (ℤ ∈ dom card ↔ ω ∈ dom card)) | |
| 17 | 15, 16 | ax-mp 5 | . . . . . . 7 ⊢ (ℤ ∈ dom card ↔ ω ∈ dom card) |
| 18 | 12, 17 | mpbir 231 | . . . . . 6 ⊢ ℤ ∈ dom card |
| 19 | fodomnum 10064 | . . . . . 6 ⊢ (ℤ ∈ dom card → ((𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)):ℤ–onto→𝐵 → 𝐵 ≼ ℤ)) | |
| 20 | 18, 19 | mp1i 13 | . . . . 5 ⊢ ((𝐺 ∈ CycGrp ∧ 𝑥 ∈ 𝐵) → ((𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)):ℤ–onto→𝐵 → 𝐵 ≼ ℤ)) |
| 21 | domentr 9022 | . . . . . 6 ⊢ ((𝐵 ≼ ℤ ∧ ℤ ≈ ω) → 𝐵 ≼ ω) | |
| 22 | 15, 21 | mpan2 691 | . . . . 5 ⊢ (𝐵 ≼ ℤ → 𝐵 ≼ ω) |
| 23 | 20, 22 | syl6 35 | . . . 4 ⊢ ((𝐺 ∈ CycGrp ∧ 𝑥 ∈ 𝐵) → ((𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)):ℤ–onto→𝐵 → 𝐵 ≼ ω)) |
| 24 | 9, 23 | biimtrrid 243 | . . 3 ⊢ ((𝐺 ∈ CycGrp ∧ 𝑥 ∈ 𝐵) → (ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵 → 𝐵 ≼ ω)) |
| 25 | 24 | rexlimdva 3139 | . 2 ⊢ (𝐺 ∈ CycGrp → (∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵 → 𝐵 ≼ ω)) |
| 26 | 4, 25 | mpd 15 | 1 ⊢ (𝐺 ∈ CycGrp → 𝐵 ≼ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1539 ∈ wcel 2107 ∃wrex 3059 class class class wbr 5117 ↦ cmpt 5199 dom cdm 5652 ran crn 5653 Oncon0 6350 Fn wfn 6523 –onto→wfo 6526 ‘cfv 6528 (class class class)co 7400 ωcom 7856 ≈ cen 8951 ≼ cdom 8952 cardccrd 9942 ℕcn 12233 ℤcz 12581 Basecbs 17215 Grpcgrp 18903 .gcmg 19037 CycGrpccyg 19845 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-rep 5247 ax-sep 5264 ax-nul 5274 ax-pow 5333 ax-pr 5400 ax-un 7724 ax-inf2 9648 ax-cnex 11178 ax-resscn 11179 ax-1cn 11180 ax-icn 11181 ax-addcl 11182 ax-addrcl 11183 ax-mulcl 11184 ax-mulrcl 11185 ax-mulcom 11186 ax-addass 11187 ax-mulass 11188 ax-distr 11189 ax-i2m1 11190 ax-1ne0 11191 ax-1rid 11192 ax-rnegex 11193 ax-rrecex 11194 ax-cnre 11195 ax-pre-lttri 11196 ax-pre-lttrn 11197 ax-pre-ltadd 11198 ax-pre-mulgt0 11199 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3357 df-reu 3358 df-rab 3414 df-v 3459 df-sbc 3764 df-csb 3873 df-dif 3927 df-un 3929 df-in 3931 df-ss 3941 df-pss 3944 df-nul 4307 df-if 4499 df-pw 4575 df-sn 4600 df-pr 4602 df-op 4606 df-uni 4882 df-int 4921 df-iun 4967 df-br 5118 df-opab 5180 df-mpt 5200 df-tr 5228 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6288 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-isom 6537 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7857 df-1st 7983 df-2nd 7984 df-frecs 8275 df-wrecs 8306 df-recs 8380 df-rdg 8419 df-1o 8475 df-oadd 8479 df-omul 8480 df-er 8714 df-map 8837 df-en 8955 df-dom 8956 df-sdom 8957 df-fin 8958 df-oi 9517 df-card 9946 df-acn 9949 df-pnf 11264 df-mnf 11265 df-xr 11266 df-ltxr 11267 df-le 11268 df-sub 11461 df-neg 11462 df-nn 12234 df-n0 12495 df-z 12582 df-uz 12846 df-cyg 19846 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |