| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cycsubmel | Structured version Visualization version GIF version | ||
| Description: Characterization of an element of the set of nonnegative integer powers of an element 𝐴. Although this theorem holds for any class 𝐺, the definition of 𝐹 is only meaningful if 𝐺 is a monoid or at least a unital magma. (Contributed by AV, 28-Dec-2023.) |
| Ref | Expression |
|---|---|
| cycsubm.b | ⊢ 𝐵 = (Base‘𝐺) |
| cycsubm.t | ⊢ · = (.g‘𝐺) |
| cycsubm.f | ⊢ 𝐹 = (𝑥 ∈ ℕ0 ↦ (𝑥 · 𝐴)) |
| cycsubm.c | ⊢ 𝐶 = ran 𝐹 |
| Ref | Expression |
|---|---|
| cycsubmel | ⊢ (𝑋 ∈ 𝐶 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cycsubm.c | . . 3 ⊢ 𝐶 = ran 𝐹 | |
| 2 | 1 | eleq2i 2852 | . 2 ⊢ (𝑋 ∈ 𝐶 ↔ 𝑋 ∈ ran 𝐹) |
| 3 | ovex 7453 | . . . 4 ⊢ (𝑥 · 𝐴) ∈ V | |
| 4 | cycsubm.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ℕ0 ↦ (𝑥 · 𝐴)) | |
| 5 | 3, 4 | fnmpti 6682 | . . 3 ⊢ 𝐹 Fn ℕ0 |
| 6 | fvelrnb 6945 | . . 3 ⊢ (𝐹 Fn ℕ0 → (𝑋 ∈ ran 𝐹 ↔ ∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋)) | |
| 7 | 5, 6 | ax-mp 5 | . 2 ⊢ (𝑋 ∈ ran 𝐹 ↔ ∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋) |
| 8 | oveq1 7427 | . . . . . 6 ⊢ (𝑥 = 𝑖 → (𝑥 · 𝐴) = (𝑖 · 𝐴)) | |
| 9 | ovex 7453 | . . . . . 6 ⊢ (𝑖 · 𝐴) ∈ V | |
| 10 | 8, 4, 9 | fvmpt 6993 | . . . . 5 ⊢ (𝑖 ∈ ℕ0 → (𝐹‘𝑖) = (𝑖 · 𝐴)) |
| 11 | 10 | eqeq1d 2762 | . . . 4 ⊢ (𝑖 ∈ ℕ0 → ((𝐹‘𝑖) = 𝑋 ↔ (𝑖 · 𝐴) = 𝑋)) |
| 12 | eqcom 2767 | . . . 4 ⊢ ((𝑖 · 𝐴) = 𝑋 ↔ 𝑋 = (𝑖 · 𝐴)) | |
| 13 | 11, 12 | bitrdi 290 | . . 3 ⊢ (𝑖 ∈ ℕ0 → ((𝐹‘𝑖) = 𝑋 ↔ 𝑋 = (𝑖 · 𝐴))) |
| 14 | 13 | rexbiia 3107 | . 2 ⊢ (∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴)) |
| 15 | 2, 7, 14 | 3bitri 300 | 1 ⊢ (𝑋 ∈ 𝐶 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 ↦ cmpt 5185 ran crn 5651 Fn wfn 6533 ‘cfv 6538 (class class class)co 7420 ℕ0cn0 12606 Basecbs 17387 .gcmg 19277 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-iota 6494 df-fun 6540 df-fn 6541 df-fv 6546 df-ov 7423 |
| This theorem is used by: cycsubmcl 19416 cycsubm 19417 cycsubmcom 19419 |
| Copyright terms: Public domain | W3C validator |