Theorem fthinv 17853

Description: A faithful functor reflects inverses. (Contributed by Mario Carneiro, 27-Jan-2017.)

Hypotheses

Ref	Expression
fthsect.b	⊢ 𝐵 = (Base‘𝐶)
fthsect.h	⊢ 𝐻 = (Hom ‘𝐶)
fthsect.f	⊢ (𝜑 → 𝐹(𝐶 Faith 𝐷)𝐺)
fthsect.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
fthsect.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
fthsect.m	⊢ (𝜑 → 𝑀 ∈ (𝑋𝐻𝑌))
fthsect.n	⊢ (𝜑 → 𝑁 ∈ (𝑌𝐻𝑋))
fthinv.s	⊢ 𝐼 = (Inv‘𝐶)
fthinv.t	⊢ 𝐽 = (Inv‘𝐷)

Assertion

Ref	Expression
fthinv	⊢ (𝜑 → (𝑀(𝑋𝐼𝑌)𝑁 ↔ ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁)))

Proof of Theorem fthinv

Step	Hyp	Ref	Expression
1		fthsect.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
2		fthsect.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐶)
3		fthsect.f	. . . 4 ⊢ (𝜑 → 𝐹(𝐶 Faith 𝐷)𝐺)
4		fthsect.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
5		fthsect.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
6		fthsect.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ (𝑋𝐻𝑌))
7		fthsect.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (𝑌𝐻𝑋))
8		eqid 2729	. . . 4 ⊢ (Sect‘𝐶) = (Sect‘𝐶)
9		eqid 2729	. . . 4 ⊢ (Sect‘𝐷) = (Sect‘𝐷)
10	1, 2, 3, 4, 5, 6, 7, 8, 9	fthsect 17852	. . 3 ⊢ (𝜑 → (𝑀(𝑋(Sect‘𝐶)𝑌)𝑁 ↔ ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐷)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁)))
11	1, 2, 3, 5, 4, 7, 6, 8, 9	fthsect 17852	. . 3 ⊢ (𝜑 → (𝑁(𝑌(Sect‘𝐶)𝑋)𝑀 ↔ ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐷)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀)))
12	10, 11	anbi12d 632	. 2 ⊢ (𝜑 → ((𝑀(𝑋(Sect‘𝐶)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐶)𝑋)𝑀) ↔ (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐷)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ∧ ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐷)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀))))
13		fthinv.s	. . 3 ⊢ 𝐼 = (Inv‘𝐶)
14		fthfunc 17834	. . . . . . . 8 ⊢ (𝐶 Faith 𝐷) ⊆ (𝐶 Func 𝐷)
15	14	ssbri 5140	. . . . . . 7 ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 → 𝐹(𝐶 Func 𝐷)𝐺)
16	3, 15	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺)
17		df-br 5096	. . . . . 6 ⊢ (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
18	16, 17	sylib 218	. . . . 5 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
19		funcrcl 17788	. . . . 5 ⊢ (⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
20	18, 19	syl 17	. . . 4 ⊢ (𝜑 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
21	20	simpld 494	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
22	1, 13, 21, 4, 5, 8	isinv 17685	. 2 ⊢ (𝜑 → (𝑀(𝑋𝐼𝑌)𝑁 ↔ (𝑀(𝑋(Sect‘𝐶)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐶)𝑋)𝑀)))
23		eqid 2729	. . 3 ⊢ (Base‘𝐷) = (Base‘𝐷)
24		fthinv.t	. . 3 ⊢ 𝐽 = (Inv‘𝐷)
25	20	simprd 495	. . 3 ⊢ (𝜑 → 𝐷 ∈ Cat)
26	1, 23, 16	funcf1 17791	. . . 4 ⊢ (𝜑 → 𝐹:𝐵⟶(Base‘𝐷))
27	26, 4	ffvelcdmd 7023	. . 3 ⊢ (𝜑 → (𝐹‘𝑋) ∈ (Base‘𝐷))
28	26, 5	ffvelcdmd 7023	. . 3 ⊢ (𝜑 → (𝐹‘𝑌) ∈ (Base‘𝐷))
29	23, 24, 25, 27, 28, 9	isinv 17685	. 2 ⊢ (𝜑 → (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ↔ (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐷)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ∧ ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐷)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀))))
30	12, 22, 29	3bitr4d 311	1 ⊢ (𝜑 → (𝑀(𝑋𝐼𝑌)𝑁 ↔ ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ⟨cop 4585   class class class wbr 5095  ‘cfv 6486  (class class class)co 7353  Basecbs 17138  Hom chom 17190  Catccat 17588  Sectcsect 17669  Invcinv 17670   Func cfunc 17779   Faith cfth 17830

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 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675

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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3345  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-1st 7931  df-2nd 7932  df-map 8762  df-ixp 8832  df-cat 17592  df-cid 17593  df-sect 17672  df-inv 17673  df-func 17783  df-fth 17832

This theorem is referenced by:  ffthiso  17856