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

Theorem invco 17832
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)
invfval.x (𝜑𝑋𝐵)
invfval.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 2740 . . 3 (Sect‘𝐶) = (Sect‘𝐶)
4 invfval.c . . 3 (𝜑𝐶 ∈ Cat)
5 invfval.x . . 3 (𝜑𝑋𝐵)
6 invfval.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 17826 . . . . . . 7 (𝜑 → (𝑋𝐼𝑌) = dom (𝑋𝑁𝑌))
128, 11eleqtrd 2846 . . . . . 6 (𝜑𝐹 ∈ dom (𝑋𝑁𝑌))
131, 9, 4, 5, 6invfun 17825 . . . . . . 7 (𝜑 → Fun (𝑋𝑁𝑌))
14 funfvbrb 7084 . . . . . . 7 (Fun (𝑋𝑁𝑌) → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
1513, 14syl 17 . . . . . 6 (𝜑 → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
1612, 15mpbid 232 . . . . 5 (𝜑𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹))
171, 9, 4, 5, 6, 3isinv 17821 . . . . 5 (𝜑 → (𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)))
1816, 17mpbid 232 . . . 4 (𝜑 → (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹))
1918simpld 494 . . 3 (𝜑𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))
20 invco.f . . . . . . 7 (𝜑𝐺 ∈ (𝑌𝐼𝑍))
211, 9, 4, 6, 7, 10isoval 17826 . . . . . . 7 (𝜑 → (𝑌𝐼𝑍) = dom (𝑌𝑁𝑍))
2220, 21eleqtrd 2846 . . . . . 6 (𝜑𝐺 ∈ dom (𝑌𝑁𝑍))
231, 9, 4, 6, 7invfun 17825 . . . . . . 7 (𝜑 → Fun (𝑌𝑁𝑍))
24 funfvbrb 7084 . . . . . . 7 (Fun (𝑌𝑁𝑍) → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
2523, 24syl 17 . . . . . 6 (𝜑 → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
2622, 25mpbid 232 . . . . 5 (𝜑𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺))
271, 9, 4, 6, 7, 3isinv 17821 . . . . 5 (𝜑 → (𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺) ↔ (𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺) ∧ ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺)))
2826, 27mpbid 232 . . . 4 (𝜑 → (𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺) ∧ ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺))
2928simpld 494 . . 3 (𝜑𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺))
301, 2, 3, 4, 5, 6, 7, 19, 29sectco 17817 . 2 (𝜑 → (𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋(Sect‘𝐶)𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)))
3128simprd 495 . . 3 (𝜑 → ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺)
3218simprd 495 . . 3 (𝜑 → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)
331, 2, 3, 4, 7, 6, 5, 31, 32sectco 17817 . 2 (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌· 𝑍)𝐹))
341, 9, 4, 5, 7, 3isinv 17821 . 2 (𝜑 → ((𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)) ↔ ((𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋(Sect‘𝐶)𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)) ∧ (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌· 𝑍)𝐹))))
3530, 33, 34mpbir2and 712 1 (𝜑 → (𝐺(⟨𝑋, 𝑌· 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌· 𝑋)((𝑌𝑁𝑍)‘𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  cop 4654   class class class wbr 5166  dom cdm 5700  Fun wfun 6567  cfv 6573  (class class class)co 7448  Basecbs 17258  compcco 17323  Catccat 17722  Sectcsect 17805  Invcinv 17806  Isociso 17807
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-cat 17726  df-cid 17727  df-sect 17808  df-inv 17809  df-iso 17810
This theorem is referenced by:  isoco  17838  invisoinvl  17851
  Copyright terms: Public domain W3C validator