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

Theorem cidfval 16950
Description: Each object in a category has an associated identity arrow. (Contributed by Mario Carneiro, 3-Jan-2017.)
Hypotheses
Ref Expression
cidfval.b 𝐵 = (Base‘𝐶)
cidfval.h 𝐻 = (Hom ‘𝐶)
cidfval.o · = (comp‘𝐶)
cidfval.c (𝜑𝐶 ∈ Cat)
cidfval.i 1 = (Id‘𝐶)
Assertion
Ref Expression
cidfval (𝜑1 = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))))
Distinct variable groups:   𝑓,𝑔,𝑥,𝑦,𝐵   𝐶,𝑓,𝑔,𝑥,𝑦   · ,𝑓,𝑔,𝑥,𝑦   𝑓,𝐻,𝑔,𝑥,𝑦   𝜑,𝑓,𝑔,𝑥,𝑦
Allowed substitution hints:   1 (𝑥,𝑦,𝑓,𝑔)

Proof of Theorem cidfval
Dummy variables 𝑏 𝑐 𝑜 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cidfval.i . 2 1 = (Id‘𝐶)
2 cidfval.c . . 3 (𝜑𝐶 ∈ Cat)
3 fvexd 6688 . . . . 5 (𝑐 = 𝐶 → (Base‘𝑐) ∈ V)
4 fveq2 6673 . . . . . 6 (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
5 cidfval.b . . . . . 6 𝐵 = (Base‘𝐶)
64, 5syl6eqr 2877 . . . . 5 (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵)
7 fvexd 6688 . . . . . 6 ((𝑐 = 𝐶𝑏 = 𝐵) → (Hom ‘𝑐) ∈ V)
8 simpl 485 . . . . . . . 8 ((𝑐 = 𝐶𝑏 = 𝐵) → 𝑐 = 𝐶)
98fveq2d 6677 . . . . . . 7 ((𝑐 = 𝐶𝑏 = 𝐵) → (Hom ‘𝑐) = (Hom ‘𝐶))
10 cidfval.h . . . . . . 7 𝐻 = (Hom ‘𝐶)
119, 10syl6eqr 2877 . . . . . 6 ((𝑐 = 𝐶𝑏 = 𝐵) → (Hom ‘𝑐) = 𝐻)
12 fvexd 6688 . . . . . . 7 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (comp‘𝑐) ∈ V)
13 simpll 765 . . . . . . . . 9 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → 𝑐 = 𝐶)
1413fveq2d 6677 . . . . . . . 8 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (comp‘𝑐) = (comp‘𝐶))
15 cidfval.o . . . . . . . 8 · = (comp‘𝐶)
1614, 15syl6eqr 2877 . . . . . . 7 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (comp‘𝑐) = · )
17 simpllr 774 . . . . . . . 8 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → 𝑏 = 𝐵)
18 simplr 767 . . . . . . . . . 10 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → = 𝐻)
1918oveqd 7176 . . . . . . . . 9 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (𝑥𝑥) = (𝑥𝐻𝑥))
2018oveqd 7176 . . . . . . . . . . . 12 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (𝑦𝑥) = (𝑦𝐻𝑥))
21 simpr 487 . . . . . . . . . . . . . . 15 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → 𝑜 = · )
2221oveqd 7176 . . . . . . . . . . . . . 14 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (⟨𝑦, 𝑥𝑜𝑥) = (⟨𝑦, 𝑥· 𝑥))
2322oveqd 7176 . . . . . . . . . . . . 13 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = (𝑔(⟨𝑦, 𝑥· 𝑥)𝑓))
2423eqeq1d 2826 . . . . . . . . . . . 12 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → ((𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ↔ (𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓))
2520, 24raleqbidv 3404 . . . . . . . . . . 11 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (∀𝑓 ∈ (𝑦𝑥)(𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓))
2618oveqd 7176 . . . . . . . . . . . 12 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (𝑥𝑦) = (𝑥𝐻𝑦))
2721oveqd 7176 . . . . . . . . . . . . . 14 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (⟨𝑥, 𝑥𝑜𝑦) = (⟨𝑥, 𝑥· 𝑦))
2827oveqd 7176 . . . . . . . . . . . . 13 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = (𝑓(⟨𝑥, 𝑥· 𝑦)𝑔))
2928eqeq1d 2826 . . . . . . . . . . . 12 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → ((𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))
3026, 29raleqbidv 3404 . . . . . . . . . . 11 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (∀𝑓 ∈ (𝑥𝑦)(𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓 ↔ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))
3125, 30anbi12d 632 . . . . . . . . . 10 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → ((∀𝑓 ∈ (𝑦𝑥)(𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝑦)(𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓) ↔ (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓)))
3217, 31raleqbidv 3404 . . . . . . . . 9 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (∀𝑦𝑏 (∀𝑓 ∈ (𝑦𝑥)(𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝑦)(𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓) ↔ ∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓)))
3319, 32riotaeqbidv 7120 . . . . . . . 8 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (𝑔 ∈ (𝑥𝑥)∀𝑦𝑏 (∀𝑓 ∈ (𝑦𝑥)(𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝑦)(𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓)) = (𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓)))
3417, 33mpteq12dv 5154 . . . . . . 7 ((((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) ∧ 𝑜 = · ) → (𝑥𝑏 ↦ (𝑔 ∈ (𝑥𝑥)∀𝑦𝑏 (∀𝑓 ∈ (𝑦𝑥)(𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝑦)(𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓))) = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))))
3512, 16, 34csbied2 3923 . . . . . 6 (((𝑐 = 𝐶𝑏 = 𝐵) ∧ = 𝐻) → (comp‘𝑐) / 𝑜(𝑥𝑏 ↦ (𝑔 ∈ (𝑥𝑥)∀𝑦𝑏 (∀𝑓 ∈ (𝑦𝑥)(𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝑦)(𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓))) = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))))
367, 11, 35csbied2 3923 . . . . 5 ((𝑐 = 𝐶𝑏 = 𝐵) → (Hom ‘𝑐) / (comp‘𝑐) / 𝑜(𝑥𝑏 ↦ (𝑔 ∈ (𝑥𝑥)∀𝑦𝑏 (∀𝑓 ∈ (𝑦𝑥)(𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝑦)(𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓))) = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))))
373, 6, 36csbied2 3923 . . . 4 (𝑐 = 𝐶(Base‘𝑐) / 𝑏(Hom ‘𝑐) / (comp‘𝑐) / 𝑜(𝑥𝑏 ↦ (𝑔 ∈ (𝑥𝑥)∀𝑦𝑏 (∀𝑓 ∈ (𝑦𝑥)(𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝑦)(𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓))) = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))))
38 df-cid 16943 . . . 4 Id = (𝑐 ∈ Cat ↦ (Base‘𝑐) / 𝑏(Hom ‘𝑐) / (comp‘𝑐) / 𝑜(𝑥𝑏 ↦ (𝑔 ∈ (𝑥𝑥)∀𝑦𝑏 (∀𝑓 ∈ (𝑦𝑥)(𝑔(⟨𝑦, 𝑥𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝑦)(𝑓(⟨𝑥, 𝑥𝑜𝑦)𝑔) = 𝑓))))
3937, 38, 5mptfvmpt 6993 . . 3 (𝐶 ∈ Cat → (Id‘𝐶) = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))))
402, 39syl 17 . 2 (𝜑 → (Id‘𝐶) = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))))
411, 40syl5eq 2871 1 (𝜑1 = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1536  wcel 2113  wral 3141  Vcvv 3497  csb 3886  cop 4576  cmpt 5149  cfv 6358  crio 7116  (class class class)co 7159  Basecbs 16486  Hom chom 16579  compcco 16580  Catccat 16938  Idccid 16939
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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pr 5333
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-riota 7117  df-ov 7162  df-cid 16943
This theorem is referenced by:  cidval  16951  cidfn  16953  catidd  16954  cidpropd  16983
  Copyright terms: Public domain W3C validator