| 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 20012 | . 2 ⊢ (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵)) |
| 4 | 1, 2 | mulgcl 19220 | . . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝑛 · 𝑥) ∈ 𝐵) |
| 5 | 4 | 3expa 1136 | . . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑛 ∈ ℤ) ∧ 𝑥 ∈ 𝐵) → (𝑛 · 𝑥) ∈ 𝐵) |
| 6 | 5 | an32s 665 | . . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) ∧ 𝑛 ∈ ℤ) → (𝑛 · 𝑥) ∈ 𝐵) |
| 7 | 6 | fmpttd 7112 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)):ℤ⟶𝐵) |
| 8 | frn 6714 | . . . . . 6 ⊢ ((𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)):ℤ⟶𝐵 → ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ⊆ 𝐵) | |
| 9 | eqss 3949 | . . . . . . 7 ⊢ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ⊆ 𝐵 ∧ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)))) | |
| 10 | 9 | baib 545 | . . . . . 6 ⊢ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ⊆ 𝐵 → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)))) |
| 11 | 7, 8, 10 | 3syl 19 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)))) |
| 12 | dfss3 3923 | . . . . . 6 ⊢ (𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥))) | |
| 13 | eqid 2762 | . . . . . . . 8 ⊢ (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) | |
| 14 | ovex 7450 | . . . . . . . 8 ⊢ (𝑛 · 𝑥) ∈ V | |
| 15 | 13, 14 | elrnmpti 5950 | . . . . . . 7 ⊢ (𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥)) |
| 16 | 15 | ralbii 3110 | . . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥)) |
| 17 | 12, 16 | bitri 278 | . . . . 5 ⊢ (𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥)) |
| 18 | 11, 17 | bitrdi 290 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| 19 | 18 | rexbidva 3186 | . . 3 ⊢ (𝐺 ∈ Grp → (∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| 20 | 19 | pm5.32i 585 | . 2 ⊢ ((𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵) ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| 21 | 3, 20 | bitri 278 | 1 ⊢ (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑥))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3078 ∃wrex 3088 ⊆ wss 3902 ↦ cmpt 5190 ran crn 5660 ⟶wf 6533 ‘cfv 6537 (class class class)co 7417 ℤcz 12619 Basecbs 17307 Grpcgrp 19063 .gcmg 19196 CycGrpccyg 20010 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-n0 12533 df-z 12620 df-uz 12892 df-fz 13566 df-seq 14070 df-0g 17532 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-grp 19066 df-minusg 19067 df-mulg 19197 df-cyg 20011 |
| This theorem is used by: cygabl 20024 |
| Copyright terms: Public domain | W3C validator |