Theorem swapf2fval 50191

Description: The morphism part of the swap functor. See also swapf2fvala 50190. (Contributed by Zhi Wang, 7-Oct-2025.)

Hypotheses

Ref	Expression
swapfval.c	⊢ (𝜑 → 𝐶 ∈ 𝑈)
swapfval.d	⊢ (𝜑 → 𝐷 ∈ 𝑉)
swapf2fvala.s	⊢ 𝑆 = (𝐶 ×c 𝐷)
swapf2fvala.b	⊢ 𝐵 = (Base‘𝑆)
swapf2fvala.h	⊢ (𝜑 → 𝐻 = (Hom ‘𝑆))
swapf2fval.o	⊢ (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)

Assertion

Ref	Expression
swapf2fval	⊢ (𝜑 → 𝑃 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓})))

Distinct variable groups:   𝑢,𝐵,𝑣   𝑢,𝐶,𝑣   𝑢,𝐷,𝑣   𝑓,𝐻,𝑢,𝑣   𝑢,𝑆,𝑣   𝜑,𝑢,𝑣

Allowed substitution hints:   𝜑(𝑓)   𝐵(𝑓)   𝐶(𝑓)   𝐷(𝑓)   𝑃(𝑣, 𝑢, 𝑓)   𝑆(𝑓)   𝑈(𝑣, 𝑢, 𝑓)   𝑂(𝑣, 𝑢, 𝑓)   𝑉(𝑣, 𝑢, 𝑓)

Proof of Theorem swapf2fval

Step	Hyp	Ref	Expression
1		swapf2fval.o	. . 3 ⊢ (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
2	1	fveq2d 6882	. 2 ⊢ (𝜑 → (2nd ‘(𝐶 swapF 𝐷)) = (2nd ‘⟨𝑂, 𝑃⟩))
3		swapfval.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑈)
4		swapfval.d	. . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑉)
5		swapf2fvala.s	. . 3 ⊢ 𝑆 = (𝐶 ×c 𝐷)
6		swapf2fvala.b	. . 3 ⊢ 𝐵 = (Base‘𝑆)
7		swapf2fvala.h	. . 3 ⊢ (𝜑 → 𝐻 = (Hom ‘𝑆))
8	3, 4, 5, 6, 7	swapf2fvala 50190	. 2 ⊢ (𝜑 → (2nd ‘(𝐶 swapF 𝐷)) = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓})))
9	3, 4	swapfelvv 50189	. . . 4 ⊢ (𝜑 → (𝐶 swapF 𝐷) ∈ (V × V))
10	1, 9	eqeltrrd 2861	. . 3 ⊢ (𝜑 → ⟨𝑂, 𝑃⟩ ∈ (V × V))
11		opelxp 5691	. . . 4 ⊢ (⟨𝑂, 𝑃⟩ ∈ (V × V) ↔ (𝑂 ∈ V ∧ 𝑃 ∈ V))
12	11	biimpi 219	. . 3 ⊢ (⟨𝑂, 𝑃⟩ ∈ (V × V) → (𝑂 ∈ V ∧ 𝑃 ∈ V))
13		op2ndg 7999	. . 3 ⊢ ((𝑂 ∈ V ∧ 𝑃 ∈ V) → (2nd ‘⟨𝑂, 𝑃⟩) = 𝑃)
14	10, 12, 13	3syl 19	. 2 ⊢ (𝜑 → (2nd ‘⟨𝑂, 𝑃⟩) = 𝑃)
15	2, 8, 14	3eqtr3rd 2804	1 ⊢ (𝜑 → 𝑃 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓})))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450  {csn 4584  ⟨cop 4590  ∪ cuni 4867   ↦ cmpt 5186   × cxp 5653  ^◡ccnv 5654  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  2^nd c2nd 7985  Basecbs 17301  Hom chom 17353   ×_c cxpc 18256   swap_F cswapf 50185

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-swapf 50186

This theorem is used by:  swapf2fn  50194  swapf2vala  50196