Theorem invco 17955

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 2760	. . 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 17949	. . . . . . 7 ⊢ (𝜑 → (𝑋𝐼𝑌) = dom (𝑋𝑁𝑌))
12	8, 11	eleqtrd 2862	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ dom (𝑋𝑁𝑌))
13	1, 9, 4, 5, 6	invfun 17948	. . . . . . 7 ⊢ (𝜑 → Fun (𝑋𝑁𝑌))
14		funfvbrb 7055	. . . . . . 7 ⊢ (Fun (𝑋𝑁𝑌) → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
15	13, 14	syl 18	. . . . . 6 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
16	12, 15	mpbid 235	. . . . 5 ⊢ (𝜑 → 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹))
17	1, 9, 4, 5, 6, 3	isinv 17944	. . . . 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 17949	. . . . . . 7 ⊢ (𝜑 → (𝑌𝐼𝑍) = dom (𝑌𝑁𝑍))
22	20, 21	eleqtrd 2862	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ dom (𝑌𝑁𝑍))
23	1, 9, 4, 6, 7	invfun 17948	. . . . . . 7 ⊢ (𝜑 → Fun (𝑌𝑁𝑍))
24		funfvbrb 7055	. . . . . . 7 ⊢ (Fun (𝑌𝑁𝑍) → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
25	23, 24	syl 18	. . . . . 6 ⊢ (𝜑 → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
26	22, 25	mpbid 235	. . . . 5 ⊢ (𝜑 → 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺))
27	1, 9, 4, 6, 7, 3	isinv 17944	. . . . 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 17940	. 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 17940	. 2 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
34	1, 9, 4, 5, 7, 3	isinv 17944	. 2 ⊢ (𝜑 → ((𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺)) ↔ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(𝑋(Sect‘𝐶)𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺)) ∧ (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))))
35	30, 33, 34	mpbir2and 726	1 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹)(𝑋𝑁𝑍)(((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ⟨cop 4834   class class class wbr 5102  dom cdm 5651  Fun wfun 6537  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  compcco 17449  Catccat 17847  Sectcsect 17928  Invcinv 17929  Isociso 17930

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-1st 8005  df-2nd 8006  df-cat 17851  df-cid 17852  df-sect 17931  df-inv 17932  df-iso 17933

This theorem is used by:  isoco  17961  invisoinvl  17974