Theorem tocycf 30406

Description: The permutation cycle builder as a function. (Contributed by Thierry Arnoux, 25-Sep-2023.)

Hypotheses

Ref	Expression
tocycf.c	⊢ 𝐶 = (toCyc‘𝐷)
tocycf.s	⊢ 𝑆 = (SymGrp‘𝐷)
tocycf.b	⊢ 𝐵 = (Base‘𝑆)

Assertion

Ref	Expression
tocycf	⊢ (𝐷 ∈ 𝑉 → 𝐶:{𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}⟶𝐵)

Distinct variable group:   𝑤,𝐷

Allowed substitution hints:   𝐵(𝑤)   𝐶(𝑤)   𝑆(𝑤)   𝑉(𝑤)

Proof of Theorem tocycf

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		tocycf.c	. . 3 ⊢ 𝐶 = (toCyc‘𝐷)
2	1	tocycval 30397	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝐶 = (𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷} ↦ (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢))))
3		simpr 485	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → 𝑢 = ∅)
4	3	rneqd 5690	. . . . . . . . . 10 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → ran 𝑢 = ran ∅)
5		rn0 5715	. . . . . . . . . 10 ⊢ ran ∅ = ∅
6	4, 5	syl6eq 2847	. . . . . . . . 9 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → ran 𝑢 = ∅)
7	6	difeq2d 4020	. . . . . . . 8 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → (𝐷 ∖ ran 𝑢) = (𝐷 ∖ ∅))
8		dif0 4252	. . . . . . . 8 ⊢ (𝐷 ∖ ∅) = 𝐷
9	7, 8	syl6eq 2847	. . . . . . 7 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → (𝐷 ∖ ran 𝑢) = 𝐷)
10	9	reseq2d 5734	. . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → ( I ↾ (𝐷 ∖ ran 𝑢)) = ( I ↾ 𝐷))
11	3	cnveqd 5632	. . . . . . . . 9 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → ◡𝑢 = ◡∅)
12		cnv0 5875	. . . . . . . . 9 ⊢ ◡∅ = ∅
13	11, 12	syl6eq 2847	. . . . . . . 8 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → ◡𝑢 = ∅)
14	13	coeq2d 5619	. . . . . . 7 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → ((𝑢 cyclShift 1) ∘ ◡𝑢) = ((𝑢 cyclShift 1) ∘ ∅))
15		co02 5988	. . . . . . 7 ⊢ ((𝑢 cyclShift 1) ∘ ∅) = ∅
16	14, 15	syl6eq 2847	. . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → ((𝑢 cyclShift 1) ∘ ◡𝑢) = ∅)
17	10, 16	uneq12d 4061	. . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)) = (( I ↾ 𝐷) ∪ ∅))
18		un0 4264	. . . . 5 ⊢ (( I ↾ 𝐷) ∪ ∅) = ( I ↾ 𝐷)
19	17, 18	syl6eq 2847	. . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)) = ( I ↾ 𝐷))
20		tocycf.s	. . . . . . 7 ⊢ 𝑆 = (SymGrp‘𝐷)
21	20	idresperm 18268	. . . . . 6 ⊢ (𝐷 ∈ 𝑉 → ( I ↾ 𝐷) ∈ (Base‘𝑆))
22		tocycf.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑆)
23	21, 22	syl6eleqr 2894	. . . . 5 ⊢ (𝐷 ∈ 𝑉 → ( I ↾ 𝐷) ∈ 𝐵)
24	23	ad2antrr 722	. . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → ( I ↾ 𝐷) ∈ 𝐵)
25	19, 24	eqeltrd 2883	. . 3 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 = ∅) → (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)) ∈ 𝐵)
26		difexg 5122	. . . . . . . . 9 ⊢ (𝐷 ∈ 𝑉 → (𝐷 ∖ ran 𝑢) ∈ V)
27	26	resiexd 6845	. . . . . . . 8 ⊢ (𝐷 ∈ 𝑉 → ( I ↾ (𝐷 ∖ ran 𝑢)) ∈ V)
28		ovex 7048	. . . . . . . . 9 ⊢ (𝑢 cyclShift 1) ∈ V
29		vex 3440	. . . . . . . . . 10 ⊢ 𝑢 ∈ V
30	29	cnvex 7486	. . . . . . . . 9 ⊢ ◡𝑢 ∈ V
31	28, 30	coex 7491	. . . . . . . 8 ⊢ ((𝑢 cyclShift 1) ∘ ◡𝑢) ∈ V
32		unexg 7329	. . . . . . . 8 ⊢ ((( I ↾ (𝐷 ∖ ran 𝑢)) ∈ V ∧ ((𝑢 cyclShift 1) ∘ ◡𝑢) ∈ V) → (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)) ∈ V)
33	27, 31, 32	sylancl 586	. . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)) ∈ V)
34	33	adantr 481	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) → (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)) ∈ V)
35	2, 34	fvmpt2d 6647	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) → (𝐶‘𝑢) = (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)))
36	35	adantr 481	. . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 ≠ ∅) → (𝐶‘𝑢) = (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)))
37		simpll 763	. . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 ≠ ∅) → 𝐷 ∈ 𝑉)
38		simplr 765	. . . . . . . 8 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 ≠ ∅) → 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷})
39		id 22	. . . . . . . . . 10 ⊢ (𝑤 = 𝑢 → 𝑤 = 𝑢)
40		dmeq 5658	. . . . . . . . . 10 ⊢ (𝑤 = 𝑢 → dom 𝑤 = dom 𝑢)
41		eqidd 2796	. . . . . . . . . 10 ⊢ (𝑤 = 𝑢 → 𝐷 = 𝐷)
42	39, 40, 41	f1eq123d 6476	. . . . . . . . 9 ⊢ (𝑤 = 𝑢 → (𝑤:dom 𝑤–1-1→𝐷 ↔ 𝑢:dom 𝑢–1-1→𝐷))
43	42	elrab 3618	. . . . . . . 8 ⊢ (𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷} ↔ (𝑢 ∈ Word 𝐷 ∧ 𝑢:dom 𝑢–1-1→𝐷))
44	38, 43	sylib 219	. . . . . . 7 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 ≠ ∅) → (𝑢 ∈ Word 𝐷 ∧ 𝑢:dom 𝑢–1-1→𝐷))
45	44	simpld 495	. . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 ≠ ∅) → 𝑢 ∈ Word 𝐷)
46	44	simprd 496	. . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 ≠ ∅) → 𝑢:dom 𝑢–1-1→𝐷)
47	1, 37, 45, 46, 20	cycpmcl 30405	. . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 ≠ ∅) → (𝐶‘𝑢) ∈ (Base‘𝑆))
48	47, 22	syl6eleqr 2894	. . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 ≠ ∅) → (𝐶‘𝑢) ∈ 𝐵)
49	36, 48	eqeltrrd 2884	. . 3 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) ∧ 𝑢 ≠ ∅) → (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)) ∈ 𝐵)
50	25, 49	pm2.61dane 3072	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑢 ∈ {𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}) → (( I ↾ (𝐷 ∖ ran 𝑢)) ∪ ((𝑢 cyclShift 1) ∘ ◡𝑢)) ∈ 𝐵)
51	2, 50	fmpt3d 6743	1 ⊢ (𝐷 ∈ 𝑉 → 𝐶:{𝑤 ∈ Word 𝐷 ∣ 𝑤:dom 𝑤–1-1→𝐷}⟶𝐵)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1522   ∈ wcel 2081   ≠ wne 2984  {crab 3109  Vcvv 3437   ∖ cdif 3856   ∪ cun 3857  ∅c0 4211   I cid 5347  ^◡ccnv 5442  dom cdm 5443  ran crn 5444   ↾ cres 5445   ∘ ccom 5447  ⟶wf 6221  –1-1→wf1 6222  ‘cfv 6225  (class class class)co 7016  1c1 10384  Word cword 13707   cyclShift ccsh 13986  Basecbs 16312  SymGrpcsymg 18236  toCycctocyc 30395

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-rep 5081  ax-sep 5094  ax-nul 5101  ax-pow 5157  ax-pr 5221  ax-un 7319  ax-cnex 10439  ax-resscn 10440  ax-1cn 10441  ax-icn 10442  ax-addcl 10443  ax-addrcl 10444  ax-mulcl 10445  ax-mulrcl 10446  ax-mulcom 10447  ax-addass 10448  ax-mulass 10449  ax-distr 10450  ax-i2m1 10451  ax-1ne0 10452  ax-1rid 10453  ax-rnegex 10454  ax-rrecex 10455  ax-cnre 10456  ax-pre-lttri 10457  ax-pre-lttrn 10458  ax-pre-ltadd 10459  ax-pre-mulgt0 10460  ax-pre-sup 10461

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3or 1081  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-nel 3091  df-ral 3110  df-rex 3111  df-reu 3112  df-rmo 3113  df-rab 3114  df-v 3439  df-sbc 3707  df-csb 3812  df-dif 3862  df-un 3864  df-in 3866  df-ss 3874  df-pss 3876  df-nul 4212  df-if 4382  df-pw 4455  df-sn 4473  df-pr 4475  df-tp 4477  df-op 4479  df-uni 4746  df-int 4783  df-iun 4827  df-br 4963  df-opab 5025  df-mpt 5042  df-tr 5064  df-id 5348  df-eprel 5353  df-po 5362  df-so 5363  df-fr 5402  df-we 5404  df-xp 5449  df-rel 5450  df-cnv 5451  df-co 5452  df-dm 5453  df-rn 5454  df-res 5455  df-ima 5456  df-pred 6023  df-ord 6069  df-on 6070  df-lim 6071  df-suc 6072  df-iota 6189  df-fun 6227  df-fn 6228  df-f 6229  df-f1 6230  df-fo 6231  df-f1o 6232  df-fv 6233  df-riota 6977  df-ov 7019  df-oprab 7020  df-mpo 7021  df-om 7437  df-1st 7545  df-2nd 7546  df-wrecs 7798  df-recs 7860  df-rdg 7898  df-1o 7953  df-oadd 7957  df-er 8139  df-map 8258  df-en 8358  df-dom 8359  df-sdom 8360  df-fin 8361  df-sup 8752  df-inf 8753  df-card 9214  df-pnf 10523  df-mnf 10524  df-xr 10525  df-ltxr 10526  df-le 10527  df-sub 10719  df-neg 10720  df-div 11146  df-nn 11487  df-2 11548  df-3 11549  df-4 11550  df-5 11551  df-6 11552  df-7 11553  df-8 11554  df-9 11555  df-n0 11746  df-z 11830  df-uz 12094  df-rp 12240  df-fz 12743  df-fzo 12884  df-fl 13012  df-mod 13088  df-hash 13541  df-word 13708  df-concat 13769  df-substr 13839  df-pfx 13869  df-csh 13987  df-struct 16314  df-ndx 16315  df-slot 16316  df-base 16318  df-plusg 16407  df-tset 16413  df-symg 18237  df-tocyc 30396

This theorem is referenced by:  tocyc01  30407  cycpm3cl2  30415  cycpmconjv  30421  tocyccntz  30423  cyc3evpm  30430  cycpmgcl  30433  cycpmconjslem2  30435  cyc3conja  30437