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

Theorem xpccofval 17434
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 2823 . . . 4 (Base‘𝐶) = (Base‘𝐶)
3 eqid 2823 . . . 4 (Base‘𝐷) = (Base‘𝐷)
4 eqid 2823 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
5 eqid 2823 . . . 4 (Hom ‘𝐷) = (Hom ‘𝐷)
6 xpccofval.o1 . . . 4 · = (comp‘𝐶)
7 xpccofval.o2 . . . 4 = (comp‘𝐷)
8 simpl 485 . . . 4 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐶 ∈ V)
9 simpr 487 . . . 4 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐷 ∈ V)
10 xpccofval.b . . . . . 6 𝐵 = (Base‘𝑇)
111, 2, 3xpcbas 17430 . . . . . 6 ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
1210, 11eqtr4i 2849 . . . . 5 𝐵 = ((Base‘𝐶) × (Base‘𝐷))
1312a1i 11 . . . 4 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ((Base‘𝐶) × (Base‘𝐷)))
14 xpccofval.k . . . . . 6 𝐾 = (Hom ‘𝑇)
151, 10, 4, 5, 14xpchomfval 17431 . . . . 5 𝐾 = (𝑢𝐵, 𝑣𝐵 ↦ (((1st𝑢)(Hom ‘𝐶)(1st𝑣)) × ((2nd𝑢)(Hom ‘𝐷)(2nd𝑣))))
1615a1i 11 . . . 4 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = (𝑢𝐵, 𝑣𝐵 ↦ (((1st𝑢)(Hom ‘𝐶)(1st𝑣)) × ((2nd𝑢)(Hom ‘𝐷)(2nd𝑣)))))
17 eqidd 2824 . . . 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 17429 . . 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 17229 . . 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 16692 . . 3 comp = Slot (comp‘ndx)
21 snsstp3 4753 . . 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 6686 . . . . . 6 𝐵 ∈ V
2322, 22xpex 7478 . . . . 5 (𝐵 × 𝐵) ∈ V
2423, 22mpoex 7779 . . . 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 16534 . 2 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)))
28 fnxpc 17428 . . . . . . . 8 ×c Fn (V × V)
29 fndm 6457 . . . . . . . 8 ( ×c Fn (V × V) → dom ×c = (V × V))
3028, 29ax-mp 5 . . . . . . 7 dom ×c = (V × V)
3130ndmov 7334 . . . . . 6 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐶 ×c 𝐷) = ∅)
321, 31syl5eq 2870 . . . . 5 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = ∅)
3332fveq2d 6676 . . . 4 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (comp‘𝑇) = (comp‘∅))
3420str0 16537 . . . 4 ∅ = (comp‘∅)
3533, 26, 343eqtr4g 2883 . . 3 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑂 = ∅)
3632fveq2d 6676 . . . . . 6 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Base‘𝑇) = (Base‘∅))
37 base0 16538 . . . . . 6 ∅ = (Base‘∅)
3836, 10, 373eqtr4g 2883 . . . . 5 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ∅)
3938olcd 870 . . . 4 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → ((𝐵 × 𝐵) = ∅ ∨ 𝐵 = ∅))
40 0mpo0 7239 . . . 4 (((𝐵 × 𝐵) = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)) = ∅)
4139, 40syl 17 . . 3 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)) = ∅)
4235, 41eqtr4d 2861 . 2 (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦𝐵 ↦ (𝑔 ∈ ((2nd𝑥)𝐾𝑦), 𝑓 ∈ (𝐾𝑥) ↦ ⟨((1st𝑔)(⟨(1st ‘(1st𝑥)), (1st ‘(2nd𝑥))⟩ · (1st𝑦))(1st𝑓)), ((2nd𝑔)(⟨(2nd ‘(1st𝑥)), (2nd ‘(2nd𝑥))⟩ (2nd𝑦))(2nd𝑓))⟩)))
4327, 42pm2.61i 184 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 398  wo 843   = wceq 1537  wcel 2114  Vcvv 3496  c0 4293  {ctp 4573  cop 4575   × cxp 5555  dom cdm 5557   Fn wfn 6352  cfv 6357  (class class class)co 7158  cmpo 7160  1st c1st 7689  2nd c2nd 7690  1c1 10540  5c5 11698  cdc 12101  ndxcnx 16482  Basecbs 16485  Hom chom 16578  compcco 16579   ×c cxpc 17420
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-oadd 8108  df-er 8291  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-3 11704  df-4 11705  df-5 11706  df-6 11707  df-7 11708  df-8 11709  df-9 11710  df-n0 11901  df-z 11985  df-dec 12102  df-uz 12247  df-fz 12896  df-struct 16487  df-ndx 16488  df-slot 16489  df-base 16491  df-hom 16591  df-cco 16592  df-xpc 17424
This theorem is referenced by:  xpcco  17435
  Copyright terms: Public domain W3C validator