Theorem funcinv 17887

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

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1559   ∈ wcel 2141  ⟨cop 4587   class class class wbr 5099  ‘cfv 6515  (class class class)co 7390  Basecbs 17226  Catccat 17677  Sectcsect 17758  Invcinv 17759   Func cfunc 17868

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7712

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7964  df-2nd 7965  df-map 8803  df-ixp 8874  df-sect 17761  df-inv 17762  df-func 17872

This theorem is referenced by:  funciso  17888