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

Theorem cidval 17892
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 17891 . 2 (𝜑 → 1 = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
7 simpr 490 . . . 4 ((𝜑 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
87, 7oveq12d 7467 . . 3 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑥𝐻𝑥) = (𝑋𝐻𝑋))
97oveq2d 7465 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑦𝐻𝑥) = (𝑦𝐻𝑋))
107opeq2d 4850 . . . . . . . . 9 ((𝜑 ∧ 𝑥 = 𝑋) → ⟨𝑦, 𝑥⟩ = ⟨𝑦, 𝑋⟩)
1110, 7oveq12d 7467 . . . . . . . 8 ((𝜑 ∧ 𝑥 = 𝑋) → (⟨𝑦, 𝑥⟩ · 𝑥) = (⟨𝑦, 𝑋⟩ · 𝑋))
1211oveqd 7466 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = (𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓))
1312eqeq1d 2765 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → ((𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ↔ (𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓))
149, 13raleqbidv 3338 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓))
157oveq1d 7464 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
167, 7opeq12d 4851 . . . . . . . . 9 ((𝜑 ∧ 𝑥 = 𝑋) → ⟨𝑥, 𝑥⟩ = ⟨𝑋, 𝑋⟩)
1716oveq1d 7464 . . . . . . . 8 ((𝜑 ∧ 𝑥 = 𝑋) → (⟨𝑥, 𝑥⟩ · 𝑦) = (⟨𝑋, 𝑋⟩ · 𝑦))
1817oveqd 7466 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔))
1918eqeq1d 2765 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → ((𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
2015, 19raleqbidv 3338 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
2114, 20anbi12d 644 . . . 4 ((𝜑 ∧ 𝑥 = 𝑋) → ((∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓) ↔ (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
2221ralbidv 3189 . . 3 ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓) ↔ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
238, 22riotaeqbidv 7409 . 2 ((𝜑 ∧ 𝑥 = 𝑋) → (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓)) = (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
24 cidval.x . 2 (𝜑 → 𝑋 ∈ 𝐵)
25 riotaex 7410 . . 3 (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ V
2625a1i 11 . 2 (𝜑 → (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ V)
276, 23, 24, 26fvmptd 7030 1 (𝜑 → ( 1 ‘𝑋) = (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454  ⟨cop 4838  ‘cfv 6564  ℩crio 7405  (class class class)co 7449  Basecbs 17428  Hom chom 17480  compcco 17481  Catccat 17879  Idccid 17880
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-riota 7406  df-ov 7452  df-cid 17884
This theorem is used by:  catidcl  17897  catlid  17898  catrid  17899
  Copyright terms: Public domain W3C validator