Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  swapf2fvala Structured version   Visualization version   GIF version

Theorem swapf2fvala 50341
Description: The morphism part of the swap functor. See also swapf2fval 50342. (Contributed by Zhi Wang, 7-Oct-2025.)
Hypotheses
Ref Expression
swapfval.c (𝜑 → 𝐶 ∈ 𝑈)
swapfval.d (𝜑 → 𝐷 ∈ 𝑉)
swapf2fvala.s 𝑆 = (𝐶 ×c 𝐷)
swapf2fvala.b 𝐵 = (Base‘𝑆)
swapf2fvala.h (𝜑 → 𝐻 = (Hom ‘𝑆))
Assertion
Ref Expression
swapf2fvala (𝜑 → (2nd ‘(𝐶 swapF 𝐷)) = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓})))
Distinct variable groups:   𝑢,𝐵,𝑣   𝑢,𝐶,𝑣   𝑢,𝐷,𝑣   𝑓,𝐻,𝑢,𝑣   𝑢,𝑆,𝑣   𝜑,𝑢,𝑣
Allowed substitution hints:   𝜑(𝑓)   𝐵(𝑓)   𝐶(𝑓)   𝐷(𝑓)   𝑆(𝑓)   𝑈(𝑣, 𝑢, 𝑓)   𝑉(𝑣, 𝑢, 𝑓)

Proof of Theorem swapf2fvala
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 swapfval.c . . . 4 (𝜑 → 𝐶 ∈ 𝑈)
2 swapfval.d . . . 4 (𝜑 → 𝐷 ∈ 𝑉)
3 swapf2fvala.s . . . 4 𝑆 = (𝐶 ×c 𝐷)
4 swapf2fvala.b . . . 4 𝐵 = (Base‘𝑆)
5 swapf2fvala.h . . . 4 (𝜑 → 𝐻 = (Hom ‘𝑆))
61, 2, 3, 4, 5swapfval 50339 . . 3 (𝜑 → (𝐶 swapF 𝐷) = ⟨(𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓}))⟩)
76fveq2d 6887 . 2 (𝜑 → (2nd ‘(𝐶 swapF 𝐷)) = (2nd ‘⟨(𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓}))⟩))
84fvexi 6897 . . . 4 𝐵 ∈ V
98mptex 7227 . . 3 (𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}) ∈ V
108, 8mpoex 8090 . . 3 (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓})) ∈ V
119, 10op2nd 8008 . 2 (2nd ‘⟨(𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓}))⟩) = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓}))
127, 11eqtrdi 2812 1 (𝜑 → (2nd ‘(𝐶 swapF 𝐷)) = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ ∪ ◡{𝑓})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {csn 4584  ⟨cop 4590  ∪ cuni 4867   ↦ cmpt 5186  ◡ccnv 5650  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  2nd c2nd 7998  Basecbs 17380  Hom chom 17432   ×c cxpc 18335   swapF 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
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 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-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 5546  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-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-1st 7999  df-2nd 8000  df-swapf 50337
This theorem is used by:  swapf2fval  50342
  Copyright terms: Public domain W3C validator