Theorem invco 17996

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 2763	. . 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 17990	. . . . . . 7 ⊢ (𝜑 → (𝑋𝐼𝑌) = dom (𝑋𝑁𝑌))
12	8, 11	eleqtrd 2866	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ dom (𝑋𝑁𝑌))
13	1, 9, 4, 5, 6	invfun 17989	. . . . . . 7 ⊢ (𝜑 → Fun (𝑋𝑁𝑌))
14		funfvbrb 7081	. . . . . . 7 ⊢ (Fun (𝑋𝑁𝑌) → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
15	13, 14	syl 18	. . . . . 6 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋𝑁𝑌) ↔ 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹)))
16	12, 15	mpbid 235	. . . . 5 ⊢ (𝜑 → 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹))
17	1, 9, 4, 5, 6, 3	isinv 17985	. . . . 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 17990	. . . . . . 7 ⊢ (𝜑 → (𝑌𝐼𝑍) = dom (𝑌𝑁𝑍))
22	20, 21	eleqtrd 2866	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ dom (𝑌𝑁𝑍))
23	1, 9, 4, 6, 7	invfun 17989	. . . . . . 7 ⊢ (𝜑 → Fun (𝑌𝑁𝑍))
24		funfvbrb 7081	. . . . . . 7 ⊢ (Fun (𝑌𝑁𝑍) → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
25	23, 24	syl 18	. . . . . 6 ⊢ (𝜑 → (𝐺 ∈ dom (𝑌𝑁𝑍) ↔ 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺)))
26	22, 25	mpbid 235	. . . . 5 ⊢ (𝜑 → 𝐺(𝑌𝑁𝑍)((𝑌𝑁𝑍)‘𝐺))
27	1, 9, 4, 6, 7, 3	isinv 17985	. . . . 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 17981	. 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 17981	. 2 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(⟨𝑍, 𝑌⟩ · 𝑋)((𝑌𝑁𝑍)‘𝐺))(𝑍(Sect‘𝐶)𝑋)(𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
34	1, 9, 4, 5, 7, 3	isinv 17985	. 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 2147  ⟨cop 4840   class class class wbr 5108  dom cdm 5658  Fun wfun 6560  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  compcco 17484  Catccat 17888  Sectcsect 17969  Invcinv 17970  Isociso 17971

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-cat 17892  df-cid 17893  df-sect 17972  df-inv 17973  df-iso 17974

This theorem is used by:  isoco  18002  invisoinvl  18015