Theorem swapf2vala 50076

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 ‘𝑆))

Assertion

Ref	Expression
swapf2vala	⊢ (𝜑 → (𝑋𝑃𝑌) = (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}))

Distinct variable groups:   𝑓,𝐻   𝑓,𝑋   𝑓,𝑌

Allowed substitution hints:   𝜑(𝑓)   𝐵(𝑓)   𝐶(𝑓)   𝐷(𝑓)   𝑃(𝑓)   𝑆(𝑓)   𝑂(𝑓)

Proof of Theorem swapf2vala

Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		swapf1a.s	. . . 4 ⊢ 𝑆 = (𝐶 ×c 𝐷)
2		swapf1a.b	. . . 4 ⊢ 𝐵 = (Base‘𝑆)
3		swapf1a.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
4	1, 2, 3	elxpcbasex1 50054	. . 3 ⊢ (𝜑 → 𝐶 ∈ V)
5	1, 2, 3	elxpcbasex2 50056	. . 3 ⊢ (𝜑 → 𝐷 ∈ V)
6		swapf2a.h	. . 3 ⊢ (𝜑 → 𝐻 = (Hom ‘𝑆))
7		swapf1a.o	. . 3 ⊢ (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
8	4, 5, 1, 2, 6, 7	swapf2fval 50071	. 2 ⊢ (𝜑 → 𝑃 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓})))
9		simprl 782	. . . 4 ⊢ ((𝜑 ∧ (𝑢 = 𝑋 ∧ 𝑣 = 𝑌)) → 𝑢 = 𝑋)
10		simprr 784	. . . 4 ⊢ ((𝜑 ∧ (𝑢 = 𝑋 ∧ 𝑣 = 𝑌)) → 𝑣 = 𝑌)
11	9, 10	oveq12d 7430	. . 3 ⊢ ((𝜑 ∧ (𝑢 = 𝑋 ∧ 𝑣 = 𝑌)) → (𝑢𝐻𝑣) = (𝑋𝐻𝑌))
12	11	mpteq1d 5200	. 2 ⊢ ((𝜑 ∧ (𝑢 = 𝑋 ∧ 𝑣 = 𝑌)) → (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓}) = (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}))
13		swapf2a.y	. 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
14		ovex 7445	. . . 4 ⊢ (𝑋𝐻𝑌) ∈ V
15	14	mptex 7221	. . 3 ⊢ (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}) ∈ V
16	15	a1i 11	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}) ∈ V)
17	8, 12, 3, 13, 16	ovmpod 7564	1 ⊢ (𝜑 → (𝑋𝑃𝑌) = (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  Vcvv 3454  {csn 4588  ⟨cop 4594  ∪ cuni 4871   ↦ cmpt 5191  ^◡ccnv 5659  ‘cfv 6536  (class class class)co 7412  Basecbs 17275  Hom chom 17327   ×_c cxpc 18230   swap_F cswapf 50065

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-cnex 11162  ax-1cn 11164  ax-addcl 11166

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-nn 12240  df-slot 17248  df-ndx 17260  df-base 17276  df-xpc 18234  df-swapf 50066

This theorem is used by:  swapf2a  50077  swapf2val  50079  swapf2f1oaALT  50084