Theorem cshwsexaOLD 14790

Description: Obsolete version of cshwsexa 14789 as of 15-Jan-2025. (Contributed by AV, 8-Jun-2018.) (Revised by Mario Carneiro/AV, 25-Oct-2018.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

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

Distinct variable groups:   𝑛,𝑊,𝑤   𝑛,𝑉

Allowed substitution hint:   𝑉(𝑤)

Proof of Theorem cshwsexaOLD

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rab 3406	. . 3 ⊢ {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} = {𝑤 ∣ (𝑤 ∈ Word 𝑉 ∧ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤)}
2		r19.42v 3169	. . . . 5 ⊢ (∃𝑛 ∈ (0..^(♯‘𝑊))(𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) ↔ (𝑤 ∈ Word 𝑉 ∧ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤))
3	2	bicomi 224	. . . 4 ⊢ ((𝑤 ∈ Word 𝑉 ∧ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤) ↔ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤))
4	3	abbii 2796	. . 3 ⊢ {𝑤 ∣ (𝑤 ∈ Word 𝑉 ∧ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤)} = {𝑤 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤)}
5		df-rex 3054	. . . 4 ⊢ (∃𝑛 ∈ (0..^(♯‘𝑊))(𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) ↔ ∃𝑛(𝑛 ∈ (0..^(♯‘𝑊)) ∧ (𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤)))
6	5	abbii 2796	. . 3 ⊢ {𝑤 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤)} = {𝑤 ∣ ∃𝑛(𝑛 ∈ (0..^(♯‘𝑊)) ∧ (𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤))}
7	1, 4, 6	3eqtri 2756	. 2 ⊢ {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} = {𝑤 ∣ ∃𝑛(𝑛 ∈ (0..^(♯‘𝑊)) ∧ (𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤))}
8		abid2 2865	. . . 4 ⊢ {𝑛 ∣ 𝑛 ∈ (0..^(♯‘𝑊))} = (0..^(♯‘𝑊))
9	8	ovexi 7421	. . 3 ⊢ {𝑛 ∣ 𝑛 ∈ (0..^(♯‘𝑊))} ∈ V
10		tru 1544	. . . . 5 ⊢ ⊤
11	10, 10	pm3.2i 470	. . . 4 ⊢ (⊤ ∧ ⊤)
12		ovexd 7422	. . . . . 6 ⊢ (⊤ → (𝑊 cyclShift 𝑛) ∈ V)
13		eqtr3 2751	. . . . . . . . . . . . 13 ⊢ ((𝑤 = (𝑊 cyclShift 𝑛) ∧ 𝑦 = (𝑊 cyclShift 𝑛)) → 𝑤 = 𝑦)
14	13	ex 412	. . . . . . . . . . . 12 ⊢ (𝑤 = (𝑊 cyclShift 𝑛) → (𝑦 = (𝑊 cyclShift 𝑛) → 𝑤 = 𝑦))
15	14	eqcoms 2737	. . . . . . . . . . 11 ⊢ ((𝑊 cyclShift 𝑛) = 𝑤 → (𝑦 = (𝑊 cyclShift 𝑛) → 𝑤 = 𝑦))
16	15	adantl 481	. . . . . . . . . 10 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) → (𝑦 = (𝑊 cyclShift 𝑛) → 𝑤 = 𝑦))
17	16	com12 32	. . . . . . . . 9 ⊢ (𝑦 = (𝑊 cyclShift 𝑛) → ((𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) → 𝑤 = 𝑦))
18	17	ad2antlr 727	. . . . . . . 8 ⊢ (((⊤ ∧ 𝑦 = (𝑊 cyclShift 𝑛)) ∧ ⊤) → ((𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) → 𝑤 = 𝑦))
19	18	alrimiv 1927	. . . . . . 7 ⊢ (((⊤ ∧ 𝑦 = (𝑊 cyclShift 𝑛)) ∧ ⊤) → ∀𝑤((𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) → 𝑤 = 𝑦))
20	19	ex 412	. . . . . 6 ⊢ ((⊤ ∧ 𝑦 = (𝑊 cyclShift 𝑛)) → (⊤ → ∀𝑤((𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) → 𝑤 = 𝑦)))
21	12, 20	spcimedv 3561	. . . . 5 ⊢ (⊤ → (⊤ → ∃𝑦∀𝑤((𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) → 𝑤 = 𝑦)))
22	21	imp 406	. . . 4 ⊢ ((⊤ ∧ ⊤) → ∃𝑦∀𝑤((𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) → 𝑤 = 𝑦))
23	11, 22	mp1i 13	. . 3 ⊢ (𝑛 ∈ (0..^(♯‘𝑊)) → ∃𝑦∀𝑤((𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤) → 𝑤 = 𝑦))
24	9, 23	zfrep4 5248	. 2 ⊢ {𝑤 ∣ ∃𝑛(𝑛 ∈ (0..^(♯‘𝑊)) ∧ (𝑤 ∈ Word 𝑉 ∧ (𝑊 cyclShift 𝑛) = 𝑤))} ∈ V
25	7, 24	eqeltri 2824	1 ⊢ {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} ∈ V

Syntax hints:   → wi 4   ∧ wa 395  ∀wal 1538   = wceq 1540  ⊤wtru 1541  ∃wex 1779   ∈ wcel 2109  {cab 2707  ∃wrex 3053  {crab 3405  Vcvv 3447  ‘cfv 6511  (class class class)co 7387  0cc0 11068  ..^cfzo 13615  ♯chash 14295  Word cword 14478   cyclShift ccsh 14753

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-nul 5261

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-sn 4590  df-pr 4592  df-uni 4872  df-iota 6464  df-fv 6519  df-ov 7390

This theorem is referenced by: (None)