Theorem invco 17850

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

Step	Hyp	Ref	Expression
1		invfval.b	. . 3 ⊢ 𝐵 = (Base‘𝐶)
2		invco.o	. . 3 ⊢ · = (comp‘𝐶)
3		eqid 2765	. . 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‘𝐶)
11	1, 9, 4, 5, 6, 10	isoval 17844	. . . . . . 7 ⊢ (𝜑 → (𝑋𝐼𝑌) = dom (𝑋𝑁𝑌))
12	8, 11	eleqtrd 2867	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ dom (𝑋𝑁𝑌))
13	1, 9, 4, 5, 6	invfun 17843	. . . . . . 7 ⊢ (𝜑 → Fun (𝑋𝑁𝑌))
14		funfvbrb 7050	. . . . . . 7 ⊢ (Fun (𝑋𝑁𝑌) → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
15	13, 14	syl 18	. . . . . 6 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
16	12, 15	mpbid 235	. . . . 5 ⊢ (𝜑 → 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹))
17	1, 9, 4, 5, 6, 3	isinv 17839	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)))
18	16, 17	mpbid 235	. . . 4 ⊢ (𝜑 → (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹))
19	18	simpld 500	. . 3 ⊢ (𝜑 → 𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))
20		invco.f	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐼𝑍))
21	1, 9, 4, 6, 7, 10	isoval 17844	. . . . . . 7 ⊢ (𝜑 → (𝑌𝐼𝑍) = dom (𝑌𝑁𝑍))
22	20, 21	eleqtrd 2867	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ dom (𝑌𝑁𝑍))
23	1, 9, 4, 6, 7	invfun 17843	. . . . . . 7 ⊢ (𝜑 → Fun (𝑌𝑁𝑍))
24		funfvbrb 7050	. . . . . . 7 ⊢ (Fun (𝑌𝑁𝑍) → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
25	23, 24	syl 18	. . . . . 6 ⊢ (𝜑 → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
26	22, 25	mpbid 235	. . . . 5 ⊢ (𝜑 → 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺))
27	1, 9, 4, 6, 7, 3	isinv 17839	. . . . 5 ⊢ (𝜑 → (𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺) ↔ (𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺) ∧ ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺)))
28	26, 27	mpbid 235	. . . 4 ⊢ (𝜑 → (𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺) ∧ ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺))
29	28	simpld 500	. . 3 ⊢ (𝜑 → 𝐺(𝑌(Sect‘𝐶)𝑍)((𝑌𝑁𝑍)‘𝐺))
30	1, 2, 3, 4, 5, 6, 7, 19, 29	sectco 17835	. 2 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(𝑋(Sect‘𝐶)𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺)))
31	28	simprd 501	. . 3 ⊢ (𝜑 → ((𝑌𝑁𝑍)‘𝐺)(𝑍(Sect‘𝐶)𝑌)𝐺)
32	18	simprd 501	. . 3 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)
33	1, 2, 3, 4, 7, 6, 5, 31, 32	sectco 17835	. 2 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
34	1, 9, 4, 5, 7, 3	isinv 17839	. 2 ⊢ (𝜑 → ((𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺)) ↔ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(𝑋(Sect‘𝐶)𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺)) ∧ (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))))
35	30, 33, 34	mpbir2and 726	1 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ⟨cop 4597   class class class wbr 5111  dom cdm 5663  Fun wfun 6534  ‘cfv 6540  (class class class)co 7419  Basecbs 17291  compcco 17344  Catccat 17742  Sectcsect 17823  Invcinv 17824  Isociso 17825

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-cat 17746  df-cid 17747  df-sect 17826  df-inv 17827  df-iso 17828

This theorem is used by:  isoco  17856  invisoinvl  17869