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

Theorem 2ndfval 18102
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 6841 . . . . . . 7 (Base‘𝑐) ∈ V
5 fvex 6841 . . . . . . 7 (Base‘𝑑) ∈ V
64, 5xpex 7692 . . . . . 6 ((Base‘𝑐) × (Base‘𝑑)) ∈ V
76a1i 11 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) ∈ V)
8 simpl 482 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑐 = 𝐶)
98fveq2d 6832 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑐) = (Base‘𝐶))
10 simpr 484 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑑 = 𝐷)
1110fveq2d 6832 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑑) = (Base‘𝐷))
129, 11xpeq12d 5650 . . . . . 6 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = ((Base‘𝐶) × (Base‘𝐷)))
13 1stfval.t . . . . . . . 8 𝑇 = (𝐶 ×c 𝐷)
14 eqid 2733 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
15 eqid 2733 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
1613, 14, 15xpcbas 18086 . . . . . . 7 ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
17 1stfval.b . . . . . . 7 𝐵 = (Base‘𝑇)
1816, 17eqtr4i 2759 . . . . . 6 ((Base‘𝐶) × (Base‘𝐷)) = 𝐵
1912, 18eqtrdi 2784 . . . . 5 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) = 𝐵)
20 simpr 484 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
2120reseq2d 5932 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (2nd𝑏) = (2nd𝐵))
22 simpll 766 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑐 = 𝐶)
23 simplr 768 . . . . . . . . . . . . 13 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → 𝑑 = 𝐷)
2422, 23oveq12d 7370 . . . . . . . . . . . 12 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = (𝐶 ×c 𝐷))
2524, 13eqtr4di 2786 . . . . . . . . . . 11 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑐 ×c 𝑑) = 𝑇)
2625fveq2d 6832 . . . . . . . . . 10 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = (Hom ‘𝑇))
27 1stfval.h . . . . . . . . . 10 𝐻 = (Hom ‘𝑇)
2826, 27eqtr4di 2786 . . . . . . . . 9 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (Hom ‘(𝑐 ×c 𝑑)) = 𝐻)
2928oveqd 7369 . . . . . . . 8 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦) = (𝑥𝐻𝑦))
3029reseq2d 5932 . . . . . . 7 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)) = (2nd ↾ (𝑥𝐻𝑦)))
3120, 20, 30mpoeq123dv 7427 . . . . . 6 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦))) = (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦))))
3221, 31opeq12d 4832 . . . . 5 (((𝑐 = 𝐶𝑑 = 𝐷) ∧ 𝑏 = 𝐵) → ⟨(2nd𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
337, 19, 32csbied2 3883 . . . 4 ((𝑐 = 𝐶𝑑 = 𝐷) → ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(2nd𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩ = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
34 df-2ndf 18082 . . . 4 2ndF = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ ((Base‘𝑐) × (Base‘𝑑)) / 𝑏⟨(2nd𝑏), (𝑥𝑏, 𝑦𝑏 ↦ (2nd ↾ (𝑥(Hom ‘(𝑐 ×c 𝑑))𝑦)))⟩)
35 opex 5407 . . . 4 ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩ ∈ V
3633, 34, 35ovmpoa 7507 . . 3 ((𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 2ndF 𝐷) = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
372, 3, 36syl2anc 584 . 2 (𝜑 → (𝐶 2ndF 𝐷) = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
381, 37eqtrid 2780 1 (𝜑𝑄 = ⟨(2nd𝐵), (𝑥𝐵, 𝑦𝐵 ↦ (2nd ↾ (𝑥𝐻𝑦)))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  Vcvv 3437  csb 3846  cop 4581   × cxp 5617  cres 5621  cfv 6486  (class class class)co 7352  cmpo 7354  2nd c2nd 7926  Basecbs 17122  Hom chom 17174  Catccat 17572   ×c cxpc 18076   2ndF c2ndf 18078
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-cnex 11069  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-tp 4580  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-er 8628  df-en 8876  df-dom 8877  df-sdom 8878  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-nn 12133  df-2 12195  df-3 12196  df-4 12197  df-5 12198  df-6 12199  df-7 12200  df-8 12201  df-9 12202  df-n0 12389  df-z 12476  df-dec 12595  df-slot 17095  df-ndx 17107  df-base 17123  df-hom 17187  df-cco 17188  df-xpc 18080  df-2ndf 18082
This theorem is referenced by:  2ndf1  18103  2ndf2  18104  2ndfcl  18106  oppc2ndf  49414  2ndfpropd  49416
  Copyright terms: Public domain W3C validator