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

Theorem 2termoinv 18185
Description: Morphisms between two terminal objects are inverses. (Contributed by AV, 18-Apr-2020.)
Hypotheses
Ref Expression
termoeu1.c (𝜑 → 𝐶 ∈ Cat)
termoeu1.a (𝜑 → 𝐴 ∈ (TermO‘𝐶))
termoeu1.b (𝜑 → 𝐵 ∈ (TermO‘𝐶))
Assertion
Ref Expression
2termoinv ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐹(𝐴(Inv‘𝐶)𝐵)𝐺)

Proof of Theorem 2termoinv
StepHypRef Expression
1 eqid 2761 . . . . 5 (Base‘𝐶) = (Base‘𝐶)
2 eqid 2761 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
3 eqid 2761 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
4 termoeu1.c . . . . . 6 (𝜑 → 𝐶 ∈ Cat)
543ad2ant1 1151 . . . . 5 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐶 ∈ Cat)
6 termoeu1.a . . . . . . 7 (𝜑 → 𝐴 ∈ (TermO‘𝐶))
7 termoo 18176 . . . . . . 7 (𝐶 ∈ Cat → (𝐴 ∈ (TermO‘𝐶) → 𝐴 ∈ (Base‘𝐶)))
84, 6, 7sylc 66 . . . . . 6 (𝜑 → 𝐴 ∈ (Base‘𝐶))
983ad2ant1 1151 . . . . 5 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐴 ∈ (Base‘𝐶))
10 termoeu1.b . . . . . . 7 (𝜑 → 𝐵 ∈ (TermO‘𝐶))
11 termoo 18176 . . . . . . 7 (𝐶 ∈ Cat → (𝐵 ∈ (TermO‘𝐶) → 𝐵 ∈ (Base‘𝐶)))
124, 10, 11sylc 66 . . . . . 6 (𝜑 → 𝐵 ∈ (Base‘𝐶))
13123ad2ant1 1151 . . . . 5 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐵 ∈ (Base‘𝐶))
14 simp3 1156 . . . . 5 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵))
15 simp2 1155 . . . . 5 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴))
161, 2, 3, 5, 9, 13, 9, 14, 15catcocl 17852 . . . 4 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) ∈ (𝐴(Hom ‘𝐶)𝐴))
171, 2, 4termoid 18170 . . . . . . . 8 ((𝜑 ∧ 𝐴 ∈ (TermO‘𝐶)) → (𝐴(Hom ‘𝐶)𝐴) = {((Id‘𝐶)‘𝐴)})
186, 17mpdan 700 . . . . . . 7 (𝜑 → (𝐴(Hom ‘𝐶)𝐴) = {((Id‘𝐶)‘𝐴)})
19183ad2ant1 1151 . . . . . 6 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐴(Hom ‘𝐶)𝐴) = {((Id‘𝐶)‘𝐴)})
2019eleq2d 2847 . . . . 5 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → ((𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) ∈ (𝐴(Hom ‘𝐶)𝐴) ↔ (𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) ∈ {((Id‘𝐶)‘𝐴)}))
21 elsni 4601 . . . . 5 ((𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) ∈ {((Id‘𝐶)‘𝐴)} → (𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) = ((Id‘𝐶)‘𝐴))
2220, 21biimtrdi 256 . . . 4 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → ((𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) ∈ (𝐴(Hom ‘𝐶)𝐴) → (𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) = ((Id‘𝐶)‘𝐴)))
2316, 22mpd 16 . . 3 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) = ((Id‘𝐶)‘𝐴))
24 eqid 2761 . . . 4 (Id‘𝐶) = (Id‘𝐶)
25 eqid 2761 . . . 4 (Sect‘𝐶) = (Sect‘𝐶)
261, 2, 3, 24, 25, 5, 9, 13, 14, 15issect2 17922 . . 3 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐹(𝐴(Sect‘𝐶)𝐵)𝐺 ↔ (𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) = ((Id‘𝐶)‘𝐴)))
2723, 26mpbird 260 . 2 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐹(𝐴(Sect‘𝐶)𝐵)𝐺)
281, 2, 3, 5, 13, 9, 13, 15, 14catcocl 17852 . . . 4 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) ∈ (𝐵(Hom ‘𝐶)𝐵))
291, 2, 4termoid 18170 . . . . . . . 8 ((𝜑 ∧ 𝐵 ∈ (TermO‘𝐶)) → (𝐵(Hom ‘𝐶)𝐵) = {((Id‘𝐶)‘𝐵)})
3010, 29mpdan 700 . . . . . . 7 (𝜑 → (𝐵(Hom ‘𝐶)𝐵) = {((Id‘𝐶)‘𝐵)})
31303ad2ant1 1151 . . . . . 6 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐵(Hom ‘𝐶)𝐵) = {((Id‘𝐶)‘𝐵)})
3231eleq2d 2847 . . . . 5 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → ((𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) ∈ (𝐵(Hom ‘𝐶)𝐵) ↔ (𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) ∈ {((Id‘𝐶)‘𝐵)}))
33 elsni 4601 . . . . 5 ((𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) ∈ {((Id‘𝐶)‘𝐵)} → (𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) = ((Id‘𝐶)‘𝐵))
3432, 33biimtrdi 256 . . . 4 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → ((𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) ∈ (𝐵(Hom ‘𝐶)𝐵) → (𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) = ((Id‘𝐶)‘𝐵)))
3528, 34mpd 16 . . 3 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) = ((Id‘𝐶)‘𝐵))
361, 2, 3, 24, 25, 5, 13, 9, 15, 14issect2 17922 . . 3 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐺(𝐵(Sect‘𝐶)𝐴)𝐹 ↔ (𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) = ((Id‘𝐶)‘𝐵)))
3735, 36mpbird 260 . 2 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐺(𝐵(Sect‘𝐶)𝐴)𝐹)
38 eqid 2761 . . . 4 (Inv‘𝐶) = (Inv‘𝐶)
391, 38, 4, 8, 12, 25isinv 17928 . . 3 (𝜑 → (𝐹(𝐴(Inv‘𝐶)𝐵)𝐺 ↔ (𝐹(𝐴(Sect‘𝐶)𝐵)𝐺 ∧ 𝐺(𝐵(Sect‘𝐶)𝐴)𝐹)))
40393ad2ant1 1151 . 2 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐹(𝐴(Inv‘𝐶)𝐵)𝐺 ↔ (𝐹(𝐴(Sect‘𝐶)𝐵)𝐺 ∧ 𝐺(𝐵(Sect‘𝐶)𝐴)𝐹)))
4127, 37, 40mpbir2and 726 1 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐹(𝐴(Inv‘𝐶)𝐵)𝐺)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {csn 4584  ⟨cop 4590   class class class wbr 5103  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  Hom chom 17432  compcco 17433  Catccat 17831  Idccid 17832  Sectcsect 17912  Invcinv 17913  TermOctermo 18150
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-cat 17835  df-cid 17836  df-sect 17915  df-inv 17916  df-termo 18153
This theorem is used by:  termoeu1  18186
  Copyright terms: Public domain W3C validator