MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xpccofval Structured version   Visualization version   GIF version

Theorem xpccofval 18090
Description: Value of composition in the binary product of categories. (Contributed by Mario Carneiro, 11-Jan-2017.) (Proof shortened by AV, 2-Mar-2024.)
Hypotheses
Ref Expression
xpccofval.t 𝑇 = (𝐶 ×c 𝐷)
xpccofval.b 𝐵 = (Base‘𝑇)
xpccofval.k 𝐾 = (Hom ‘𝑇)
xpccofval.o1 · = (comp‘𝐶)
xpccofval.o2 = (comp‘𝐷)
xpccofval.o 𝑂 = (comp‘𝑇)
Assertion
Ref Expression
xpccofval 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩))
Distinct variable groups:   𝑓,𝑔,𝑥,𝑦,𝐵   𝐶,𝑓,𝑔,𝑥,𝑦   𝐷,𝑓,𝑔,𝑥,𝑦   · ,𝑓,𝑔,𝑥,𝑦   ,𝑓,𝑔,𝑥,𝑦   𝑓,𝐾,𝑔,𝑥,𝑦   𝑥,𝑂,𝑦
Allowed substitution hints:   𝑇(𝑥,𝑦,𝑓,𝑔)   𝑂(𝑓,𝑔)

Proof of Theorem xpccofval
Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xpccofval.t . . . 4 𝑇 = (𝐶 ×c 𝐷)
2 eqid 2733 . . . 4 (Base‘𝐶) = (Base‘𝐶)
3 eqid 2733 . . . 4 (Base‘𝐷) = (Base‘𝐷)
4 eqid 2733 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
5 eqid 2733 . . . 4 (Hom ‘𝐷) = (Hom ‘𝐷)
6 xpccofval.o1 . . . 4 · = (comp‘𝐶)
7 xpccofval.o2 . . . 4 = (comp‘𝐷)
8 simpl 482 . . . 4 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐶 ∈ V)
9 simpr 484 . . . 4 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐷 ∈ V)
10 xpccofval.b . . . . . 6 𝐵 = (Base‘𝑇)
111, 2, 3xpcbas 18086 . . . . . 6 ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
1210, 11eqtr4i 2759 . . . . 5 𝐵 = ((Base‘𝐶) × (Base‘𝐷))
1312a1i 11 . . . 4 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ((Base‘𝐶) × (Base‘𝐷)))
14 xpccofval.k . . . . . 6 𝐾 = (Hom ‘𝑇)
151, 10, 4, 5, 14xpchomfval 18087 . . . . 5 𝐾 = (𝑢𝐵, 𝑣𝐵 ↦ (((1st𝑢)(Hom ‘𝐶)(1st𝑣)) × ((2nd𝑢)(Hom ‘𝐷)(2nd𝑣))))
1615a1i 11 . . . 4 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = (𝑢𝐵, 𝑣𝐵 ↦ (((1st𝑢)(Hom ‘𝐶)(1st𝑣)) × ((2nd𝑢)(Hom ‘𝐷)(2nd𝑣)))))
17 eqidd 2734 . . . 4 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)) = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)))
181, 2, 3, 4, 5, 6, 7, 8, 9, 13, 16, 17xpcval 18085 . . 3 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐾⟩, ⟨(comp‘ndx), (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩))⟩})
19 catstr 17869 . . 3 {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐾⟩, ⟨(comp‘ndx), (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩))⟩} Struct ⟨1, 15⟩
20 ccoid 17320 . . 3 comp = Slot (comp‘ndx)
21 snsstp3 4769 . . 3 {⟨(comp‘ndx), (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩))⟩} ⊆ {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), 𝐾⟩, ⟨(comp‘ndx), (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩))⟩}
2210fvexi 6842 . . . . . 6 𝐵 ∈ V
2322, 22xpex 7692 . . . . 5 (𝐵 × 𝐵) ∈ V
2423, 22mpoex 8017 . . . 4 (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)) ∈ V
2524a1i 11 . . 3 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)) ∈ V)
26 xpccofval.o . . 3 𝑂 = (comp‘𝑇)
2718, 19, 20, 21, 25, 26strfv3 17117 . 2 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)))
28 fnxpc 18084 . . . . . . . 8 ×c Fn (V × V)
2928fndmi 6590 . . . . . . 7 dom ×c = (V × V)
3029ndmov 7536 . . . . . 6 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐶 ×c 𝐷) = ∅)
311, 30eqtrid 2780 . . . . 5 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = ∅)
3231fveq2d 6832 . . . 4 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (comp‘𝑇) = (comp‘∅))
3320str0 17102 . . . 4 ∅ = (comp‘∅)
3432, 26, 333eqtr4g 2793 . . 3 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑂 = ∅)
3531fveq2d 6832 . . . . . 6 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Base‘𝑇) = (Base‘∅))
36 base0 17127 . . . . . 6 ∅ = (Base‘∅)
3735, 10, 363eqtr4g 2793 . . . . 5 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ∅)
3837olcd 874 . . . 4 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → ((𝐵 × 𝐵) = ∅ ∨ 𝐵 = ∅))
39 0mpo0 7435 . . . 4 (((𝐵 × 𝐵) = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)) = ∅)
4038, 39syl 17 . . 3 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)) = ∅)
4134, 40eqtr4d 2771 . 2 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)))
4227, 41pm2.61i 182 1 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 395  wo 847   = wceq 1541  wcel 2113  Vcvv 3437  c0 4282  {ctp 4579  cop 4581   × cxp 5617  cfv 6486  (class class class)co 7352  cmpo 7354  1st c1st 7925  2nd c2nd 7926  1c1 11014  5c5 12190  cdc 12594  ndxcnx 17106  Basecbs 17122  Hom chom 17174  compcco 17175   ×c cxpc 18076
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-cnex 11069  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-tp 4580  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-1o 8391  df-er 8628  df-en 8876  df-dom 8877  df-sdom 8878  df-fin 8879  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-nn 12133  df-2 12195  df-3 12196  df-4 12197  df-5 12198  df-6 12199  df-7 12200  df-8 12201  df-9 12202  df-n0 12389  df-z 12476  df-dec 12595  df-uz 12739  df-fz 13410  df-struct 17060  df-slot 17095  df-ndx 17107  df-base 17123  df-hom 17187  df-cco 17188  df-xpc 18080
This theorem is referenced by:  xpcco  18091
  Copyright terms: Public domain W3C validator