Theorem isocoinvid 17762

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 17759	. . 3 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹)(𝑌𝑁𝑋)𝐹)
9		eqid 2730	. . . . 5 ⊢ (Sect‘𝐶) = (Sect‘𝐶)
10	1, 3, 4, 6, 5, 9	isinv 17729	. . . 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 2730	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
15		eqid 2730	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
16		invcoisoid.1	. . . 4 ⊢ 1 = (Id‘𝐶)
17	1, 14, 2, 4, 6, 5	isohom 17745	. . . . 5 ⊢ (𝜑 → (𝑌𝐼𝑋) ⊆ (𝑌(Hom ‘𝐶)𝑋))
18	1, 3, 4, 5, 6, 2	invf 17737	. . . . . 6 ⊢ (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)⟶(𝑌𝐼𝑋))
19	18, 7	ffvelcdmd 7060	. . . . 5 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌𝐼𝑋))
20	17, 19	sseldd 3950	. . . 4 ⊢ (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌(Hom ‘𝐶)𝑋))
21	1, 14, 2, 4, 5, 6	isohom 17745	. . . . 5 ⊢ (𝜑 → (𝑋𝐼𝑌) ⊆ (𝑋(Hom ‘𝐶)𝑌))
22	21, 7	sseldd 3950	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
23	1, 14, 15, 16, 9, 4, 6, 5, 20, 22	issect2 17723	. . 3 ⊢ (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹 ↔ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) = ( 1 ‘𝑌)))
24		isocoinvid.o	. . . . . . 7 ⊢ ⚬ = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)
25	24	a1i 11	. . . . . 6 ⊢ (𝜑 → ⚬ = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌))
26	25	eqcomd 2736	. . . . 5 ⊢ (𝜑 → (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌) = ⚬ )
27	26	oveqd 7407	. . . 4 ⊢ (𝜑 → (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) = (𝐹 ⚬ ((𝑋𝑁𝑌)‘𝐹)))
28	27	eqeq1d 2732	. . 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 1540   ∈ wcel 2109  ⟨cop 4598   class class class wbr 5110  ‘cfv 6514  (class class class)co 7390  Basecbs 17186  Hom chom 17238  compcco 17239  Catccat 17632  Idccid 17633  Sectcsect 17713  Invcinv 17714  Isociso 17715

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7971  df-2nd 7972  df-cat 17636  df-cid 17637  df-sect 17716  df-inv 17717  df-iso 17718

This theorem is referenced by:  upeu2lem  49021