Theorem trsp2cyc 30815

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 768	. . . . . . 7 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o})
2		breq1 5033	. . . . . . . 8 ⊢ (𝑦 = 𝑝 → (𝑦 ≈ 2o ↔ 𝑝 ≈ 2o))
3	2	elrab 3628	. . . . . . 7 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↔ (𝑝 ∈ 𝒫 𝐷 ∧ 𝑝 ≈ 2o))
4	1, 3	sylib 221	. . . . . 6 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (𝑝 ∈ 𝒫 𝐷 ∧ 𝑝 ≈ 2o))
5	4	simprd 499	. . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ≈ 2o)
6		en2 8738	. . . . 5 ⊢ (𝑝 ≈ 2o → ∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗})
7	5, 6	syl 17	. . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗})
8	4	simpld 498	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ∈ 𝒫 𝐷)
9	8	elpwid 4508	. . . . . . . . 9 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ⊆ 𝐷)
10	9	adantr 484	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 ⊆ 𝐷)
11		vex 3444	. . . . . . . . . 10 ⊢ 𝑖 ∈ V
12	11	prid1 4658	. . . . . . . . 9 ⊢ 𝑖 ∈ {𝑖, 𝑗}
13		simpr 488	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 = {𝑖, 𝑗})
14	12, 13	eleqtrrid 2897	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ∈ 𝑝)
15	10, 14	sseldd 3916	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ∈ 𝐷)
16		vex 3444	. . . . . . . . . 10 ⊢ 𝑗 ∈ V
17	16	prid2 4659	. . . . . . . . 9 ⊢ 𝑗 ∈ {𝑖, 𝑗}
18	17, 13	eleqtrrid 2897	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑗 ∈ 𝑝)
19	10, 18	sseldd 3916	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑗 ∈ 𝐷)
20	5	adantr 484	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 ≈ 2o)
21	13, 20	eqbrtrrd 5054	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → {𝑖, 𝑗} ≈ 2o)
22		pr2ne 9416	. . . . . . . . . 10 ⊢ ((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) → ({𝑖, 𝑗} ≈ 2o ↔ 𝑖 ≠ 𝑗))
23	22	biimpa 480	. . . . . . . . 9 ⊢ (((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ {𝑖, 𝑗} ≈ 2o) → 𝑖 ≠ 𝑗)
24	15, 19, 21, 23	syl21anc 836	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ≠ 𝑗)
25		simplr 768	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
26		simp-4l 782	. . . . . . . . . . 11 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝐷 ∈ 𝑉)
27		eqid 2798	. . . . . . . . . . . 12 ⊢ (pmTrsp‘𝐷) = (pmTrsp‘𝐷)
28	27	pmtrval 18571	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑝 ⊆ 𝐷 ∧ 𝑝 ≈ 2o) → ((pmTrsp‘𝐷)‘𝑝) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
29	26, 10, 20, 28	syl3anc 1368	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((pmTrsp‘𝐷)‘𝑝) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
30	13	fveq2d 6649	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((pmTrsp‘𝐷)‘𝑝) = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
31	25, 29, 30	3eqtr2d 2839	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
32		trsp2cyc.c	. . . . . . . . . 10 ⊢ 𝐶 = (toCyc‘𝐷)
33	32, 26, 15, 19, 24, 27	cycpm2tr 30811	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → (𝐶‘⟨“𝑖𝑗”⟩) = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
34	31, 33	eqtr4d 2836	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))
35	24, 34	jca 515	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))
36	15, 19, 35	jca31 518	. . . . . 6 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
37	36	ex 416	. . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (𝑝 = {𝑖, 𝑗} → ((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))))
38	37	2eximdv 1920	. . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗} → ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))))
39	7, 38	mpd 15	. . 3 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
40		r2ex 3262	. . 3 ⊢ (∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)) ↔ ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
41	39, 40	sylibr 237	. 2 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))
42		simpr 488	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑃 ∈ 𝑇)
43		trsp2cyc.t	. . . . 5 ⊢ 𝑇 = ran (pmTrsp‘𝐷)
44	27	pmtrfval 18570	. . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
45	44	adantr 484	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
46	45	rneqd 5772	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ran (pmTrsp‘𝐷) = ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
47	43, 46	syl5eq 2845	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑇 = ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
48	42, 47	eleqtrd 2892	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
49		eqid 2798	. . . . 5 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
50	49	elrnmpt 5792	. . . 4 ⊢ (𝑃 ∈ 𝑇 → (𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ↔ ∃𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
51	50	adantl 485	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → (𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ↔ ∃𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
52	48, 51	mpbid 235	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ∃𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
53	41, 52	r19.29a 3248	1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538  ∃wex 1781   ∈ wcel 2111   ≠ wne 2987  ∃wrex 3107  {crab 3110   ∖ cdif 3878   ⊆ wss 3881  ifcif 4425  𝒫 cpw 4497  {csn 4525  {cpr 4527  ∪ cuni 4800   class class class wbr 5030   ↦ cmpt 5110  ran crn 5520  ‘cfv 6324  2_oc2o 8079   ≈ cen 8489  ⟨“cs2 14194  pmTrspcpmtr 18561  toCycctocyc 30798

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603  ax-pre-sup 10604

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-2o 8086  df-oadd 8089  df-er 8272  df-map 8391  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-sup 8890  df-inf 8891  df-card 9352  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-div 11287  df-nn 11626  df-2 11688  df-n0 11886  df-xnn0 11956  df-z 11970  df-uz 12232  df-rp 12378  df-fz 12886  df-fzo 13029  df-fl 13157  df-mod 13233  df-hash 13687  df-word 13858  df-concat 13914  df-s1 13941  df-substr 13994  df-pfx 14024  df-csh 14142  df-s2 14201  df-pmtr 18562  df-tocyc 30799

This theorem is referenced by:  cyc3genpm  30844