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

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

Proof of Theorem cidval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 cidfval.b . . 3 𝐵 = (Base‘𝐶)
2 cidfval.h . . 3 𝐻 = (Hom ‘𝐶)
3 cidfval.o . . 3 · = (comp‘𝐶)
4 cidfval.c . . 3 (𝜑 → 𝐶 ∈ Cat)
5 cidfval.i . . 3 1 = (Id‘𝐶)
61, 2, 3, 4, 5cidfval 17856 . 2 (𝜑 → 1 = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
7 simpr 490 . . . 4 ((𝜑 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
87, 7oveq12d 7439 . . 3 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑥𝐻𝑥) = (𝑋𝐻𝑋))
97oveq2d 7437 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑦𝐻𝑥) = (𝑦𝐻𝑋))
107opeq2d 4846 . . . . . . . . 9 ((𝜑 ∧ 𝑥 = 𝑋) → ⟨𝑦, 𝑥⟩ = ⟨𝑦, 𝑋⟩)
1110, 7oveq12d 7439 . . . . . . . 8 ((𝜑 ∧ 𝑥 = 𝑋) → (⟨𝑦, 𝑥⟩ · 𝑥) = (⟨𝑦, 𝑋⟩ · 𝑋))
1211oveqd 7438 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = (𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓))
1312eqeq1d 2762 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → ((𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ↔ (𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓))
149, 13raleqbidv 3334 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓))
157oveq1d 7436 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
167, 7opeq12d 4847 . . . . . . . . 9 ((𝜑 ∧ 𝑥 = 𝑋) → ⟨𝑥, 𝑥⟩ = ⟨𝑋, 𝑋⟩)
1716oveq1d 7436 . . . . . . . 8 ((𝜑 ∧ 𝑥 = 𝑋) → (⟨𝑥, 𝑥⟩ · 𝑦) = (⟨𝑋, 𝑋⟩ · 𝑦))
1817oveqd 7438 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔))
1918eqeq1d 2762 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → ((𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
2015, 19raleqbidv 3334 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
2114, 20anbi12d 644 . . . 4 ((𝜑 ∧ 𝑥 = 𝑋) → ((∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓) ↔ (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
2221ralbidv 3185 . . 3 ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓) ↔ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
238, 22riotaeqbidv 7381 . 2 ((𝜑 ∧ 𝑥 = 𝑋) → (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓)) = (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
24 cidval.x . 2 (𝜑 → 𝑋 ∈ 𝐵)
25 riotaex 7382 . . 3 (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ V
2625a1i 11 . 2 (𝜑 → (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ V)
276, 23, 24, 26fvmptd 7002 1 (𝜑 → ( 1 ‘𝑋) = (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  Vcvv 3450  ⟨cop 4834  ‘cfv 6539  ℩crio 7377  (class class class)co 7421  Basecbs 17393  Hom chom 17445  compcco 17446  Catccat 17844  Idccid 17845
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-cid 17849
This theorem is used by:  catidcl  17862  catlid  17863  catrid  17864
  Copyright terms: Public domain W3C validator