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

Theorem cycsubmel 19441
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 2856 . 2 (𝑋 ∈ 𝐶 ↔ 𝑋 ∈ ran 𝐹)
3 ovex 7473 . . . 4 (𝑥 · 𝐴) ∈ V
4 cycsubm.f . . . 4 𝐹 = (𝑥 ∈ ℕ0 ↦ (𝑥 · 𝐴))
53, 4fnmpti 6701 . . 3 𝐹 Fn ℕ0
6 fvelrnb 6965 . . 3 (𝐹 Fn ℕ0 → (𝑋 ∈ ran 𝐹 ↔ ∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋))
75, 6ax-mp 5 . 2 (𝑋 ∈ ran 𝐹 ↔ ∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋)
8 oveq1 7447 . . . . . 6 (𝑥 = 𝑖 → (𝑥 · 𝐴) = (𝑖 · 𝐴))
9 ovex 7473 . . . . . 6 (𝑖 · 𝐴) ∈ V
108, 4, 9fvmpt 7013 . . . . 5 (𝑖 ∈ ℕ0 → (𝐹‘𝑖) = (𝑖 · 𝐴))
1110eqeq1d 2765 . . . 4 (𝑖 ∈ ℕ0 → ((𝐹‘𝑖) = 𝑋 ↔ (𝑖 · 𝐴) = 𝑋))
12 eqcom 2770 . . . 4 ((𝑖 · 𝐴) = 𝑋 ↔ 𝑋 = (𝑖 · 𝐴))
1311, 12bitrdi 290 . . 3 (𝑖 ∈ ℕ0 → ((𝐹‘𝑖) = 𝑋 ↔ 𝑋 = (𝑖 · 𝐴)))
1413rexbiia 3111 . 2 (∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴))
152, 7, 143bitri 300 1 (𝑋 ∈ 𝐶 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ↦ cmpt 5189  ran crn 5656   Fn wfn 6550  ‘cfv 6555  (class class class)co 7440  ℕ0cn0 12630  Basecbs 17413  .gcmg 19303
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fn 6558  df-fv 6563  df-ov 7443
This theorem is used by:  cycsubmcl  19442  cycsubm  19443  cycsubmcom  19445
  Copyright terms: Public domain W3C validator