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

Theorem 2termoinv 18242
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 2763 . . . . 5 (Base‘𝐶) = (Base‘𝐶)
2 eqid 2763 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
3 eqid 2763 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
4 termoeu1.c . . . . . 6 (𝜑 → 𝐶 ∈ Cat)
543ad2ant1 1151 . . . . 5 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐶 ∈ Cat)
6 termoeu1.a . . . . . . 7 (𝜑 → 𝐴 ∈ (TermO‘𝐶))
7 termoo 18233 . . . . . . 7 (𝐶 ∈ Cat → (𝐴 ∈ (TermO‘𝐶) → 𝐴 ∈ (Base‘𝐶)))
84, 6, 7sylc 66 . . . . . 6 (𝜑 → 𝐴 ∈ (Base‘𝐶))
983ad2ant1 1151 . . . . 5 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐴 ∈ (Base‘𝐶))
10 termoeu1.b . . . . . . 7 (𝜑 → 𝐵 ∈ (TermO‘𝐶))
11 termoo 18233 . . . . . . 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 17909 . . . 4 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) ∈ (𝐴(Hom ‘𝐶)𝐴))
171, 2, 4termoid 18227 . . . . . . . 8 ((𝜑 ∧ 𝐴 ∈ (TermO‘𝐶)) → (𝐴(Hom ‘𝐶)𝐴) = {((Id‘𝐶)‘𝐴)})
186, 17mpdan 700 . . . . . . 7 (𝜑 → (𝐴(Hom ‘𝐶)𝐴) = {((Id‘𝐶)‘𝐴)})
19183ad2ant1 1151 . . . . . 6 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐴(Hom ‘𝐶)𝐴) = {((Id‘𝐶)‘𝐴)})
2019eleq2d 2850 . . . . 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 2763 . . . 4 (Id‘𝐶) = (Id‘𝐶)
25 eqid 2763 . . . 4 (Sect‘𝐶) = (Sect‘𝐶)
261, 2, 3, 24, 25, 5, 9, 13, 14, 15issect2 17979 . . 3 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐹(𝐴(Sect‘𝐶)𝐵)𝐺 ↔ (𝐺(⟨𝐴, 𝐵⟩(comp‘𝐶)𝐴)𝐹) = ((Id‘𝐶)‘𝐴)))
2723, 26mpbird 260 . 2 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐹(𝐴(Sect‘𝐶)𝐵)𝐺)
281, 2, 3, 5, 13, 9, 13, 15, 14catcocl 17909 . . . 4 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) ∈ (𝐵(Hom ‘𝐶)𝐵))
291, 2, 4termoid 18227 . . . . . . . 8 ((𝜑 ∧ 𝐵 ∈ (TermO‘𝐶)) → (𝐵(Hom ‘𝐶)𝐵) = {((Id‘𝐶)‘𝐵)})
3010, 29mpdan 700 . . . . . . 7 (𝜑 → (𝐵(Hom ‘𝐶)𝐵) = {((Id‘𝐶)‘𝐵)})
31303ad2ant1 1151 . . . . . 6 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐵(Hom ‘𝐶)𝐵) = {((Id‘𝐶)‘𝐵)})
3231eleq2d 2850 . . . . 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 17979 . . 3 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → (𝐺(𝐵(Sect‘𝐶)𝐴)𝐹 ↔ (𝐹(⟨𝐵, 𝐴⟩(comp‘𝐶)𝐵)𝐺) = ((Id‘𝐶)‘𝐵)))
3735, 36mpbird 260 . 2 ((𝜑 ∧ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐴) ∧ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐵)) → 𝐺(𝐵(Sect‘𝐶)𝐴)𝐹)
38 eqid 2763 . . . 4 (Inv‘𝐶) = (Inv‘𝐶)
391, 38, 4, 8, 12, 25isinv 17985 . . 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 2147  {csn 4588  ⟨cop 4840   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Hom chom 17483  compcco 17484  Catccat 17888  Idccid 17889  Sectcsect 17969  Invcinv 17970  TermOctermo 18207
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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-rmo 3369  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-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-cat 17892  df-cid 17893  df-sect 17972  df-inv 17973  df-termo 18210
This theorem is used by:  termoeu1  18243
  Copyright terms: Public domain W3C validator