Theorem funcinv 18077

Description: The image of an inverse under a functor is an inverse. (Contributed by Mario Carneiro, 3-Jan-2017.)

Hypotheses

Ref	Expression
funcinv.b	⊢ 𝐵 = (Base‘𝐷)
funcinv.s	⊢ 𝐼 = (Inv‘𝐷)
funcinv.t	⊢ 𝐽 = (Inv‘𝐸)
funcinv.f	⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
funcinv.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
funcinv.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
funcinv.m	⊢ (𝜑 → 𝑀(𝑋𝐼𝑌)𝑁)

Assertion

Ref	Expression
funcinv	⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁))

Proof of Theorem funcinv

Step	Hyp	Ref	Expression
1		funcinv.b	. . 3 ⊢ 𝐵 = (Base‘𝐷)
2		eqid 2763	. . 3 ⊢ (Sect‘𝐷) = (Sect‘𝐷)
3		eqid 2763	. . 3 ⊢ (Sect‘𝐸) = (Sect‘𝐸)
4		funcinv.f	. . 3 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
5		funcinv.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6		funcinv.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
7		funcinv.m	. . . . 5 ⊢ (𝜑 → 𝑀(𝑋𝐼𝑌)𝑁)
8		funcinv.s	. . . . . 6 ⊢ 𝐼 = (Inv‘𝐷)
9		df-br 5107	. . . . . . . . 9 ⊢ (𝐹(𝐷 Func 𝐸)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
10	4, 9	sylib 221	. . . . . . . 8 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
11		funcrcl 18067	. . . . . . . 8 ⊢ (⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
12	10, 11	syl 18	. . . . . . 7 ⊢ (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
13	12	simpld 500	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ Cat)
14	1, 8, 13, 5, 6, 2	isinv 17964	. . . . 5 ⊢ (𝜑 → (𝑀(𝑋𝐼𝑌)𝑁 ↔ (𝑀(𝑋(Sect‘𝐷)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐷)𝑋)𝑀)))
15	7, 14	mpbid 235	. . . 4 ⊢ (𝜑 → (𝑀(𝑋(Sect‘𝐷)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐷)𝑋)𝑀))
16	15	simpld 500	. . 3 ⊢ (𝜑 → 𝑀(𝑋(Sect‘𝐷)𝑌)𝑁)
17	1, 2, 3, 4, 5, 6, 16	funcsect 18076	. 2 ⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐸)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁))
18	15	simprd 501	. . 3 ⊢ (𝜑 → 𝑁(𝑌(Sect‘𝐷)𝑋)𝑀)
19	1, 2, 3, 4, 6, 5, 18	funcsect 18076	. 2 ⊢ (𝜑 → ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐸)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀))
20		eqid 2763	. . 3 ⊢ (Base‘𝐸) = (Base‘𝐸)
21		funcinv.t	. . 3 ⊢ 𝐽 = (Inv‘𝐸)
22	12	simprd 501	. . 3 ⊢ (𝜑 → 𝐸 ∈ Cat)
23	1, 20, 4	funcf1 18070	. . . 4 ⊢ (𝜑 → 𝐹:𝐵⟶(Base‘𝐸))
24	23, 5	ffvelcdmd 7109	. . 3 ⊢ (𝜑 → (𝐹‘𝑋) ∈ (Base‘𝐸))
25	23, 6	ffvelcdmd 7109	. . 3 ⊢ (𝜑 → (𝐹‘𝑌) ∈ (Base‘𝐸))
26	20, 21, 22, 24, 25, 3	isinv 17964	. 2 ⊢ (𝜑 → (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ↔ (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐸)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ∧ ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐸)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀))))
27	17, 19, 26	mpbir2and 726	1 ⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟨cop 4838   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  Basecbs 17416  Catccat 17867  Sectcsect 17948  Invcinv 17949   Func cfunc 18058

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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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-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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  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 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-map 8877  df-ixp 8954  df-sect 17951  df-inv 17952  df-func 18062

This theorem is used by:  funciso  18078