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

Theorem catideu 16689
Description: Each object in a category has a unique identity arrow. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
catidex.b 𝐵 = (Base‘𝐶)
catidex.h 𝐻 = (Hom ‘𝐶)
catidex.o · = (comp‘𝐶)
catidex.c (𝜑𝐶 ∈ Cat)
catidex.x (𝜑𝑋𝐵)
Assertion
Ref Expression
catideu (𝜑 → ∃!𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓))
Distinct variable groups:   𝑓,𝑔,𝑦,𝐵   𝐶,𝑓,𝑔,𝑦   𝜑,𝑔   𝑓,𝑋,𝑔,𝑦   𝑓,𝐻,𝑔,𝑦   · ,𝑓,𝑔,𝑦
Allowed substitution hints:   𝜑(𝑦,𝑓)

Proof of Theorem catideu
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 catidex.b . . 3 𝐵 = (Base‘𝐶)
2 catidex.h . . 3 𝐻 = (Hom ‘𝐶)
3 catidex.o . . 3 · = (comp‘𝐶)
4 catidex.c . . 3 (𝜑𝐶 ∈ Cat)
5 catidex.x . . 3 (𝜑𝑋𝐵)
61, 2, 3, 4, 5catidex 16688 . 2 (𝜑 → ∃𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓))
7 oveq1 6913 . . . . . . . 8 (𝑦 = 𝑋 → (𝑦𝐻𝑋) = (𝑋𝐻𝑋))
8 opeq1 4624 . . . . . . . . . . 11 (𝑦 = 𝑋 → ⟨𝑦, 𝑋⟩ = ⟨𝑋, 𝑋⟩)
98oveq1d 6921 . . . . . . . . . 10 (𝑦 = 𝑋 → (⟨𝑦, 𝑋· 𝑋) = (⟨𝑋, 𝑋· 𝑋))
109oveqd 6923 . . . . . . . . 9 (𝑦 = 𝑋 → (𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = (𝑔(⟨𝑋, 𝑋· 𝑋)𝑓))
1110eqeq1d 2828 . . . . . . . 8 (𝑦 = 𝑋 → ((𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ↔ (𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓))
127, 11raleqbidv 3365 . . . . . . 7 (𝑦 = 𝑋 → (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓))
13 oveq2 6914 . . . . . . . 8 (𝑦 = 𝑋 → (𝑋𝐻𝑦) = (𝑋𝐻𝑋))
14 oveq2 6914 . . . . . . . . . 10 (𝑦 = 𝑋 → (⟨𝑋, 𝑋· 𝑦) = (⟨𝑋, 𝑋· 𝑋))
1514oveqd 6923 . . . . . . . . 9 (𝑦 = 𝑋 → (𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = (𝑓(⟨𝑋, 𝑋· 𝑋)𝑔))
1615eqeq1d 2828 . . . . . . . 8 (𝑦 = 𝑋 → ((𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓))
1713, 16raleqbidv 3365 . . . . . . 7 (𝑦 = 𝑋 → (∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓))
1812, 17anbi12d 626 . . . . . 6 (𝑦 = 𝑋 → ((∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓) ↔ (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓)))
1918rspcv 3523 . . . . 5 (𝑋𝐵 → (∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓) → (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓)))
205, 19syl 17 . . . 4 (𝜑 → (∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓) → (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓)))
2120ralrimivw 3177 . . 3 (𝜑 → ∀𝑔 ∈ (𝑋𝐻𝑋)(∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓) → (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓)))
22 an3 651 . . . . . . 7 (((∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓) ∧ (∀𝑓 ∈ (𝑋𝐻𝑋)((⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓)) → (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓))
23 oveq2 6914 . . . . . . . . . 10 (𝑓 = → (𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = (𝑔(⟨𝑋, 𝑋· 𝑋)))
24 id 22 . . . . . . . . . 10 (𝑓 = 𝑓 = )
2523, 24eqeq12d 2841 . . . . . . . . 9 (𝑓 = → ((𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ↔ (𝑔(⟨𝑋, 𝑋· 𝑋)) = ))
2625rspcv 3523 . . . . . . . 8 ( ∈ (𝑋𝐻𝑋) → (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 → (𝑔(⟨𝑋, 𝑋· 𝑋)) = ))
27 oveq1 6913 . . . . . . . . . 10 (𝑓 = 𝑔 → (𝑓(⟨𝑋, 𝑋· 𝑋)) = (𝑔(⟨𝑋, 𝑋· 𝑋)))
28 id 22 . . . . . . . . . 10 (𝑓 = 𝑔𝑓 = 𝑔)
2927, 28eqeq12d 2841 . . . . . . . . 9 (𝑓 = 𝑔 → ((𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓 ↔ (𝑔(⟨𝑋, 𝑋· 𝑋)) = 𝑔))
3029rspcv 3523 . . . . . . . 8 (𝑔 ∈ (𝑋𝐻𝑋) → (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓 → (𝑔(⟨𝑋, 𝑋· 𝑋)) = 𝑔))
3126, 30im2anan9r 616 . . . . . . 7 ((𝑔 ∈ (𝑋𝐻𝑋) ∧ ∈ (𝑋𝐻𝑋)) → ((∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓) → ((𝑔(⟨𝑋, 𝑋· 𝑋)) = ∧ (𝑔(⟨𝑋, 𝑋· 𝑋)) = 𝑔)))
32 eqtr2 2848 . . . . . . . 8 (((𝑔(⟨𝑋, 𝑋· 𝑋)) = ∧ (𝑔(⟨𝑋, 𝑋· 𝑋)) = 𝑔) → = 𝑔)
3332equcomd 2125 . . . . . . 7 (((𝑔(⟨𝑋, 𝑋· 𝑋)) = ∧ (𝑔(⟨𝑋, 𝑋· 𝑋)) = 𝑔) → 𝑔 = )
3422, 31, 33syl56 36 . . . . . 6 ((𝑔 ∈ (𝑋𝐻𝑋) ∧ ∈ (𝑋𝐻𝑋)) → (((∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓) ∧ (∀𝑓 ∈ (𝑋𝐻𝑋)((⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓)) → 𝑔 = ))
3534rgen2a 3187 . . . . 5 𝑔 ∈ (𝑋𝐻𝑋)∀ ∈ (𝑋𝐻𝑋)(((∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓) ∧ (∀𝑓 ∈ (𝑋𝐻𝑋)((⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓)) → 𝑔 = )
3635a1i 11 . . . 4 (𝜑 → ∀𝑔 ∈ (𝑋𝐻𝑋)∀ ∈ (𝑋𝐻𝑋)(((∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓) ∧ (∀𝑓 ∈ (𝑋𝐻𝑋)((⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓)) → 𝑔 = ))
37 oveq1 6913 . . . . . . . 8 (𝑔 = → (𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = ((⟨𝑋, 𝑋· 𝑋)𝑓))
3837eqeq1d 2828 . . . . . . 7 (𝑔 = → ((𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ↔ ((⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓))
3938ralbidv 3196 . . . . . 6 (𝑔 = → (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑋)((⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓))
40 oveq2 6914 . . . . . . . 8 (𝑔 = → (𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = (𝑓(⟨𝑋, 𝑋· 𝑋)))
4140eqeq1d 2828 . . . . . . 7 (𝑔 = → ((𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓))
4241ralbidv 3196 . . . . . 6 (𝑔 = → (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓))
4339, 42anbi12d 626 . . . . 5 (𝑔 = → ((∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓) ↔ (∀𝑓 ∈ (𝑋𝐻𝑋)((⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓)))
4443rmo4 3625 . . . 4 (∃*𝑔 ∈ (𝑋𝐻𝑋)(∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓) ↔ ∀𝑔 ∈ (𝑋𝐻𝑋)∀ ∈ (𝑋𝐻𝑋)(((∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓) ∧ (∀𝑓 ∈ (𝑋𝐻𝑋)((⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)) = 𝑓)) → 𝑔 = ))
4536, 44sylibr 226 . . 3 (𝜑 → ∃*𝑔 ∈ (𝑋𝐻𝑋)(∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓))
46 rmoim 3635 . . 3 (∀𝑔 ∈ (𝑋𝐻𝑋)(∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓) → (∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓)) → (∃*𝑔 ∈ (𝑋𝐻𝑋)(∀𝑓 ∈ (𝑋𝐻𝑋)(𝑔(⟨𝑋, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑋)(𝑓(⟨𝑋, 𝑋· 𝑋)𝑔) = 𝑓) → ∃*𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓)))
4721, 45, 46sylc 65 . 2 (𝜑 → ∃*𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓))
48 reu5 3372 . 2 (∃!𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓) ↔ (∃𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓) ∧ ∃*𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓)))
496, 47, 48sylanbrc 580 1 (𝜑 → ∃!𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 386   = wceq 1658  wcel 2166  wral 3118  wrex 3119  ∃!wreu 3120  ∃*wrmo 3121  cop 4404  cfv 6124  (class class class)co 6906  Basecbs 16223  Hom chom 16317  compcco 16318  Catccat 16678
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2804  ax-nul 5014
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2606  df-eu 2641  df-clab 2813  df-cleq 2819  df-clel 2822  df-nfc 2959  df-ral 3123  df-rex 3124  df-reu 3125  df-rmo 3126  df-rab 3127  df-v 3417  df-sbc 3664  df-dif 3802  df-un 3804  df-in 3806  df-ss 3813  df-nul 4146  df-if 4308  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4660  df-br 4875  df-iota 6087  df-fv 6132  df-ov 6909  df-cat 16682
This theorem is referenced by:  catidd  16694  catidcl  16696  catlid  16697  catrid  16698
  Copyright terms: Public domain W3C validator