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

Theorem swapf2fn 50375
Description: The morphism part of the swap functor is a function on the Cartesian square of the base set. (Contributed by Zhi Wang, 7-Oct-2025.)
Hypotheses
Ref Expression
swapfval.c (𝜑 → 𝐶 ∈ 𝑈)
swapfval.d (𝜑 → 𝐷 ∈ 𝑉)
swapf2fvala.s 𝑆 = (𝐶 ×c 𝐷)
swapf2fvala.b 𝐵 = (Base‘𝑆)
swapf1val.o (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
Assertion
Ref Expression
swapf2fn (𝜑 → 𝑃 Fn (𝐵 × 𝐵))

Proof of Theorem swapf2fn
Dummy variables 𝑢 𝑣 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2761 . . 3 (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓})) = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓}))
2 ovex 7453 . . . 4 (𝑢(Hom ‘𝑆)𝑣) ∈ V
32mptex 7229 . . 3 (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓}) ∈ V
41, 3fnmpoi 8081 . 2 (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓})) Fn (𝐵 × 𝐵)
5 swapfval.c . . . 4 (𝜑 → 𝐶 ∈ 𝑈)
6 swapfval.d . . . 4 (𝜑 → 𝐷 ∈ 𝑉)
7 swapf2fvala.s . . . 4 𝑆 = (𝐶 ×c 𝐷)
8 swapf2fvala.b . . . 4 𝐵 = (Base‘𝑆)
9 eqidd 2762 . . . 4 (𝜑 → (Hom ‘𝑆) = (Hom ‘𝑆))
10 swapf1val.o . . . 4 (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
115, 6, 7, 8, 9, 10swapf2fval 50372 . . 3 (𝜑 → 𝑃 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓})))
1211fneq1d 6632 . 2 (𝜑 → (𝑃 Fn (𝐵 × 𝐵) ↔ (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (𝑓 ∈ (𝑢(Hom ‘𝑆)𝑣) ↦ ∪ ◡{𝑓})) Fn (𝐵 × 𝐵)))
134, 12mpbiri 261 1 (𝜑 → 𝑃 Fn (𝐵 × 𝐵))
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   × cxp 5649  ◡ccnv 5650   Fn wfn 6533  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  Basecbs 17387  Hom chom 17439   ×c cxpc 18342   swapF cswapf 50366
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 7751
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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-swapf 50367
This theorem is used by:  swapffunc  50389
  Copyright terms: Public domain W3C validator