Theorem swapf2vala 50081

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 50059	. . 3 ⊢ (𝜑 → 𝐶 ∈ V)
5	1, 2, 3	elxpcbasex2 50061	. . 3 ⊢ (𝜑 → 𝐷 ∈ V)
6		swapf2a.h	. . 3 ⊢ (𝜑 → 𝐻 = (Hom ‘𝑆))
7		swapf1a.o	. . 3 ⊢ (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
8	4, 5, 1, 2, 6, 7	swapf2fval 50076	. 2 ⊢ (𝜑 → 𝑃 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓})))
9		simprl 783	. . . 4 ⊢ ((𝜑 ∧ (𝑢 = 𝑋 ∧ 𝑣 = 𝑌)) → 𝑢 = 𝑋)
10		simprr 785	. . . 4 ⊢ ((𝜑 ∧ (𝑢 = 𝑋 ∧ 𝑣 = 𝑌)) → 𝑣 = 𝑌)
11	9, 10	oveq12d 7434	. . 3 ⊢ ((𝜑 ∧ (𝑢 = 𝑋 ∧ 𝑣 = 𝑌)) → (𝑢𝐻𝑣) = (𝑋𝐻𝑌))
12	11	mpteq1d 5203	. 2 ⊢ ((𝜑 ∧ (𝑢 = 𝑋 ∧ 𝑣 = 𝑌)) → (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓}) = (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}))
13		swapf2a.y	. 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
14		ovex 7449	. . . 4 ⊢ (𝑋𝐻𝑌) ∈ V
15	14	mptex 7225	. . 3 ⊢ (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}) ∈ V
16	15	a1i 11	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}) ∈ V)
17	8, 12, 3, 13, 16	ovmpod 7568	1 ⊢ (𝜑 → (𝑋𝑃𝑌) = (𝑓 ∈ (𝑋𝐻𝑌) ↦ ∪ ◡{𝑓}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3457  {csn 4591  ⟨cop 4597  ∪ cuni 4874   ↦ cmpt 5194  ^◡ccnv 5662  ‘cfv 6540  (class class class)co 7416  Basecbs 17287  Hom chom 17339   ×_c cxpc 18242   swap_F cswapf 50070

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-1cn 11169  ax-addcl 11171

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-nn 12245  df-slot 17260  df-ndx 17272  df-base 17288  df-xpc 18246  df-swapf 50071

This theorem is used by:  swapf2a  50082  swapf2val  50084  swapf2f1oaALT  50089