Theorem funcinv 17929

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 2761	. . 3 ⊢ (Sect‘𝐷) = (Sect‘𝐷)
3		eqid 2761	. . 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 5109	. . . . . . . . 9 ⊢ (𝐹(𝐷 Func 𝐸)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
10	4, 9	sylib 221	. . . . . . . 8 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
11		funcrcl 17919	. . . . . . . 8 ⊢ (⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
12	10, 11	syl 18	. . . . . . 7 ⊢ (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
13	12	simpld 499	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ Cat)
14	1, 8, 13, 5, 6, 2	isinv 17816	. . . . 5 ⊢ (𝜑 → (𝑀(𝑋𝐼𝑌)𝑁 ↔ (𝑀(𝑋(Sect‘𝐷)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐷)𝑋)𝑀)))
15	7, 14	mpbid 235	. . . 4 ⊢ (𝜑 → (𝑀(𝑋(Sect‘𝐷)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐷)𝑋)𝑀))
16	15	simpld 499	. . 3 ⊢ (𝜑 → 𝑀(𝑋(Sect‘𝐷)𝑌)𝑁)
17	1, 2, 3, 4, 5, 6, 16	funcsect 17928	. 2 ⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐸)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁))
18	15	simprd 500	. . 3 ⊢ (𝜑 → 𝑁(𝑌(Sect‘𝐷)𝑋)𝑀)
19	1, 2, 3, 4, 6, 5, 18	funcsect 17928	. 2 ⊢ (𝜑 → ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐸)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀))
20		eqid 2761	. . 3 ⊢ (Base‘𝐸) = (Base‘𝐸)
21		funcinv.t	. . 3 ⊢ 𝐽 = (Inv‘𝐸)
22	12	simprd 500	. . 3 ⊢ (𝜑 → 𝐸 ∈ Cat)
23	1, 20, 4	funcf1 17922	. . . 4 ⊢ (𝜑 → 𝐹:𝐵⟶(Base‘𝐸))
24	23, 5	ffvelcdmd 7080	. . 3 ⊢ (𝜑 → (𝐹‘𝑋) ∈ (Base‘𝐸))
25	23, 6	ffvelcdmd 7080	. . 3 ⊢ (𝜑 → (𝐹‘𝑌) ∈ (Base‘𝐸))
26	20, 21, 22, 24, 25, 3	isinv 17816	. 2 ⊢ (𝜑 → (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ↔ (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐸)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ∧ ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐸)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀))))
27	17, 19, 26	mpbir2and 725	1 ⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁))

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1568   ∈ wcel 2141  ⟨cop 4594   class class class wbr 5108  ‘cfv 6536  (class class class)co 7410  Basecbs 17268  Catccat 17719  Sectcsect 17800  Invcinv 17801   Func cfunc 17910

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7985  df-2nd 7986  df-map 8825  df-ixp 8895  df-sect 17803  df-inv 17804  df-func 17914

This theorem is referenced by:  funciso  17930