Theorem swapf2vala 50499

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450  {csn 4584  ⟨cop 4834  ∪ cuni 4866   ↦ cmpt 5185  ^◡ccnv 5649  ‘cfv 6541  (class class class)co 7422  Basecbs 17394  Hom chom 17446   ×_c cxpc 18349   swap_F cswapf 50488

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7753  ax-cnex 11261  ax-1cn 11263  ax-addcl 11265

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7425  df-oprab 7426  df-mpo 7427  df-om 7880  df-1st 8003  df-2nd 8004  df-frecs 8304  df-wrecs 8335  df-recs 8384  df-rdg 8423  df-nn 12341  df-slot 17367  df-ndx 17379  df-base 17395  df-xpc 18353  df-swapf 50489

This theorem is used by:  swapf2a  50500  swapf2val  50502  swapf2f1oaALT  50507