Theorem cshwsexa 14887

Description: The class of (different!) words resulting by cyclically shifting something (not necessarily a word) is a set. (Contributed by AV, 8-Jun-2018.) (Revised by Mario Carneiro/AV, 25-Oct-2018.) (Proof shortened by SN, 15-Jan-2025.)

Assertion

Ref	Expression
cshwsexa	⊢ {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} ∈ V

Distinct variable group:   𝑛,𝑊,𝑤

Allowed substitution hints:   𝑉(𝑤, 𝑛)

Proof of Theorem cshwsexa

Step	Hyp	Ref	Expression
1		eqcom 2773	. . . . 5 ⊢ ((𝑊 cyclShift 𝑛) = 𝑤 ↔ 𝑤 = (𝑊 cyclShift 𝑛))
2	1	rexbii 3115	. . . 4 ⊢ (∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤 ↔ ∃𝑛 ∈ (0..^(♯‘𝑊))𝑤 = (𝑊 cyclShift 𝑛))
3	2	abbii 2833	. . 3 ⊢ {𝑤 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} = {𝑤 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))𝑤 = (𝑊 cyclShift 𝑛)}
4		ovex 7456	. . . 4 ⊢ (0..^(♯‘𝑊)) ∈ V
5	4	abrexex 7968	. . 3 ⊢ {𝑤 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))𝑤 = (𝑊 cyclShift 𝑛)} ∈ V
6	3, 5	eqeltri 2862	. 2 ⊢ {𝑤 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} ∈ V
7		rabssab 4042	. 2 ⊢ {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} ⊆ {𝑤 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤}
8	6, 7	ssexi 5298	1 ⊢ {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} ∈ V

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2146  {cab 2744  ∃wrex 3092  {crab 3419  Vcvv 3458  ‘cfv 6543  (class class class)co 7423  0cc0 11118  ..^cfzo 13701  ♯chash 14386  Word cword 14570   cyclShift ccsh 14851

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 2148  ax-9 2156  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274

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-sb 2100  df-mo 2570  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-sn 4595  df-pr 4597  df-uni 4878  df-iota 6499  df-fv 6551  df-ov 7426

This theorem is used by: (None)