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

Theorem 1stfpropd 50367
Description: If two categories have the same set of objects, morphisms, and compositions, then they have same first projection functors. (Contributed by Zhi Wang, 20-Nov-2025.)
Hypotheses
Ref Expression
1stfpropd.1 (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))
1stfpropd.2 (𝜑 → (compf‘𝐴) = (compf‘𝐵))
1stfpropd.3 (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
1stfpropd.4 (𝜑 → (compf‘𝐶) = (compf‘𝐷))
1stfpropd.a (𝜑 → 𝐴 ∈ Cat)
1stfpropd.b (𝜑 → 𝐵 ∈ Cat)
1stfpropd.c (𝜑 → 𝐶 ∈ Cat)
1stfpropd.d (𝜑 → 𝐷 ∈ Cat)
Assertion
Ref Expression
1stfpropd (𝜑 → (𝐴 1stF 𝐶) = (𝐵 1stF 𝐷))

Proof of Theorem 1stfpropd
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 1stfpropd.1 . . . . . 6 (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))
2 1stfpropd.2 . . . . . 6 (𝜑 → (compf‘𝐴) = (compf‘𝐵))
3 1stfpropd.3 . . . . . 6 (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
4 1stfpropd.4 . . . . . 6 (𝜑 → (compf‘𝐶) = (compf‘𝐷))
5 1stfpropd.a . . . . . 6 (𝜑 → 𝐴 ∈ Cat)
6 1stfpropd.b . . . . . 6 (𝜑 → 𝐵 ∈ Cat)
7 1stfpropd.c . . . . . 6 (𝜑 → 𝐶 ∈ Cat)
8 1stfpropd.d . . . . . 6 (𝜑 → 𝐷 ∈ Cat)
91, 2, 3, 4, 5, 6, 7, 8xpcpropd 18375 . . . . 5 (𝜑 → (𝐴 ×c 𝐶) = (𝐵 ×c 𝐷))
109fveq2d 6887 . . . 4 (𝜑 → (Base‘(𝐴 ×c 𝐶)) = (Base‘(𝐵 ×c 𝐷)))
1110reseq2d 5970 . . 3 (𝜑 → (1st ↾ (Base‘(𝐴 ×c 𝐶))) = (1st ↾ (Base‘(𝐵 ×c 𝐷))))
129fveq2d 6887 . . . . . 6 (𝜑 → (Hom ‘(𝐴 ×c 𝐶)) = (Hom ‘(𝐵 ×c 𝐷)))
1312oveqd 7435 . . . . 5 (𝜑 → (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦) = (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦))
1413reseq2d 5970 . . . 4 (𝜑 → (1st ↾ (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦)) = (1st ↾ (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦)))
1510, 10, 14mpoeq123dv 7493 . . 3 (𝜑 → (𝑥 ∈ (Base‘(𝐴 ×c 𝐶)), 𝑦 ∈ (Base‘(𝐴 ×c 𝐶)) ↦ (1st ↾ (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦))) = (𝑥 ∈ (Base‘(𝐵 ×c 𝐷)), 𝑦 ∈ (Base‘(𝐵 ×c 𝐷)) ↦ (1st ↾ (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦))))
1611, 15opeq12d 4841 . 2 (𝜑 → ⟨(1st ↾ (Base‘(𝐴 ×c 𝐶))), (𝑥 ∈ (Base‘(𝐴 ×c 𝐶)), 𝑦 ∈ (Base‘(𝐴 ×c 𝐶)) ↦ (1st ↾ (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦)))⟩ = ⟨(1st ↾ (Base‘(𝐵 ×c 𝐷))), (𝑥 ∈ (Base‘(𝐵 ×c 𝐷)), 𝑦 ∈ (Base‘(𝐵 ×c 𝐷)) ↦ (1st ↾ (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦)))⟩)
17 eqid 2761 . . 3 (𝐴 ×c 𝐶) = (𝐴 ×c 𝐶)
18 eqid 2761 . . 3 (Base‘(𝐴 ×c 𝐶)) = (Base‘(𝐴 ×c 𝐶))
19 eqid 2761 . . 3 (Hom ‘(𝐴 ×c 𝐶)) = (Hom ‘(𝐴 ×c 𝐶))
20 eqid 2761 . . 3 (𝐴 1stF 𝐶) = (𝐴 1stF 𝐶)
2117, 18, 19, 5, 7, 201stfval 18358 . 2 (𝜑 → (𝐴 1stF 𝐶) = ⟨(1st ↾ (Base‘(𝐴 ×c 𝐶))), (𝑥 ∈ (Base‘(𝐴 ×c 𝐶)), 𝑦 ∈ (Base‘(𝐴 ×c 𝐶)) ↦ (1st ↾ (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦)))⟩)
22 eqid 2761 . . 3 (𝐵 ×c 𝐷) = (𝐵 ×c 𝐷)
23 eqid 2761 . . 3 (Base‘(𝐵 ×c 𝐷)) = (Base‘(𝐵 ×c 𝐷))
24 eqid 2761 . . 3 (Hom ‘(𝐵 ×c 𝐷)) = (Hom ‘(𝐵 ×c 𝐷))
25 eqid 2761 . . 3 (𝐵 1stF 𝐷) = (𝐵 1stF 𝐷)
2622, 23, 24, 6, 8, 251stfval 18358 . 2 (𝜑 → (𝐵 1stF 𝐷) = ⟨(1st ↾ (Base‘(𝐵 ×c 𝐷))), (𝑥 ∈ (Base‘(𝐵 ×c 𝐷)), 𝑦 ∈ (Base‘(𝐵 ×c 𝐷)) ↦ (1st ↾ (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦)))⟩)
2716, 21, 263eqtr4d 2806 1 (𝜑 → (𝐴 1stF 𝐶) = (𝐵 1stF 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ⟨cop 4590   ↾ cres 5653  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  1st c1st 7997  Basecbs 17380  Hom chom 17432  Catccat 17831  Homf chomf 17833  compfccomf 17834   ×c cxpc 18335   1stF c1stf 18336
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 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3063  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-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  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-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-er 8710  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-2 12398  df-3 12399  df-4 12400  df-5 12401  df-6 12402  df-7 12403  df-8 12404  df-9 12405  df-n0 12600  df-z 12687  df-dec 12808  df-uz 12959  df-fz 13633  df-struct 17318  df-slot 17353  df-ndx 17365  df-base 17381  df-hom 17445  df-cco 17446  df-homf 17837  df-comf 17838  df-xpc 18339  df-1stf 18340
This theorem is used by:  diagpropd  50369
  Copyright terms: Public domain W3C validator