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

Theorem 1stfval 18155
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 6847 . . . . . . 7 (Base‘𝑐) ∈ V
5 fvex 6847 . . . . . . 7 (Base‘𝑑) ∈ V
64, 5xpex 7703 . . . . . 6 ((Base‘𝑐) × (Base‘𝑑)) ∈ V
76a1i 11 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) ∈ V)
8 simpl 483 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑐 = 𝐶)
98fveq2d 6838 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑐) = (Base‘𝐶))
10 simpr 485 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑑 = 𝐷)
1110fveq2d 6838 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑑) = (Base‘𝐷))
129, 11xpeq12d 5656 . . . . . 6 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = ((Base‘𝐶) × (Base‘𝐷)))
13 1stfval.t . . . . . . . 8 𝑇 = (𝐶 ×c 𝐷)
14 eqid 2740 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
15 eqid 2740 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
1613, 14, 15xpcbas 18142 . . . . . . 7 ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
17 1stfval.b . . . . . . 7 𝐵 = (Base‘𝑇)
1816, 17eqtr4i 2766 . . . . . 6 ((Base‘𝐶) × (Base‘𝐷)) = 𝐵
1912, 18eqtrdi 2791 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = 𝐵)
20 simpr 485 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
2120reseq2d 5938 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (1st𝑏) = (1st𝐵))
22 simpll 772 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑐 = 𝐶)
23 simplr 774 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑑 = 𝐷)
2422, 23oveq12d 7381 . . . . . . . . . . . 12 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = (𝐶 ×c 𝐷))
2524, 13eqtr4di 2793 . . . . . . . . . . 11 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = 𝑇)
2625fveq2d 6838 . . . . . . . . . 10 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = (Hom ‘𝑇))
27 1stfval.h . . . . . . . . . 10 𝐻 = (Hom ‘𝑇)
2826, 27eqtr4di 2793 . . . . . . . . 9 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = 𝐻)
2928oveqd 7380 . . . . . . . 8 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦) = (𝑥𝐻𝑦))
3029reseq2d 5938 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)) = (1st ↾ (𝑥𝐻𝑦)))
3120, 20, 30mpoeq123dv 7438 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦))) = (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦))))
3221, 31opeq12d 4819 . . . . 5 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → ⟨(1st𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
337, 19, 32csbied2 3875 . . . 4 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(1st𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
34 df-1stf 18137 . . . 4 1stF = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(1st𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (1st ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩)
35 opex 5410 . . . 4 ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩ ∈ V
3633, 34, 35ovmpoa 7518 . . 3 ((𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 1stF 𝐷) = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
372, 3, 36syl2anc 590 . 2 (𝜑 → (𝐶 1stF 𝐷) = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
381, 37eqtrid 2787 1 (𝜑𝑃 = ⟨(1st𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (1st ↾ (𝑥𝐻𝑦)))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  Vcvv 3432  csb 3838  cop 4568   × cxp 5623  cres 5627  cfv 6492  (class class class)co 7363  cmpo 7365  1st c1st 7936  Basecbs 17177  Hom chom 17229  Catccat 17628   ×c cxpc 18132   1stF c1stf 18133
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685  ax-cnex 11092  ax-resscn 11093  ax-1cn 11094  ax-icn 11095  ax-addcl 11096  ax-addrcl 11097  ax-mulcl 11098  ax-mulrcl 11099  ax-mulcom 11100  ax-addass 11101  ax-mulass 11102  ax-distr 11103  ax-i2m1 11104  ax-1ne0 11105  ax-1rid 11106  ax-rnegex 11107  ax-rrecex 11108  ax-cnre 11109  ax-pre-lttri 11110  ax-pre-lttrn 11111  ax-pre-ltadd 11112  ax-pre-mulgt0 11113
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-nel 3040  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-tp 4567  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-om 7814  df-1st 7938  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-er 8640  df-en 8891  df-dom 8892  df-sdom 8893  df-pnf 11179  df-mnf 11180  df-xr 11181  df-ltxr 11182  df-le 11183  df-sub 11377  df-neg 11378  df-nn 12173  df-2 12242  df-3 12243  df-4 12244  df-5 12245  df-6 12246  df-7 12247  df-8 12248  df-9 12249  df-n0 12436  df-z 12523  df-dec 12643  df-slot 17150  df-ndx 17162  df-base 17178  df-hom 17242  df-cco 17243  df-xpc 18136  df-1stf 18137
This theorem is referenced by:  1stf1  18156  1stf2  18157  1stfcl  18161  oppc1stf  49785  1stfpropd  49787
  Copyright terms: Public domain W3C validator