Theorem isocoinvid 17729

Description: The inverse of an isomorphism composed with the isomorphism is the identity. (Contributed by AV, 10-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‘𝐶)
isocoinvid.o	⊢ ⚬ = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)

Assertion

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

Proof of Theorem isocoinvid

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	invisoinvl 17726	. . 3 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹)(𝑌𝑁𝑋)𝐹)
9		eqid 2737	. . . . 5 ⊢ (Sect‘𝐶) = (Sect‘𝐶)
10	1, 3, 4, 6, 5, 9	isinv 17696	. . . 4 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(𝑌𝑁𝑋)𝐹 ↔ (((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹 ∧ 𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))))
11		simpl 482	. . . 4 ⊢ ((((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹 ∧ 𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)
12	10, 11	biimtrdi 253	. . 3 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(𝑌𝑁𝑋)𝐹 → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹))
13	8, 12	mpd 15	. 2 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)
14		eqid 2737	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
15		eqid 2737	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
16		invcoisoid.1	. . . 4 ⊢ 1 = (Id‘𝐶)
17	1, 14, 2, 4, 6, 5	isohom 17712	. . . . 5 ⊢ (𝜑 → (𝑌𝐼𝑋) ⊆ (𝑌(Hom ‘𝐶)𝑋))
18	1, 3, 4, 5, 6, 2	invf 17704	. . . . . 6 ⊢ (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)⟶(𝑌𝐼𝑋))
19	18, 7	ffvelcdmd 7039	. . . . 5 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌𝐼𝑋))
20	17, 19	sseldd 3936	. . . 4 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌(Hom ‘𝐶)𝑋))
21	1, 14, 2, 4, 5, 6	isohom 17712	. . . . 5 ⊢ (𝜑 → (𝑋𝐼𝑌) ⊆ (𝑋(Hom ‘𝐶)𝑌))
22	21, 7	sseldd 3936	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
23	1, 14, 15, 16, 9, 4, 6, 5, 20, 22	issect2 17690	. . 3 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹 ↔ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) = ( 1 ‘𝑌)))
24		isocoinvid.o	. . . . . . 7 ⊢ ⚬ = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)
25	24	a1i 11	. . . . . 6 ⊢ (𝜑 → ⚬ = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌))
26	25	eqcomd 2743	. . . . 5 ⊢ (𝜑 → (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌) = ⚬ )
27	26	oveqd 7385	. . . 4 ⊢ (𝜑 → (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) = (𝐹 ⚬ ((𝑋𝑁𝑌)‘𝐹)))
28	27	eqeq1d 2739	. . 3 ⊢ (𝜑 → ((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) = ( 1 ‘𝑌) ↔ (𝐹 ⚬ ((𝑋𝑁𝑌)‘𝐹)) = ( 1 ‘𝑌)))
29	23, 28	bitrd 279	. 2 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹 ↔ (𝐹 ⚬ ((𝑋𝑁𝑌)‘𝐹)) = ( 1 ‘𝑌)))
30	13, 29	mpbid 232	1 ⊢ (𝜑 → (𝐹 ⚬ ((𝑋𝑁𝑌)‘𝐹)) = ( 1 ‘𝑌))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ⟨cop 4588   class class class wbr 5100  ‘cfv 6500  (class class class)co 7368  Basecbs 17148  Hom chom 17200  compcco 17201  Catccat 17599  Idccid 17600  Sectcsect 17680  Invcinv 17681  Isociso 17682

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-cat 17603  df-cid 17604  df-sect 17683  df-inv 17684  df-iso 17685

This theorem is referenced by:  upeu2lem  49381