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

Theorem 2ndfval 17436
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 6676 . . . . . . 7 (Base‘𝑐) ∈ V
5 fvex 6676 . . . . . . 7 (Base‘𝑑) ∈ V
64, 5xpex 7468 . . . . . 6 ((Base‘𝑐) × (Base‘𝑑)) ∈ V
76a1i 11 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) ∈ V)
8 simpl 485 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑐 = 𝐶)
98fveq2d 6667 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑐) = (Base‘𝐶))
10 simpr 487 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑑 = 𝐷)
1110fveq2d 6667 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑑) = (Base‘𝐷))
129, 11xpeq12d 5579 . . . . . 6 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = ((Base‘𝐶) × (Base‘𝐷)))
13 1stfval.t . . . . . . . 8 𝑇 = (𝐶 ×c 𝐷)
14 eqid 2819 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
15 eqid 2819 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
1613, 14, 15xpcbas 17420 . . . . . . 7 ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
17 1stfval.b . . . . . . 7 𝐵 = (Base‘𝑇)
1816, 17eqtr4i 2845 . . . . . 6 ((Base‘𝐶) × (Base‘𝐷)) = 𝐵
1912, 18syl6eq 2870 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = 𝐵)
20 simpr 487 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
2120reseq2d 5846 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (2nd𝑏) = (2nd𝐵))
22 simpll 765 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑐 = 𝐶)
23 simplr 767 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑑 = 𝐷)
2422, 23oveq12d 7166 . . . . . . . . . . . 12 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = (𝐶 ×c 𝐷))
2524, 13syl6eqr 2872 . . . . . . . . . . 11 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = 𝑇)
2625fveq2d 6667 . . . . . . . . . 10 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = (Hom ‘𝑇))
27 1stfval.h . . . . . . . . . 10 𝐻 = (Hom ‘𝑇)
2826, 27syl6eqr 2872 . . . . . . . . 9 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = 𝐻)
2928oveqd 7165 . . . . . . . 8 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦) = (𝑥𝐻𝑦))
3029reseq2d 5846 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)) = (2nd ↾ (𝑥𝐻𝑦)))
3120, 20, 30mpoeq123dv 7221 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦))) = (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦))))
3221, 31opeq12d 4803 . . . . 5 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → ⟨(2nd𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
337, 19, 32csbied2 3918 . . . 4 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(2nd𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
34 df-2ndf 17416 . . . 4 2ndF = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(2nd𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩)
35 opex 5347 . . . 4 ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩ ∈ V
3633, 34, 35ovmpoa 7297 . . 3 ((𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 2ndF 𝐷) = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
372, 3, 36syl2anc 586 . 2 (𝜑 → (𝐶 2ndF 𝐷) = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
381, 37syl5eq 2866 1 (𝜑𝑄 = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1531  wcel 2108  Vcvv 3493  csb 3881  cop 4565   × cxp 5546  cres 5550  cfv 6348  (class class class)co 7148  cmpo 7150  2nd c2nd 7680  Basecbs 16475  Hom chom 16568  Catccat 16927   ×c cxpc 17410   2ndF c2ndf 17412
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453  ax-cnex 10585  ax-resscn 10586  ax-1cn 10587  ax-icn 10588  ax-addcl 10589  ax-addrcl 10590  ax-mulcl 10591  ax-mulrcl 10592  ax-mulcom 10593  ax-addass 10594  ax-mulass 10595  ax-distr 10596  ax-i2m1 10597  ax-1ne0 10598  ax-1rid 10599  ax-rnegex 10600  ax-rrecex 10601  ax-cnre 10602  ax-pre-lttri 10603  ax-pre-lttrn 10604  ax-pre-ltadd 10605  ax-pre-mulgt0 10606
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1534  df-fal 1544  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-nel 3122  df-ral 3141  df-rex 3142  df-reu 3143  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-om 7573  df-1st 7681  df-2nd 7682  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-er 8281  df-en 8502  df-dom 8503  df-sdom 8504  df-pnf 10669  df-mnf 10670  df-xr 10671  df-ltxr 10672  df-le 10673  df-sub 10864  df-neg 10865  df-nn 11631  df-2 11692  df-3 11693  df-4 11694  df-5 11695  df-6 11696  df-7 11697  df-8 11698  df-9 11699  df-n0 11890  df-z 11974  df-dec 12091  df-ndx 16478  df-slot 16479  df-base 16481  df-hom 16581  df-cco 16582  df-xpc 17414  df-2ndf 17416
This theorem is referenced by:  2ndf1  17437  2ndf2  17438  2ndfcl  17440
  Copyright terms: Public domain W3C validator