Theorem fthinv 17973

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 2737	. . . 4 ⊢ (Sect‘𝐶) = (Sect‘𝐶)
9		eqid 2737	. . . 4 ⊢ (Sect‘𝐷) = (Sect‘𝐷)
10	1, 2, 3, 4, 5, 6, 7, 8, 9	fthsect 17972	. . 3 ⊢ (𝜑 → (𝑀(𝑋(Sect‘𝐶)𝑌)𝑁 ↔ ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐷)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁)))
11	1, 2, 3, 5, 4, 7, 6, 8, 9	fthsect 17972	. . 3 ⊢ (𝜑 → (𝑁(𝑌(Sect‘𝐶)𝑋)𝑀 ↔ ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐷)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀)))
12	10, 11	anbi12d 632	. 2 ⊢ (𝜑 → ((𝑀(𝑋(Sect‘𝐶)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐶)𝑋)𝑀) ↔ (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐷)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ∧ ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐷)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀))))
13		fthinv.s	. . 3 ⊢ 𝐼 = (Inv‘𝐶)
14		fthfunc 17954	. . . . . . . 8 ⊢ (𝐶 Faith 𝐷) ⊆ (𝐶 Func 𝐷)
15	14	ssbri 5188	. . . . . . 7 ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 → 𝐹(𝐶 Func 𝐷)𝐺)
16	3, 15	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺)
17		df-br 5144	. . . . . 6 ⊢ (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
18	16, 17	sylib 218	. . . . 5 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
19		funcrcl 17908	. . . . 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 17804	. 2 ⊢ (𝜑 → (𝑀(𝑋𝐼𝑌)𝑁 ↔ (𝑀(𝑋(Sect‘𝐶)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐶)𝑋)𝑀)))
23		eqid 2737	. . 3 ⊢ (Base‘𝐷) = (Base‘𝐷)
24		fthinv.t	. . 3 ⊢ 𝐽 = (Inv‘𝐷)
25	20	simprd 495	. . 3 ⊢ (𝜑 → 𝐷 ∈ Cat)
26	1, 23, 16	funcf1 17911	. . . 4 ⊢ (𝜑 → 𝐹:𝐵⟶(Base‘𝐷))
27	26, 4	ffvelcdmd 7105	. . 3 ⊢ (𝜑 → (𝐹‘𝑋) ∈ (Base‘𝐷))
28	26, 5	ffvelcdmd 7105	. . 3 ⊢ (𝜑 → (𝐹‘𝑌) ∈ (Base‘𝐷))
29	23, 24, 25, 27, 28, 9	isinv 17804	. 2 ⊢ (𝜑 → (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ↔ (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐷)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ∧ ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐷)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀))))
30	12, 22, 29	3bitr4d 311	1 ⊢ (𝜑 → (𝑀(𝑋𝐼𝑌)𝑁 ↔ ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ⟨cop 4632   class class class wbr 5143  ‘cfv 6561  (class class class)co 7431  Basecbs 17247  Hom chom 17308  Catccat 17707  Sectcsect 17788  Invcinv 17789   Func cfunc 17899   Faith cfth 17950

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8014  df-2nd 8015  df-map 8868  df-ixp 8938  df-cat 17711  df-cid 17712  df-sect 17791  df-inv 17792  df-func 17903  df-fth 17952

This theorem is referenced by:  ffthiso  17976