Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iscyggen2 | Structured version Visualization version GIF version |
Description: The property of being a cyclic generator for a group. (Contributed by Mario Carneiro, 21-Apr-2016.) |
Ref | Expression |
---|---|
iscyg.1 | ⊢ 𝐵 = (Base‘𝐺) |
iscyg.2 | ⊢ · = (.g‘𝐺) |
iscyg3.e | ⊢ 𝐸 = {𝑥 ∈ 𝐵 ∣ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵} |
Ref | Expression |
---|---|
iscyggen2 | ⊢ (𝐺 ∈ Grp → (𝑋 ∈ 𝐸 ↔ (𝑋 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑋)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iscyg.1 | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
2 | iscyg.2 | . . 3 ⊢ · = (.g‘𝐺) | |
3 | iscyg3.e | . . 3 ⊢ 𝐸 = {𝑥 ∈ 𝐵 ∣ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵} | |
4 | 1, 2, 3 | iscyggen 18282 | . 2 ⊢ (𝑋 ∈ 𝐸 ↔ (𝑋 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵)) |
5 | 1, 2 | mulgcl 17559 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑛 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑛 · 𝑋) ∈ 𝐵) |
6 | 5 | 3expa 1265 | . . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑛 ∈ ℤ) ∧ 𝑋 ∈ 𝐵) → (𝑛 · 𝑋) ∈ 𝐵) |
7 | 6 | an32s 846 | . . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ ℤ) → (𝑛 · 𝑋) ∈ 𝐵) |
8 | eqid 2622 | . . . . . 6 ⊢ (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) | |
9 | 7, 8 | fmptd 6385 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)):ℤ⟶𝐵) |
10 | frn 6053 | . . . . 5 ⊢ ((𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)):ℤ⟶𝐵 → ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) ⊆ 𝐵) | |
11 | eqss 3618 | . . . . . 6 ⊢ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵 ↔ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) ⊆ 𝐵 ∧ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)))) | |
12 | 11 | baib 944 | . . . . 5 ⊢ (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) ⊆ 𝐵 → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵 ↔ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)))) |
13 | 9, 10, 12 | 3syl 18 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵 ↔ 𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)))) |
14 | dfss3 3592 | . . . . 5 ⊢ (𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) ↔ ∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋))) | |
15 | ovex 6678 | . . . . . . 7 ⊢ (𝑛 · 𝑋) ∈ V | |
16 | 8, 15 | elrnmpti 5376 | . . . . . 6 ⊢ (𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) ↔ ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑋)) |
17 | 16 | ralbii 2980 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑋)) |
18 | 14, 17 | bitri 264 | . . . 4 ⊢ (𝐵 ⊆ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑋)) |
19 | 13, 18 | syl6bb 276 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑋))) |
20 | 19 | pm5.32da 673 | . 2 ⊢ (𝐺 ∈ Grp → ((𝑋 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵) ↔ (𝑋 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑋)))) |
21 | 4, 20 | syl5bb 272 | 1 ⊢ (𝐺 ∈ Grp → (𝑋 ∈ 𝐸 ↔ (𝑋 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑛 ∈ ℤ 𝑦 = (𝑛 · 𝑋)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∀wral 2912 ∃wrex 2913 {crab 2916 ⊆ wss 3574 ↦ cmpt 4729 ran crn 5115 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ℤcz 11377 Basecbs 15857 Grpcgrp 17422 .gcmg 17540 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-seq 12802 df-0g 16102 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-grp 17425 df-minusg 17426 df-mulg 17541 |
This theorem is referenced by: cyggeninv 18285 iscygd 18289 cygznlem3 19918 |
Copyright terms: Public domain | W3C validator |