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

Theorem invco 17804
Description: The composition of two isomorphisms is an isomorphism, and the inverse is the composition of the individual inverses. Proposition 3.14(2) of [Adamek] p. 29. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
invfval.b 𝐵 = (Base‘𝐶)
invfval.n 𝑁 = (Inv‘𝐶)
invfval.c (𝜑𝐶 ∈ Cat)
invss.x (𝜑𝑋𝐵)
invss.y (𝜑𝑌𝐵)
isoval.n 𝐼 = (Iso‘𝐶)
invinv.f (𝜑𝐹 ∈ (𝑋𝐼𝑌))
invco.o · = (comp‘𝐶)
invco.z (𝜑𝑍𝐵)
invco.f (𝜑𝐺 ∈ (𝑌𝐼𝑍))
Assertion
Ref Expression
invco (𝜑 → (𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)))

Proof of Theorem invco
StepHypRef Expression
1 invfval.b . . 3 𝐵 = (Base‘𝐶)
2 invco.o . . 3 · = (comp‘𝐶)
3 eqid 2762 . . 3 (Sect‘𝐶) = (Sect‘𝐶)
4 invfval.c . . 3 (𝜑𝐶 ∈ Cat)
5 invss.x . . 3 (𝜑𝑋𝐵)
6 invss.y . . 3 (𝜑𝑌𝐵)
7 invco.z . . 3 (𝜑𝑍𝐵)
8 invinv.f . . . . . . 7 (𝜑𝐹 ∈ (𝑋𝐼𝑌))
9 invfval.n . . . . . . . 8 𝑁 = (Inv‘𝐶)
10 isoval.n . . . . . . . 8 𝐼 = (Iso‘𝐶)
111, 9, 4, 5, 6, 10isoval 17798 . . . . . . 7 (𝜑 → (𝑋𝐼𝑌) = dom (𝑋𝑁𝑌))
128, 11eleqtrd 2864 . . . . . 6 (𝜑𝐹 ∈ dom (𝑋𝑁𝑌))
131, 9, 4, 5, 6invfun 17797 . . . . . . 7 (𝜑 → Fun (𝑋𝑁𝑌))
14 funfvbrb 7032 . . . . . . 7 (Fun (𝑋𝑁𝑌) → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
1513, 14syl 17 . . . . . 6 (𝜑 → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
1612, 15mpbid 234 . . . . 5 (𝜑𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹))
171, 9, 4, 5, 6, 3isinv 17793 . . . . 5 (𝜑 → (𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)))
1816, 17mpbid 234 . . . 4 (𝜑 → (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹))
1918simpld 498 . . 3 (𝜑𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))
20 invco.f . . . . . . 7 (𝜑𝐺 ∈ (𝑌𝐼𝑍))
211, 9, 4, 6, 7, 10isoval 17798 . . . . . . 7 (𝜑 → (𝑌𝐼𝑍) = dom (𝑌𝑁𝑍))
2220, 21eleqtrd 2864 . . . . . 6 (𝜑𝐺 ∈ dom (𝑌𝑁𝑍))
231, 9, 4, 6, 7invfun 17797 . . . . . . 7 (𝜑 → Fun (𝑌𝑁𝑍))
24 funfvbrb 7032 . . . . . . 7 (Fun (𝑌𝑁𝑍) → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
2523, 24syl 17 . . . . . 6 (𝜑 → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
2622, 25mpbid 234 . . . . 5 (𝜑𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺))
271, 9, 4, 6, 7, 3isinv 17793 . . . . 5 (𝜑 → (𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺) ↔ (𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺) ∧ ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺)))
2826, 27mpbid 234 . . . 4 (𝜑 → (𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺) ∧ ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺))
2928simpld 498 . . 3 (𝜑𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺))
301, 2, 3, 4, 5, 6, 7, 19, 29sectco 17789 . 2 (𝜑 → (𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋(Sect‘𝐶)𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)))
3128simprd 499 . . 3 (𝜑 → ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺)
3218simprd 499 . . 3 (𝜑 → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)
331, 2, 3, 4, 7, 6, 5, 31, 32sectco 17789 . 2 (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌· 𝑍)𝐹))
341, 9, 4, 5, 7, 3isinv 17793 . 2 (𝜑 → ((𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)) ↔ ((𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋(Sect‘𝐶)𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)) ∧ (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌· 𝑍)𝐹))))
3530, 33, 34mpbir2and 723 1 (𝜑 → (𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1560  wcel 2142  cop 4588   class class class wbr 5100  dom cdm 5647  Fun wfun 6515  cfv 6521  (class class class)co 7396  Basecbs 17245  compcco 17298  Catccat 17696  Sectcsect 17777  Invcinv 17778  Isociso 17779
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-1st 7970  df-2nd 7971  df-cat 17700  df-cid 17701  df-sect 17780  df-inv 17781  df-iso 17782
This theorem is referenced by:  isoco  17810  invisoinvl  17823
  Copyright terms: Public domain W3C validator