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

Theorem invco 17733
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 2729 . . 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 17727 . . . . . . 7 (𝜑 → (𝑋𝐼𝑌) = dom (𝑋𝑁𝑌))
128, 11eleqtrd 2830 . . . . . 6 (𝜑𝐹 ∈ dom (𝑋𝑁𝑌))
131, 9, 4, 5, 6invfun 17726 . . . . . . 7 (𝜑 → Fun (𝑋𝑁𝑌))
14 funfvbrb 7023 . . . . . . 7 (Fun (𝑋𝑁𝑌) → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
1513, 14syl 17 . . . . . 6 (𝜑 → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
1612, 15mpbid 232 . . . . 5 (𝜑𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹))
171, 9, 4, 5, 6, 3isinv 17722 . . . . 5 (𝜑 → (𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)))
1816, 17mpbid 232 . . . 4 (𝜑 → (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹))
1918simpld 494 . . 3 (𝜑𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))
20 invco.f . . . . . . 7 (𝜑𝐺 ∈ (𝑌𝐼𝑍))
211, 9, 4, 6, 7, 10isoval 17727 . . . . . . 7 (𝜑 → (𝑌𝐼𝑍) = dom (𝑌𝑁𝑍))
2220, 21eleqtrd 2830 . . . . . 6 (𝜑𝐺 ∈ dom (𝑌𝑁𝑍))
231, 9, 4, 6, 7invfun 17726 . . . . . . 7 (𝜑 → Fun (𝑌𝑁𝑍))
24 funfvbrb 7023 . . . . . . 7 (Fun (𝑌𝑁𝑍) → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
2523, 24syl 17 . . . . . 6 (𝜑 → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
2622, 25mpbid 232 . . . . 5 (𝜑𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺))
271, 9, 4, 6, 7, 3isinv 17722 . . . . 5 (𝜑 → (𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺) ↔ (𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺) ∧ ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺)))
2826, 27mpbid 232 . . . 4 (𝜑 → (𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺) ∧ ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺))
2928simpld 494 . . 3 (𝜑𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺))
301, 2, 3, 4, 5, 6, 7, 19, 29sectco 17718 . 2 (𝜑 → (𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋(Sect‘𝐶)𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)))
3128simprd 495 . . 3 (𝜑 → ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺)
3218simprd 495 . . 3 (𝜑 → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)
331, 2, 3, 4, 7, 6, 5, 31, 32sectco 17718 . 2 (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌· 𝑍)𝐹))
341, 9, 4, 5, 7, 3isinv 17722 . 2 (𝜑 → ((𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)) ↔ ((𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋(Sect‘𝐶)𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)) ∧ (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌· 𝑍)𝐹))))
3530, 33, 34mpbir2and 713 1 (𝜑 → (𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  cop 4595   class class class wbr 5107  dom cdm 5638  Fun wfun 6505  cfv 6511  (class class class)co 7387  Basecbs 17179  compcco 17232  Catccat 17625  Sectcsect 17706  Invcinv 17707  Isociso 17708
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-cat 17629  df-cid 17630  df-sect 17709  df-inv 17710  df-iso 17711
This theorem is referenced by:  isoco  17739  invisoinvl  17752
  Copyright terms: Public domain W3C validator