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

Theorem swapf1vala 50524
Description: The object part of the swap functor. See also swapf1val 50525. (Contributed by Zhi Wang, 7-Oct-2025.)
Hypotheses
Ref Expression
swapfval.c (𝜑 → 𝐶 ∈ 𝑈)
swapfval.d (𝜑 → 𝐷 ∈ 𝑉)
swapf2fvala.s 𝑆 = (𝐶 ×c 𝐷)
swapf2fvala.b 𝐵 = (Base‘𝑆)
Assertion
Ref Expression
swapf1vala (𝜑 → (1st ‘(𝐶 swapF 𝐷)) = (𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}))
Distinct variable group:   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥)   𝐶(𝑥)   𝐷(𝑥)   𝑆(𝑥)   𝑈(𝑥)   𝑉(𝑥)

Proof of Theorem swapf1vala
Dummy variables 𝑢 𝑣 𝑓 are mutually distinct and 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 eqidd 2761 . . . 4 (𝜑 → (Hom ‘𝑆) = (Hom ‘𝑆))
61, 2, 3, 4, 5swapfval 50520 . . 3 (𝜑 → (𝐶 swapF 𝐷) = ⟨(𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓}))⟩)
76fveq2d 6894 . 2 (𝜑 → (1st ‘(𝐶 swapF 𝐷)) = (1st ‘⟨(𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓}))⟩))
84fvexi 6904 . . . 4 𝐵 ∈ V
98mptex 7233 . . 3 (𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}) ∈ V
108, 8mpoex 8097 . . 3 (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓})) ∈ V
119, 10op1st 8013 . 2 (1st ‘⟨(𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓}))⟩) = (𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥})
127, 11eqtrdi 2811 1 (𝜑 → (1st ‘(𝐶 swapF 𝐷)) = (𝑥 ∈ 𝐵 ↦ ∪ ◡{𝑥}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {csn 4584  ⟨cop 4834  ∪ cuni 4866   ↦ cmpt 5185  ◡ccnv 5650  ‘cfv 6543  (class class class)co 7424   ∈ cmpo 7426  1st c1st 8003  Basecbs 17396  Hom chom 17448   ×c cxpc 18351   swapF cswapf 50517
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 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  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 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-1st 8005  df-2nd 8006  df-swapf 50518
This theorem is used by:  swapf1val  50525
  Copyright terms: Public domain W3C validator