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

Theorem 1stfval 18203
Description: Value of the first projection functor. (Contributed by Mario Carneiro, 11-Jan-2017.)
Hypotheses
Ref Expression
1stfval.t 𝑇 = (𝐶 ×c 𝐷)
1stfval.b 𝐵 = (Base‘𝑇)
1stfval.h 𝐻 = (Hom ‘𝑇)
1stfval.c (𝜑𝐶 ∈ Cat)
1stfval.d (𝜑𝐷 ∈ Cat)
1stfval.p 𝑃 = (𝐶 1stF 𝐷)
Assertion
Ref Expression
1stfval (𝜑𝑃 = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝑥,𝐻,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝑃(𝑥,𝑦)   𝑇(𝑥,𝑦)

Proof of Theorem 1stfval
Dummy variables 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 1stfval.p . 2 𝑃 = (𝐶 1stF 𝐷)
2 1stfval.c . . 3 (𝜑𝐶 ∈ Cat)
3 1stfval.d . . 3 (𝜑𝐷 ∈ Cat)
4 fvex 6889 . . . . . . 7 (Base‘𝑐) ∈ V
5 fvex 6889 . . . . . . 7 (Base‘𝑑) ∈ V
64, 5xpex 7747 . . . . . 6 ((Base‘𝑐) × (Base‘𝑑)) ∈ V
76a1i 11 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) ∈ V)
8 simpl 482 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑐 = 𝐶)
98fveq2d 6880 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑐) = (Base‘𝐶))
10 simpr 484 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑑 = 𝐷)
1110fveq2d 6880 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑑) = (Base‘𝐷))
129, 11xpeq12d 5685 . . . . . 6 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = ((Base‘𝐶) × (Base‘𝐷)))
13 1stfval.t . . . . . . . 8 𝑇 = (𝐶 ×c 𝐷)
14 eqid 2735 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
15 eqid 2735 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
1613, 14, 15xpcbas 18190 . . . . . . 7 ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
17 1stfval.b . . . . . . 7 𝐵 = (Base‘𝑇)
1816, 17eqtr4i 2761 . . . . . 6 ((Base‘𝐶) × (Base‘𝐷)) = 𝐵
1912, 18eqtrdi 2786 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = 𝐵)
20 simpr 484 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
2120reseq2d 5966 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (1st𝑏) = (1st𝐵))
22 simpll 766 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑐 = 𝐶)
23 simplr 768 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑑 = 𝐷)
2422, 23oveq12d 7423 . . . . . . . . . . . 12 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = (𝐶 ×c 𝐷))
2524, 13eqtr4di 2788 . . . . . . . . . . 11 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = 𝑇)
2625fveq2d 6880 . . . . . . . . . 10 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = (Hom ‘𝑇))
27 1stfval.h . . . . . . . . . 10 𝐻 = (Hom ‘𝑇)
2826, 27eqtr4di 2788 . . . . . . . . 9 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = 𝐻)
2928oveqd 7422 . . . . . . . 8 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦) = (𝑥𝐻𝑦))
3029reseq2d 5966 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)) = (1st ↾ (𝑥𝐻𝑦)))
3120, 20, 30mpoeq123dv 7482 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦))) = (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦))))
3221, 31opeq12d 4857 . . . . 5 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → ⟨(1st𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
337, 19, 32csbied2 3911 . . . 4 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(1st𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
34 df-1stf 18185 . . . 4 1stF = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(1st𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩)
35 opex 5439 . . . 4 ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩ ∈ V
3633, 34, 35ovmpoa 7562 . . 3 ((𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 1stF 𝐷) = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
372, 3, 36syl2anc 584 . 2 (𝜑 → (𝐶 1stF 𝐷) = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
381, 37eqtrid 2782 1 (𝜑𝑃 = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  Vcvv 3459  csb 3874  cop 4607   × cxp 5652  cres 5656  cfv 6531  (class class class)co 7405  cmpo 7407  1st c1st 7986  Basecbs 17228  Hom chom 17282  Catccat 17676   ×c cxpc 18180   1stF c1stf 18181
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-tp 4606  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7862  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-er 8719  df-en 8960  df-dom 8961  df-sdom 8962  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-nn 12241  df-2 12303  df-3 12304  df-4 12305  df-5 12306  df-6 12307  df-7 12308  df-8 12309  df-9 12310  df-n0 12502  df-z 12589  df-dec 12709  df-slot 17201  df-ndx 17213  df-base 17229  df-hom 17295  df-cco 17296  df-xpc 18184  df-1stf 18185
This theorem is referenced by:  1stf1  18204  1stf2  18205  1stfcl  18209
  Copyright terms: Public domain W3C validator