Theorem invcoisoid 17064

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 17063	. . 3 ⊢ (𝜑 → 𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹))
9		eqid 2823	. . . . 5 ⊢ (Sect‘𝐶) = (Sect‘𝐶)
10	1, 3, 4, 5, 6, 9	isinv 17032	. . . 4 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)))
11		simpl 485	. . . 4 ⊢ ((𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ∧ ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹) → 𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))
12	10, 11	syl6bi 255	. . 3 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)((𝑋𝑁𝑌)‘𝐹) → 𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)))
13	8, 12	mpd 15	. 2 ⊢ (𝜑 → 𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))
14		eqid 2823	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
15		eqid 2823	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
16		invcoisoid.1	. . . 4 ⊢ 1 = (Id‘𝐶)
17	1, 14, 2, 4, 5, 6	isohom 17048	. . . . 5 ⊢ (𝜑 → (𝑋𝐼𝑌) ⊆ (𝑋(Hom ‘𝐶)𝑌))
18	17, 7	sseldd 3970	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
19	1, 14, 2, 4, 6, 5	isohom 17048	. . . . 5 ⊢ (𝜑 → (𝑌𝐼𝑋) ⊆ (𝑌(Hom ‘𝐶)𝑋))
20	1, 3, 4, 5, 6, 2	invf 17040	. . . . . 6 ⊢ (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)⟶(𝑌𝐼𝑋))
21	20, 7	ffvelrnd 6854	. . . . 5 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌𝐼𝑋))
22	19, 21	sseldd 3970	. . . 4 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌(Hom ‘𝐶)𝑋))
23	1, 14, 15, 16, 9, 4, 5, 6, 18, 22	issect2 17026	. . 3 ⊢ (𝜑 → (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (((𝑋𝑁𝑌)‘𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ( 1 ‘𝑋)))
24		invcoisoid.o	. . . . . . 7 ⊢ ⚬ = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)
25	24	a1i 11	. . . . . 6 ⊢ (𝜑 → ⚬ = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋))
26	25	eqcomd 2829	. . . . 5 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋) = ⚬ )
27	26	oveqd 7175	. . . 4 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = (((𝑋𝑁𝑌)‘𝐹) ⚬ 𝐹))
28	27	eqeq1d 2825	. . 3 ⊢ (𝜑 → ((((𝑋𝑁𝑌)‘𝐹)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ( 1 ‘𝑋) ↔ (((𝑋𝑁𝑌)‘𝐹) ⚬ 𝐹) = ( 1 ‘𝑋)))
29	23, 28	bitrd 281	. 2 ⊢ (𝜑 → (𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹) ↔ (((𝑋𝑁𝑌)‘𝐹) ⚬ 𝐹) = ( 1 ‘𝑋)))
30	13, 29	mpbid 234	1 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹) ⚬ 𝐹) = ( 1 ‘𝑋))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1537   ∈ wcel 2114  ⟨cop 4575   class class class wbr 5068  ‘cfv 6357  (class class class)co 7158  Basecbs 16485  Hom chom 16578  compcco 16579  Catccat 16937  Idccid 16938  Sectcsect 17016  Invcinv 17017  Isociso 17018

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-1st 7691  df-2nd 7692  df-cat 16941  df-cid 16942  df-sect 17019  df-inv 17020  df-iso 17021

This theorem is referenced by:  rcaninv  17066