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

Theorem 2ndfval 18160
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)
2ndfval.p 𝑄 = (𝐶 2ndF 𝐷)
Assertion
Ref Expression
2ndfval (𝜑𝑄 = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝑥,𝐻,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝑄(𝑥,𝑦)   𝑇(𝑥,𝑦)

Proof of Theorem 2ndfval
Dummy variables 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 2ndfval.p . 2 𝑄 = (𝐶 2ndF 𝐷)
2 1stfval.c . . 3 (𝜑𝐶 ∈ Cat)
3 1stfval.d . . 3 (𝜑𝐷 ∈ Cat)
4 fvex 6853 . . . . . . 7 (Base‘𝑐) ∈ V
5 fvex 6853 . . . . . . 7 (Base‘𝑑) ∈ V
64, 5xpex 7707 . . . . . 6 ((Base‘𝑐) × (Base‘𝑑)) ∈ V
76a1i 11 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) ∈ V)
8 simpl 482 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑐 = 𝐶)
98fveq2d 6844 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑐) = (Base‘𝐶))
10 simpr 484 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑑 = 𝐷)
1110fveq2d 6844 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑑) = (Base‘𝐷))
129, 11xpeq12d 5662 . . . . . 6 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = ((Base‘𝐶) × (Base‘𝐷)))
13 1stfval.t . . . . . . . 8 𝑇 = (𝐶 ×c 𝐷)
14 eqid 2736 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
15 eqid 2736 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
1613, 14, 15xpcbas 18144 . . . . . . 7 ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
17 1stfval.b . . . . . . 7 𝐵 = (Base‘𝑇)
1816, 17eqtr4i 2762 . . . . . 6 ((Base‘𝐶) × (Base‘𝐷)) = 𝐵
1912, 18eqtrdi 2787 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = 𝐵)
20 simpr 484 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
2120reseq2d 5944 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (2nd𝑏) = (2nd𝐵))
22 simpll 767 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑐 = 𝐶)
23 simplr 769 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑑 = 𝐷)
2422, 23oveq12d 7385 . . . . . . . . . . . 12 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = (𝐶 ×c 𝐷))
2524, 13eqtr4di 2789 . . . . . . . . . . 11 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = 𝑇)
2625fveq2d 6844 . . . . . . . . . 10 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = (Hom ‘𝑇))
27 1stfval.h . . . . . . . . . 10 𝐻 = (Hom ‘𝑇)
2826, 27eqtr4di 2789 . . . . . . . . 9 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = 𝐻)
2928oveqd 7384 . . . . . . . 8 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦) = (𝑥𝐻𝑦))
3029reseq2d 5944 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)) = (2nd ↾ (𝑥𝐻𝑦)))
3120, 20, 30mpoeq123dv 7442 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦))) = (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦))))
3221, 31opeq12d 4824 . . . . 5 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → ⟨(2nd𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
337, 19, 32csbied2 3874 . . . 4 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(2nd𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
34 df-2ndf 18140 . . . 4 2ndF = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(2nd𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩)
35 opex 5416 . . . 4 ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩ ∈ V
3633, 34, 35ovmpoa 7522 . . 3 ((𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 2ndF 𝐷) = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
372, 3, 36syl2anc 585 . 2 (𝜑 → (𝐶 2ndF 𝐷) = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
381, 37eqtrid 2783 1 (𝜑𝑄 = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3429  csb 3837  cop 4573   × cxp 5629  cres 5633  cfv 6498  (class class class)co 7367  cmpo 7369  2nd c2nd 7941  Basecbs 17179  Hom chom 17231  Catccat 17630   ×c cxpc 18134   2ndF c2ndf 18136
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-3 12245  df-4 12246  df-5 12247  df-6 12248  df-7 12249  df-8 12250  df-9 12251  df-n0 12438  df-z 12525  df-dec 12645  df-slot 17152  df-ndx 17164  df-base 17180  df-hom 17244  df-cco 17245  df-xpc 18138  df-2ndf 18140
This theorem is referenced by:  2ndf1  18161  2ndf2  18162  2ndfcl  18164  oppc2ndf  49764  2ndfpropd  49766
  Copyright terms: Public domain W3C validator