Theorem trsp2cyc 33783

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 5111	. . . . . . . 8 ⊢ (𝑦 = 𝑝 → (𝑦 ≈ 2o ↔ 𝑝 ≈ 2o))
3	2	elrab 3648	. . . . . . 7 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↔ (𝑝 ∈ 𝒫 𝐷 ∧ 𝑝 ≈ 2o))
4	1, 3	sylib 221	. . . . . 6 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (𝑝 ∈ 𝒫 𝐷 ∧ 𝑝 ≈ 2o))
5	4	simprd 501	. . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ≈ 2o)
6		en2 9309	. . . . 5 ⊢ (𝑝 ≈ 2o → ∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗})
7	5, 6	syl 18	. . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗})
8	4	simpld 500	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ∈ 𝒫 𝐷)
9	8	elpwid 4569	. . . . . . . . 9 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ⊆ 𝐷)
10	9	adantr 486	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 ⊆ 𝐷)
11		vex 3458	. . . . . . . . . 10 ⊢ 𝑖 ∈ V
12	11	prid1 4725	. . . . . . . . 9 ⊢ 𝑖 ∈ {𝑖, 𝑗}
13		simpr 490	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 = {𝑖, 𝑗})
14	12, 13	eleqtrrid 2871	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ∈ 𝑝)
15	10, 14	sseldd 3914	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ∈ 𝐷)
16		vex 3458	. . . . . . . . . 10 ⊢ 𝑗 ∈ V
17	16	prid2 4726	. . . . . . . . 9 ⊢ 𝑗 ∈ {𝑖, 𝑗}
18	17, 13	eleqtrrid 2871	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑗 ∈ 𝑝)
19	10, 18	sseldd 3914	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑗 ∈ 𝐷)
20	5	adantr 486	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 ≈ 2o)
21	13, 20	eqbrtrrd 5135	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → {𝑖, 𝑗} ≈ 2o)
22		pr2ne 10123	. . . . . . . . . 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 2763	. . . . . . . . . . . 12 ⊢ (pmTrsp‘𝐷) = (pmTrsp‘𝐷)
28	27	pmtrval 19716	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑝 ⊆ 𝐷 ∧ 𝑝 ≈ 2o) → ((pmTrsp‘𝐷)‘𝑝) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
29	26, 10, 20, 28	syl3anc 1399	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((pmTrsp‘𝐷)‘𝑝) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
30	13	fveq2d 6920	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((pmTrsp‘𝐷)‘𝑝) = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
31	25, 29, 30	3eqtr2d 2804	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
32		trsp2cyc.c	. . . . . . . . . 10 ⊢ 𝐶 = (toCyc‘𝐷)
33	32, 26, 15, 19, 24, 27	cycpm2tr 33779	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → (𝐶‘⟨“𝑖𝑗”⟩) = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
34	31, 33	eqtr4d 2801	. . . . . . . 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 1954	. . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗} → ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))))
39	7, 38	mpd 16	. . 3 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
40		r2ex 3203	. . 3 ⊢ (∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)) ↔ ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
41	39, 40	sylibr 237	. 2 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))
42		simpr 490	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑃 ∈ 𝑇)
43		trsp2cyc.t	. . . . 5 ⊢ 𝑇 = ran (pmTrsp‘𝐷)
44	27	pmtrfval 19715	. . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
45	44	adantr 486	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
46	45	rneqd 5932	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ran (pmTrsp‘𝐷) = ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
47	43, 46	eqtrid 2810	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑇 = ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
48	42, 47	eleqtrd 2866	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
49		eqid 2763	. . . . 5 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
50	49	elrnmpt 5952	. . . 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 3174	1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090  {crab 3416   ⊆ wss 3900   ∖ cdif 4048  ifcif 4485  𝒫 cpw 4560  {csn 4588  {cpr 4590  ∪ cuni 4872   class class class wbr 5108   ↦ cmpt 5192  ran crn 5659  ‘cfv 6566  2_oc2o 8508   ≈ cen 9008  ⟨“cs2 15034  pmTrspcpmtr 19706  toCycctocyc 33766

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316  ax-pre-sup 11317

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-sup 9471  df-inf 9472  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-2 12445  df-n0 12647  df-xnn0 12720  df-z 12734  df-uz 13006  df-rp 13161  df-fz 13680  df-fzo 13829  df-fl 13972  df-mod 14050  df-hash 14516  df-word 14700  df-concat 14757  df-s1 14784  df-substr 14831  df-pfx 14863  df-csh 14982  df-s2 15041  df-pmtr 19707  df-tocyc 33767

This theorem is used by:  cyc3genpm  33812