Theorem cycsubmel 19329

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

Step	Hyp	Ref	Expression
1		cycsubm.c	. . 3 ⊢ 𝐶 = ran 𝐹
2	1	eleq2i 2854	. 2 ⊢ (𝑋 ∈ 𝐶 ↔ 𝑋 ∈ ran 𝐹)
3		ovex 7449	. . . 4 ⊢ (𝑥 · 𝐴) ∈ V
4		cycsubm.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ ℕ0 ↦ (𝑥 · 𝐴))
5	3, 4	fnmpti 6679	. . 3 ⊢ 𝐹 Fn ℕ0
6		fvelrnb 6942	. . 3 ⊢ (𝐹 Fn ℕ0 → (𝑋 ∈ ran 𝐹 ↔ ∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋))
7	5, 6	ax-mp 5	. 2 ⊢ (𝑋 ∈ ran 𝐹 ↔ ∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋)
8		oveq1 7423	. . . . . 6 ⊢ (𝑥 = 𝑖 → (𝑥 · 𝐴) = (𝑖 · 𝐴))
9		ovex 7449	. . . . . 6 ⊢ (𝑖 · 𝐴) ∈ V
10	8, 4, 9	fvmpt 6990	. . . . 5 ⊢ (𝑖 ∈ ℕ0 → (𝐹‘𝑖) = (𝑖 · 𝐴))
11	10	eqeq1d 2764	. . . 4 ⊢ (𝑖 ∈ ℕ0 → ((𝐹‘𝑖) = 𝑋 ↔ (𝑖 · 𝐴) = 𝑋))
12		eqcom 2769	. . . 4 ⊢ ((𝑖 · 𝐴) = 𝑋 ↔ 𝑋 = (𝑖 · 𝐴))
13	11, 12	bitrdi 290	. . 3 ⊢ (𝑖 ∈ ℕ0 → ((𝐹‘𝑖) = 𝑋 ↔ 𝑋 = (𝑖 · 𝐴)))
14	13	rexbiia 3109	. 2 ⊢ (∃𝑖 ∈ ℕ0 (𝐹‘𝑖) = 𝑋 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴))
15	2, 7, 14	3bitri 300	1 ⊢ (𝑋 ∈ 𝐶 ↔ ∃𝑖 ∈ ℕ0 𝑋 = (𝑖 · 𝐴))

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2145  ∃wrex 3088   ↦ cmpt 5190  ran crn 5660   Fn wfn 6532  ‘cfv 6537  (class class class)co 7416  ℕ₀cn0 12531  Basecbs 17305  ._gcmg 19191

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-ov 7419

This theorem is used by:  cycsubmcl  19330  cycsubm  19331  cycsubmcom  19333