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

Theorem swapf2fval 50100
Description: The morphism part of the swap functor. See also swapf2fvala 50099. (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
StepHypRef Expression
1 swapf2fval.o . . 3 (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
21fveq2d 6889 . 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 ‘𝑆))
83, 4, 5, 6, 7swapf2fvala 50099 . 2 (𝜑 → (2nd ‘(𝐶 swapF 𝐷)) = (𝑢𝐵, 𝑣𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ {𝑓})))
93, 4swapfelvv 50098 . . . 4 (𝜑 → (𝐶 swapF 𝐷) ∈ (V × V))
101, 9eqeltrrd 2866 . . 3 (𝜑 → ⟨𝑂, 𝑃⟩ ∈ (V × V))
11 opelxp 5699 . . . 4 (⟨𝑂, 𝑃⟩ ∈ (V × V) ↔ (𝑂 ∈ V ∧ 𝑃 ∈ V))
1211biimpi 219 . . 3 (⟨𝑂, 𝑃⟩ ∈ (V × V) → (𝑂 ∈ V ∧ 𝑃 ∈ V))
13 op2ndg 8005 . . 3 ((𝑂 ∈ V ∧ 𝑃 ∈ V) → (2nd ‘⟨𝑂, 𝑃⟩) = 𝑃)
1410, 12, 133syl 19 . 2 (𝜑 → (2nd ‘⟨𝑂, 𝑃⟩) = 𝑃)
152, 8, 143eqtr3rd 2809 1 (𝜑𝑃 = (𝑢𝐵, 𝑣𝐵 ↦ (𝑓 ∈ (𝑢𝐻𝑣) ↦ {𝑓})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  Vcvv 3457  {csn 4591  cop 4597   cuni 4874  cmpt 5194   × cxp 5661  ccnv 5662  cfv 6540  (class class class)co 7419  cmpo 7421  2nd c2nd 7991  Basecbs 17291  Hom chom 17343   ×c cxpc 18246   swapF cswapf 50094
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 7742
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 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-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  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-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 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-swapf 50095
This theorem is used by:  swapf2fn  50103  swapf2vala  50105
  Copyright terms: Public domain W3C validator