Theorem trsp2cyc 33143

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 769	. . . . . . 7 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o})
2		breq1 5146	. . . . . . . 8 ⊢ (𝑦 = 𝑝 → (𝑦 ≈ 2o ↔ 𝑝 ≈ 2o))
3	2	elrab 3692	. . . . . . 7 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↔ (𝑝 ∈ 𝒫 𝐷 ∧ 𝑝 ≈ 2o))
4	1, 3	sylib 218	. . . . . 6 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (𝑝 ∈ 𝒫 𝐷 ∧ 𝑝 ≈ 2o))
5	4	simprd 495	. . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ≈ 2o)
6		en2 9315	. . . . 5 ⊢ (𝑝 ≈ 2o → ∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗})
7	5, 6	syl 17	. . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗})
8	4	simpld 494	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ∈ 𝒫 𝐷)
9	8	elpwid 4609	. . . . . . . . 9 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → 𝑝 ⊆ 𝐷)
10	9	adantr 480	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 ⊆ 𝐷)
11		vex 3484	. . . . . . . . . 10 ⊢ 𝑖 ∈ V
12	11	prid1 4762	. . . . . . . . 9 ⊢ 𝑖 ∈ {𝑖, 𝑗}
13		simpr 484	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 = {𝑖, 𝑗})
14	12, 13	eleqtrrid 2848	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ∈ 𝑝)
15	10, 14	sseldd 3984	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ∈ 𝐷)
16		vex 3484	. . . . . . . . . 10 ⊢ 𝑗 ∈ V
17	16	prid2 4763	. . . . . . . . 9 ⊢ 𝑗 ∈ {𝑖, 𝑗}
18	17, 13	eleqtrrid 2848	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑗 ∈ 𝑝)
19	10, 18	sseldd 3984	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑗 ∈ 𝐷)
20	5	adantr 480	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 ≈ 2o)
21	13, 20	eqbrtrrd 5167	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → {𝑖, 𝑗} ≈ 2o)
22		pr2ne 10044	. . . . . . . . . 10 ⊢ ((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) → ({𝑖, 𝑗} ≈ 2o ↔ 𝑖 ≠ 𝑗))
23	22	biimpa 476	. . . . . . . . 9 ⊢ (((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ {𝑖, 𝑗} ≈ 2o) → 𝑖 ≠ 𝑗)
24	15, 19, 21, 23	syl21anc 838	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑖 ≠ 𝑗)
25		simplr 769	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
26		simp-4l 783	. . . . . . . . . . 11 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝐷 ∈ 𝑉)
27		eqid 2737	. . . . . . . . . . . 12 ⊢ (pmTrsp‘𝐷) = (pmTrsp‘𝐷)
28	27	pmtrval 19469	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑝 ⊆ 𝐷 ∧ 𝑝 ≈ 2o) → ((pmTrsp‘𝐷)‘𝑝) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
29	26, 10, 20, 28	syl3anc 1373	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((pmTrsp‘𝐷)‘𝑝) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
30	13	fveq2d 6910	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((pmTrsp‘𝐷)‘𝑝) = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
31	25, 29, 30	3eqtr2d 2783	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
32		trsp2cyc.c	. . . . . . . . . 10 ⊢ 𝐶 = (toCyc‘𝐷)
33	32, 26, 15, 19, 24, 27	cycpm2tr 33139	. . . . . . . . 9 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → (𝐶‘⟨“𝑖𝑗”⟩) = ((pmTrsp‘𝐷)‘{𝑖, 𝑗}))
34	31, 33	eqtr4d 2780	. . . . . . . 8 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))
35	24, 34	jca 511	. . . . . . 7 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))
36	15, 19, 35	jca31 514	. . . . . 6 ⊢ (((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∧ 𝑝 = {𝑖, 𝑗}) → ((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
37	36	ex 412	. . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (𝑝 = {𝑖, 𝑗} → ((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))))
38	37	2eximdv 1919	. . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → (∃𝑖∃𝑗 𝑝 = {𝑖, 𝑗} → ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))))
39	7, 38	mpd 15	. . 3 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
40		r2ex 3196	. . 3 ⊢ (∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)) ↔ ∃𝑖∃𝑗((𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) ∧ (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩))))
41	39, 40	sylibr 234	. 2 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) ∧ 𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}) ∧ 𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))
42		simpr 484	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑃 ∈ 𝑇)
43		trsp2cyc.t	. . . . 5 ⊢ 𝑇 = ran (pmTrsp‘𝐷)
44	27	pmtrfval 19468	. . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
45	44	adantr 480	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
46	45	rneqd 5949	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ran (pmTrsp‘𝐷) = ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
47	43, 46	eqtrid 2789	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑇 = ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
48	42, 47	eleqtrd 2843	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → 𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
49		eqid 2737	. . . . 5 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
50	49	elrnmpt 5969	. . . 4 ⊢ (𝑃 ∈ 𝑇 → (𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ↔ ∃𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
51	50	adantl 481	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → (𝑃 ∈ ran (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ↔ ∃𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
52	48, 51	mpbid 232	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ∃𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o}𝑃 = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
53	41, 52	r19.29a 3162	1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ∈ 𝑇) → ∃𝑖 ∈ 𝐷 ∃𝑗 ∈ 𝐷 (𝑖 ≠ 𝑗 ∧ 𝑃 = (𝐶‘⟨“𝑖𝑗”⟩)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2108   ≠ wne 2940  ∃wrex 3070  {crab 3436   ∖ cdif 3948   ⊆ wss 3951  ifcif 4525  𝒫 cpw 4600  {csn 4626  {cpr 4628  ∪ cuni 4907   class class class wbr 5143   ↦ cmpt 5225  ran crn 5686  ‘cfv 6561  2_oc2o 8500   ≈ cen 8982  ⟨“cs2 14880  pmTrspcpmtr 19459  toCycctocyc 33126

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-cnex 11211  ax-resscn 11212  ax-1cn 11213  ax-icn 11214  ax-addcl 11215  ax-addrcl 11216  ax-mulcl 11217  ax-mulrcl 11218  ax-mulcom 11219  ax-addass 11220  ax-mulass 11221  ax-distr 11222  ax-i2m1 11223  ax-1ne0 11224  ax-1rid 11225  ax-rnegex 11226  ax-rrecex 11227  ax-cnre 11228  ax-pre-lttri 11229  ax-pre-lttrn 11230  ax-pre-ltadd 11231  ax-pre-mulgt0 11232  ax-pre-sup 11233

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-tp 4631  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-2o 8507  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-sup 9482  df-inf 9483  df-card 9979  df-pnf 11297  df-mnf 11298  df-xr 11299  df-ltxr 11300  df-le 11301  df-sub 11494  df-neg 11495  df-div 11921  df-nn 12267  df-2 12329  df-n0 12527  df-xnn0 12600  df-z 12614  df-uz 12879  df-rp 13035  df-fz 13548  df-fzo 13695  df-fl 13832  df-mod 13910  df-hash 14370  df-word 14553  df-concat 14609  df-s1 14634  df-substr 14679  df-pfx 14709  df-csh 14827  df-s2 14887  df-pmtr 19460  df-tocyc 33127

This theorem is referenced by:  cyc3genpm  33172