Theorem swapf2a 49761

Description: The morphism part of the swap functor swaps the morphisms. (Contributed by Zhi Wang, 7-Oct-2025.)

Hypotheses

Ref	Expression
swapf1a.o	⊢ (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
swapf1a.s	⊢ 𝑆 = (𝐶 ×c 𝐷)
swapf1a.b	⊢ 𝐵 = (Base‘𝑆)
swapf1a.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
swapf2a.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
swapf2a.h	⊢ (𝜑 → 𝐻 = (Hom ‘𝑆))
swapf2a.f	⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))

Assertion

Ref	Expression
swapf2a	⊢ (𝜑 → ((𝑋𝑃𝑌)‘𝐹) = ⟨(2nd ‘𝐹), (1st ‘𝐹)⟩)

Proof of Theorem swapf2a

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		swapf1a.o	. . 3 ⊢ (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
2		swapf1a.s	. . 3 ⊢ 𝑆 = (𝐶 ×c 𝐷)
3		swapf1a.b	. . 3 ⊢ 𝐵 = (Base‘𝑆)
4		swapf1a.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
5		swapf2a.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
6		swapf2a.h	. . 3 ⊢ (𝜑 → 𝐻 = (Hom ‘𝑆))
7	1, 2, 3, 4, 5, 6	swapf2vala 49760	. 2 ⊢ (𝜑 → (𝑋𝑃𝑌) = (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}))
8		simpr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
9	8	sneqd 4567	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → {𝑓} = {𝐹})
10	9	cnveqd 5817	. . . 4 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ◡{𝑓} = ◡{𝐹})
11	10	unieqd 4851	. . 3 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ∪ ◡{𝑓} = ∪ ◡{𝐹})
12		swapf2a.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
13	6	oveqd 7373	. . . . . . 7 ⊢ (𝜑 → (𝑋𝐻𝑌) = (𝑋(Hom ‘𝑆)𝑌))
14		eqid 2739	. . . . . . . 8 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
15		eqid 2739	. . . . . . . 8 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
16		eqid 2739	. . . . . . . 8 ⊢ (Hom ‘𝑆) = (Hom ‘𝑆)
17	2, 3, 14, 15, 16, 4, 5	xpchom 18137	. . . . . . 7 ⊢ (𝜑 → (𝑋(Hom ‘𝑆)𝑌) = (((1st ‘𝑋)(Hom ‘𝐶)(1st ‘𝑌)) × ((2nd ‘𝑋)(Hom ‘𝐷)(2nd ‘𝑌))))
18	13, 17	eqtrd 2774	. . . . . 6 ⊢ (𝜑 → (𝑋𝐻𝑌) = (((1st ‘𝑋)(Hom ‘𝐶)(1st ‘𝑌)) × ((2nd ‘𝑋)(Hom ‘𝐷)(2nd ‘𝑌))))
19	12, 18	eleqtrd 2841	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (((1st ‘𝑋)(Hom ‘𝐶)(1st ‘𝑌)) × ((2nd ‘𝑋)(Hom ‘𝐷)(2nd ‘𝑌))))
20		2nd1st 7980	. . . . 5 ⊢ (𝐹 ∈ (((1st ‘𝑋)(Hom ‘𝐶)(1st ‘𝑌)) × ((2nd ‘𝑋)(Hom ‘𝐷)(2nd ‘𝑌))) → ∪ ◡{𝐹} = ⟨(2nd ‘𝐹), (1st ‘𝐹)⟩)
21	19, 20	syl 17	. . . 4 ⊢ (𝜑 → ∪ ◡{𝐹} = ⟨(2nd ‘𝐹), (1st ‘𝐹)⟩)
22	21	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ∪ ◡{𝐹} = ⟨(2nd ‘𝐹), (1st ‘𝐹)⟩)
23	11, 22	eqtrd 2774	. 2 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ∪ ◡{𝑓} = ⟨(2nd ‘𝐹), (1st ‘𝐹)⟩)
24		opex 5403	. . 3 ⊢ ⟨(2nd ‘𝐹), (1st ‘𝐹)⟩ ∈ V
25	24	a1i 11	. 2 ⊢ (𝜑 → ⟨(2nd ‘𝐹), (1st ‘𝐹)⟩ ∈ V)
26	7, 23, 12, 25	fvmptd 6943	1 ⊢ (𝜑 → ((𝑋𝑃𝑌)‘𝐹) = ⟨(2nd ‘𝐹), (1st ‘𝐹)⟩)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119  Vcvv 3431  {csn 4555  ⟨cop 4561  ∪ cuni 4838   × cxp 5616  ^◡ccnv 5617  ‘cfv 6485  (class class class)co 7356  1^st c1st 7929  2^nd c2nd 7930  Basecbs 17170  Hom chom 17222   ×_c cxpc 18125   swap_F cswapf 49749

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-er 8633  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-3 12236  df-4 12237  df-5 12238  df-6 12239  df-7 12240  df-8 12241  df-9 12242  df-n0 12429  df-z 12516  df-dec 12636  df-uz 12780  df-fz 13453  df-struct 17108  df-slot 17143  df-ndx 17155  df-base 17171  df-hom 17235  df-cco 17236  df-xpc 18129  df-swapf 49750

This theorem is referenced by:  swapfcoa  49771