Theorem swapf2vala 50347

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  {csn 4584  ⟨cop 4590  ∪ cuni 4867   ↦ cmpt 5186  ^◡ccnv 5650  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  Hom chom 17432   ×_c cxpc 18335   swap_F cswapf 50336

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-1cn 11251  ax-addcl 11253

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-nn 12329  df-slot 17353  df-ndx 17365  df-base 17381  df-xpc 18339  df-swapf 50337

This theorem is used by:  swapf2a  50348  swapf2val  50350  swapf2f1oaALT  50355