MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cycsubmel Structured version   Visualization version   GIF version

Theorem cycsubmel 19467
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.)
Hypotheses
Ref Expression
cycsubm.b 𝐵 = (Base‘𝐺)
cycsubm.t · = (.g‘𝐺)
cycsubm.f 𝐹 = (𝑥 ∈ ℕ0 ↦ (𝑥 · 𝐴))
cycsubm.c 𝐶 = ran 𝐹
Assertion
Ref Expression
cycsubmel (𝑋 ∈ 𝐶 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴))
Distinct variable groups:   𝑥,𝐴   𝑖,𝐹   𝑖,𝑋   𝑥,𝑖   𝑥, ·
Allowed substitution hints:   𝐴(𝑖)   𝐵(𝑥, 𝑖)   𝐶(𝑥, 𝑖)   · (𝑖)   𝐹(𝑥)   𝐺(𝑥, 𝑖)   𝑋(𝑥)

Proof of Theorem cycsubmel
StepHypRef Expression
1 cycsubm.c . . 3 𝐶 = ran 𝐹
21eleq2i 2859 . 2 (𝑋 ∈ 𝐶 ↔ 𝑋 ∈ ran 𝐹)
3 ovex 7483 . . . 4 (𝑥 · 𝐴) ∈ V
4 cycsubm.f . . . 4 𝐹 = (𝑥 ∈ ℕ0 ↦ (𝑥 · 𝐴))
53, 4fnmpti 6711 . . 3 𝐹 Fn ℕ0
6 fvelrnb 6975 . . 3 (𝐹 Fn ℕ0 → (𝑋 ∈ ran 𝐹 ↔ ∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋))
75, 6ax-mp 5 . 2 (𝑋 ∈ ran 𝐹 ↔ ∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋)
8 oveq1 7457 . . . . . 6 (𝑥 = 𝑖 → (𝑥 · 𝐴) = (𝑖 · 𝐴))
9 ovex 7483 . . . . . 6 (𝑖 · 𝐴) ∈ V
108, 4, 9fvmpt 7023 . . . . 5 (𝑖 ∈ ℕ0 → (𝐹‘𝑖) = (𝑖 · 𝐴))
1110eqeq1d 2768 . . . 4 (𝑖 ∈ ℕ0 → ((𝐹‘𝑖) = 𝑋 ↔ (𝑖 · 𝐴) = 𝑋))
12 eqcom 2773 . . . 4 ((𝑖 · 𝐴) = 𝑋 ↔ 𝑋 = (𝑖 · 𝐴))
1311, 12bitrdi 290 . . 3 (𝑖 ∈ ℕ0 → ((𝐹‘𝑖) = 𝑋 ↔ 𝑋 = (𝑖 · 𝐴)))
1413rexbiia 3114 . 2 (∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴))
152, 7, 143bitri 300 1 (𝑋 ∈ 𝐶 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1572   ∈ wcel 2150  ∃wrex 3093   ↦ cmpt 5191  ran crn 5658   Fn wfn 6560  ‘cfv 6565  (class class class)co 7450  ℕ0cn0 12645  Basecbs 17433  .gcmg 19329
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-iota 6519  df-fun 6567  df-fn 6568  df-fv 6573  df-ov 7453
This theorem is used by:  cycsubmcl  19468  cycsubm  19469  cycsubmcom  19471
  Copyright terms: Public domain W3C validator