| 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 19950 | . 2 ⊢ (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵)) |
| 4 | 1, 2 | mulgcl 19158 | . . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝑛 · 𝑥) ∈ 𝐵) |
| 5 | 4 | 3expa 1136 | . . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑛 ∈ ℤ) ∧ 𝑥 ∈ 𝐵) → (𝑛 · 𝑥) ∈ 𝐵) |
| 6 | 5 | an32s 664 | . . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) ∧ 𝑛 ∈ ℤ) → (𝑛 · 𝑥) ∈ 𝐵) |
| 7 | 6 | fmpttd 7112 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)):ℤ⟶𝐵) |
| 8 | frn 6715 | . . . . . 6 ⊢ ((𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)):ℤ⟶𝐵 → ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ⊆ 𝐵) | |
| 9 | eqss 3953 | . . . . . . 7 ⊢ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ⊆ 𝐵 ∧ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)))) | |
| 10 | 9 | baib 544 | . . . . . 6 ⊢ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ⊆ 𝐵 → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)))) |
| 11 | 7, 8, 10 | 3syl 19 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)))) |
| 12 | dfss3 3927 | . . . . . 6 ⊢ (𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥))) | |
| 13 | eqid 2763 | . . . . . . . 8 ⊢ (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) | |
| 14 | ovex 7445 | . . . . . . . 8 ⊢ (𝑛 · 𝑥) ∈ V | |
| 15 | 13, 14 | elrnmpti 5954 | . . . . . . 7 ⊢ (𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥)) |
| 16 | 15 | ralbii 3111 | . . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥)) |
| 17 | 12, 16 | bitri 278 | . . . . 5 ⊢ (𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥)) |
| 18 | 11, 17 | bitrdi 290 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| 19 | 18 | rexbidva 3187 | . . 3 ⊢ (𝐺 ∈ Grp → (∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| 20 | 19 | pm5.32i 584 | . 2 ⊢ ((𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵) ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| 21 | 3, 20 | bitri 278 | 1 ⊢ (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ∃wrex 3089 ⊆ wss 3906 ↦ cmpt 5193 ran crn 5664 ⟶wf 6534 ‘cfv 6538 (class class class)co 7412 ℤcz 12592 Basecbs 17270 Grpcgrp 19001 .gcmg 19134 CycGrpccyg 19948 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 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 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-n0 12506 df-z 12593 df-uz 12864 df-fz 13537 df-seq 14040 df-0g 17495 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-grp 19004 df-minusg 19005 df-mulg 19135 df-cyg 19949 |
| This theorem is referenced by: cygabl 19962 |
| Copyright terms: Public domain | W3C validator |