Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iscyggen | 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 |
---|---|
iscyggen | ⊢ (𝑋 ∈ 𝐸 ↔ (𝑋 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 482 | . . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑛 ∈ ℤ) → 𝑥 = 𝑋) | |
2 | 1 | oveq2d 7271 | . . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑛 ∈ ℤ) → (𝑛 · 𝑥) = (𝑛 · 𝑋)) |
3 | 2 | mpteq2dva 5170 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋))) |
4 | 3 | rneqd 5836 | . . 3 ⊢ (𝑥 = 𝑋 → ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋))) |
5 | 4 | eqeq1d 2740 | . 2 ⊢ (𝑥 = 𝑋 → (ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵 ↔ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵)) |
6 | iscyg3.e | . 2 ⊢ 𝐸 = {𝑥 ∈ 𝐵 ∣ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵} | |
7 | 5, 6 | elrab2 3620 | 1 ⊢ (𝑋 ∈ 𝐸 ↔ (𝑋 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {crab 3067 ↦ cmpt 5153 ran crn 5581 ‘cfv 6418 (class class class)co 7255 ℤcz 12249 Basecbs 16840 .gcmg 18615 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-cnv 5588 df-dm 5590 df-rn 5591 df-iota 6376 df-fv 6426 df-ov 7258 |
This theorem is referenced by: iscyggen2 19396 cyggenod 19399 cyggenod2 19400 cygznlem1 20686 cygznlem3 20689 |
Copyright terms: Public domain | W3C validator |