| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iscyg3 | Structured version Visualization version GIF version | ||
| Description: Definition of a cyclic group. (Contributed by Mario Carneiro, 21-Apr-2016.) |
| Ref | Expression |
|---|---|
| iscyg.1 | ⊢ 𝐵 = (Base‘𝐺) |
| iscyg.2 | ⊢ · = (.g‘𝐺) |
| Ref | Expression |
|---|---|
| iscyg3 | ⊢ (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iscyg.1 | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | iscyg.2 | . . 3 ⊢ · = (.g‘𝐺) | |
| 3 | 1, 2 | iscyg 19854 | . 2 ⊢ (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵)) |
| 4 | 1, 2 | mulgcl 19067 | . . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝑛 · 𝑥) ∈ 𝐵) |
| 5 | 4 | 3expa 1119 | . . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑛 ∈ ℤ) ∧ 𝑥 ∈ 𝐵) → (𝑛 · 𝑥) ∈ 𝐵) |
| 6 | 5 | an32s 653 | . . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) ∧ 𝑛 ∈ ℤ) → (𝑛 · 𝑥) ∈ 𝐵) |
| 7 | 6 | fmpttd 7067 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)):ℤ⟶𝐵) |
| 8 | frn 6675 | . . . . . 6 ⊢ ((𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)):ℤ⟶𝐵 → ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ⊆ 𝐵) | |
| 9 | eqss 3937 | . . . . . . 7 ⊢ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ⊆ 𝐵 ∧ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)))) | |
| 10 | 9 | baib 535 | . . . . . 6 ⊢ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ⊆ 𝐵 → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)))) |
| 11 | 7, 8, 10 | 3syl 18 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)))) |
| 12 | dfss3 3910 | . . . . . 6 ⊢ (𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥))) | |
| 13 | eqid 2736 | . . . . . . . 8 ⊢ (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) | |
| 14 | ovex 7400 | . . . . . . . 8 ⊢ (𝑛 · 𝑥) ∈ V | |
| 15 | 13, 14 | elrnmpti 5917 | . . . . . . 7 ⊢ (𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥)) |
| 16 | 15 | ralbii 3083 | . . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥)) |
| 17 | 12, 16 | bitri 275 | . . . . 5 ⊢ (𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥)) |
| 18 | 11, 17 | bitrdi 287 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| 19 | 18 | rexbidva 3159 | . . 3 ⊢ (𝐺 ∈ Grp → (∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| 20 | 19 | pm5.32i 574 | . 2 ⊢ ((𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵) ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| 21 | 3, 20 | bitri 275 | 1 ⊢ (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3051 ∃wrex 3061 ⊆ wss 3889 ↦ cmpt 5166 ran crn 5632 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 ℤcz 12524 Basecbs 17179 Grpcgrp 18909 .gcmg 19043 CycGrpccyg 19852 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-fz 13462 df-seq 13964 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-grp 18912 df-minusg 18913 df-mulg 19044 df-cyg 19853 |
| This theorem is referenced by: cygabl 19866 |
| Copyright terms: Public domain | W3C validator |