Theorem invcoisoid 17881

Description: The inverse of an isomorphism composed with the isomorphism is the identity. (Contributed by AV, 5-Apr-2020.)

Hypotheses

Ref	Expression
invisoinv.b	⊢ 𝐵 = (Base‘𝐶)
invisoinv.i	⊢ 𝐼 = (Iso‘𝐶)
invisoinv.n	⊢ 𝑁 = (Inv‘𝐶)
invisoinv.c	⊢ (𝜑 → 𝐶 ∈ Cat)
invisoinv.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
invisoinv.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
invisoinv.f	⊢ (𝜑 → 𝐹 ∈ (𝑋𝐼𝑌))
invcoisoid.1	⊢ 1 = (Id‘𝐶)
invcoisoid.o	⊢ ⚬ = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)

Assertion

Ref	Expression
invcoisoid	⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹) ⚬ 𝐹) = ( 1 ‘𝑋))

Proof of Theorem invcoisoid

Step	Hyp	Ref	Expression
1		invisoinv.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
2		invisoinv.i	. . . 4 ⊢ 𝐼 = (Iso‘𝐶)
3		invisoinv.n	. . . 4 ⊢ 𝑁 = (Inv‘𝐶)
4		invisoinv.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
5		invisoinv.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6		invisoinv.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
7		invisoinv.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐼𝑌))
8	1, 2, 3, 4, 5, 6, 7	invisoinvr 17880	. . 3 ⊢ (𝜑 → 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹))
9		eqid 2760	. . . . 5 ⊢ (Sect‘𝐶) = (Sect‘𝐶)
10	1, 3, 4, 5, 6, 9	isinv 17849	. . . 4 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)))
11		simpl 488	. . . 4 ⊢ ((𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹) → 𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))
12	10, 11	biimtrdi 256	. . 3 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹) → 𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)))
13	8, 12	mpd 16	. 2 ⊢ (𝜑 → 𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))
14		eqid 2760	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
15		eqid 2760	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
16		invcoisoid.1	. . . 4 ⊢ 1 = (Id‘𝐶)
17	1, 14, 2, 4, 5, 6	isohom 17865	. . . . 5 ⊢ (𝜑 → (𝑋𝐼𝑌) ⊆ (𝑋(Hom ‘𝐶)𝑌))
18	17, 7	sseldd 3932	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
19	1, 14, 2, 4, 6, 5	isohom 17865	. . . . 5 ⊢ (𝜑 → (𝑌𝐼𝑋) ⊆ (𝑌(Hom ‘𝐶)𝑋))
20	1, 3, 4, 5, 6, 2	invf 17857	. . . . . 6 ⊢ (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)⟶(𝑌𝐼𝑋))
21	20, 7	ffvelcdmd 7078	. . . . 5 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌𝐼𝑋))
22	19, 21	sseldd 3932	. . . 4 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌(Hom ‘𝐶)𝑋))
23	1, 14, 15, 16, 9, 4, 5, 6, 18, 22	issect2 17843	. . 3 ⊢ (𝜑 → (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (((𝑋𝑁𝑌)‘𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ( 1 ‘𝑋)))
24		invcoisoid.o	. . . . . . 7 ⊢ ⚬ = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)
25	24	a1i 11	. . . . . 6 ⊢ (𝜑 → ⚬ = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋))
26	25	eqcomd 2766	. . . . 5 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋) = ⚬ )
27	26	oveqd 7430	. . . 4 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = (((𝑋𝑁𝑌)‘𝐹) ⚬ 𝐹))
28	27	eqeq1d 2762	. . 3 ⊢ (𝜑 → ((((𝑋𝑁𝑌)‘𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ( 1 ‘𝑋) ↔ (((𝑋𝑁𝑌)‘𝐹) ⚬ 𝐹) = ( 1 ‘𝑋)))
29	23, 28	bitrd 282	. 2 ⊢ (𝜑 → (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (((𝑋𝑁𝑌)‘𝐹) ⚬ 𝐹) = ( 1 ‘𝑋)))
30	13, 29	mpbid 235	1 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹) ⚬ 𝐹) = ( 1 ‘𝑋))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ⟨cop 4590   class class class wbr 5103  ‘cfv 6533  (class class class)co 7413  Basecbs 17301  Hom chom 17353  compcco 17354  Catccat 17752  Idccid 17753  Sectcsect 17833  Invcinv 17834  Isociso 17835

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

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 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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-cat 17756  df-cid 17757  df-sect 17836  df-inv 17837  df-iso 17838

This theorem is used by:  rcaninv  17883  upeu2lem  49954