Theorem trsp2cyc 33564

Description: Exhibit the word a transposition corresponds to, as a cycle. (Contributed by Thierry Arnoux, 25-Sep-2023.)

Hypotheses

Ref	Expression
trsp2cyc.t	⊢ 𝑇 = ran (pmTrsp‘𝐷)
trsp2cyc.c	⊢ 𝐶 = (toCyc‘𝐷)

Assertion

Ref	Expression
trsp2cyc	⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))

Distinct variable groups:   𝐷,𝑖,𝑗   𝑃,𝑖,𝑗   𝑇,𝑖,𝑗   𝑖,𝑉,𝑗

Allowed substitution hints:   𝐶(𝑖, 𝑗)

Proof of Theorem trsp2cyc

Dummy variables 𝑝 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 781	. . . . . . 7 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o})
2		breq1 5106	. . . . . . . 8 ⊢ (𝑦 = 𝑝 → (𝑦 ≈ 2o ↔ 𝑝 ≈ 2o))
3	2	elrab 3645	. . . . . . 7 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↔ (𝑝 ∈ 𝒫 𝐷 ∧ 𝑝 ≈ 2o))
4	1, 3	sylib 221	. . . . . 6 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (𝑝 ∈ 𝒫 𝐷 ∧ 𝑝 ≈ 2o))
5	4	simprd 501	. . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ≈ 2o)
6		en2 9251	. . . . 5 ⊢ (𝑝 ≈ 2o → ∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗})
7	5, 6	syl 18	. . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗})
8	4	simpld 500	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ∈ 𝒫 𝐷)
9	8	elpwid 4566	. . . . . . . . 9 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ⊆ 𝐷)
10	9	adantr 486	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 ⊆ 𝐷)
11		vex 3454	. . . . . . . . . 10 ⊢ 𝑖 ∈ V
12	11	prid1 4723	. . . . . . . . 9 ⊢ 𝑖 ∈ {𝑖, 𝑗}
13		simpr 490	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 = {𝑖, 𝑗})
14	12, 13	eleqtrrid 2867	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ∈ 𝑝)
15	10, 14	sseldd 3932	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ∈ 𝐷)
16		vex 3454	. . . . . . . . . 10 ⊢ 𝑗 ∈ V
17	16	prid2 4724	. . . . . . . . 9 ⊢ 𝑗 ∈ {𝑖, 𝑗}
18	17, 13	eleqtrrid 2867	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑗 ∈ 𝑝)
19	10, 18	sseldd 3932	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑗 ∈ 𝐷)
20	5	adantr 486	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 ≈ 2o)
21	13, 20	eqbrtrrd 5129	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → {𝑖, 𝑗} ≈ 2o)
22		pr2ne 10009	. . . . . . . . . 10 ⊢ ((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) → ({𝑖, 𝑗} ≈ 2o ↔ 𝑖 ≠ 𝑗))
23	22	biimpa 482	. . . . . . . . 9 ⊢ (((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ {𝑖, 𝑗} ≈ 2o) → 𝑖 ≠ 𝑗)
24	15, 19, 21, 23	syl21anc 851	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ≠ 𝑗)
25		simplr 781	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
26		simp-4l 795	. . . . . . . . . . 11 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝐷 ∈ 𝑉)
27		eqid 2760	. . . . . . . . . . . 12 ⊢ (pmTrsp‘𝐷) = (pmTrsp‘𝐷)
28	27	pmtrval 19579	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑝 ⊆ 𝐷 ∧ 𝑝 ≈ 2o) → ((pmTrsp‘𝐷)‘𝑝) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
29	26, 10, 20, 28	syl3anc 1398	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((pmTrsp‘𝐷)‘𝑝) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
30	13	fveq2d 6883	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((pmTrsp‘𝐷)‘𝑝) = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
31	25, 29, 30	3eqtr2d 2801	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
32		trsp2cyc.c	. . . . . . . . . 10 ⊢ 𝐶 = (toCyc‘𝐷)
33	32, 26, 15, 19, 24, 27	cycpm2tr 33560	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → (𝐶‘⟨“𝑖𝑗”⟩) = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
34	31, 33	eqtr4d 2798	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))
35	24, 34	jca 521	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))
36	15, 19, 35	jca31 524	. . . . . 6 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
37	36	ex 418	. . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (𝑝 = {𝑖, 𝑗} → ((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))))
38	37	2eximdv 1952	. . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗} → ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))))
39	7, 38	mpd 16	. . 3 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
40		r2ex 3199	. . 3 ⊢ (∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)) ↔ ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
41	39, 40	sylibr 237	. 2 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))
42		simpr 490	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑃 ∈ 𝑇)
43		trsp2cyc.t	. . . . 5 ⊢ 𝑇 = ran (pmTrsp‘𝐷)
44	27	pmtrfval 19578	. . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
45	44	adantr 486	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
46	45	rneqd 5922	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ran (pmTrsp‘𝐷) = ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
47	43, 46	eqtrid 2807	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑇 = ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
48	42, 47	eleqtrd 2862	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
49		eqid 2760	. . . . 5 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
50	49	elrnmpt 5942	. . . 4 ⊢ (𝑃 ∈ 𝑇 → (𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ↔ ∃𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
51	50	adantl 487	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → (𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ↔ ∃𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
52	48, 51	mpbid 235	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ∃𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
53	41, 52	r19.29a 3170	1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2955  ∃wrex 3086  {crab 3412   ∖ cdif 3896   ⊆ wss 3899  ifcif 4482  𝒫 cpw 4557  {csn 4584  {cpr 4586  ∪ cuni 4867   class class class wbr 5103   ↦ cmpt 5186  ran crn 5656  ‘cfv 6533  2_oc2o 8450   ≈ cen 8950  ⟨“cs2 14913  pmTrspcpmtr 19569  toCycctocyc 33547

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 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11181  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201  ax-pre-mulgt0 11202  ax-pre-sup 11203

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8456  df-2o 8457  df-er 8697  df-map 8829  df-en 8954  df-dom 8955  df-sdom 8956  df-fin 8957  df-sup 9413  df-inf 9414  df-card 9945  df-pnf 11270  df-mnf 11271  df-xr 11272  df-ltxr 11273  df-le 11274  df-sub 11468  df-neg 11469  df-div 11897  df-nn 12259  df-2 12328  df-n0 12530  df-xnn0 12603  df-z 12617  df-uz 12889  df-rp 13044  df-fz 13563  df-fzo 13711  df-fl 13854  df-mod 13932  df-hash 14396  df-word 14580  df-concat 14637  df-s1 14664  df-substr 14710  df-pfx 14742  df-csh 14861  df-s2 14920  df-pmtr 19570  df-tocyc 33548

This theorem is used by:  cyc3genpm  33593