MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fthsect Structured version   Visualization version   GIF version

Theorem fthsect 18020
Description: A faithful functor reflects sections. (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 (𝜑𝑁 ∈ (𝑌𝐻𝑋))
fthsect.s 𝑆 = (Sect‘𝐶)
fthsect.t 𝑇 = (Sect‘𝐷)
Assertion
Ref Expression
fthsect (𝜑 → (𝑀(𝑋𝑆𝑌)𝑁 ↔ ((𝑋𝐺𝑌)‘𝑀)((𝐹𝑋)𝑇(𝐹𝑌))((𝑌𝐺𝑋)‘𝑁)))

Proof of Theorem fthsect
StepHypRef Expression
1 fthsect.b . . . 4 𝐵 = (Base‘𝐶)
2 fthsect.h . . . 4 𝐻 = (Hom ‘𝐶)
3 eqid 2762 . . . 4 (Hom ‘𝐷) = (Hom ‘𝐷)
4 fthsect.f . . . 4 (𝜑𝐹(𝐶 Faith 𝐷)𝐺)
5 fthsect.x . . . 4 (𝜑𝑋𝐵)
6 eqid 2762 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
7 fthfunc 18002 . . . . . . . . . 10 (𝐶 Faith 𝐷) ⊆ (𝐶 Func 𝐷)
87ssbri 5154 . . . . . . . . 9 (𝐹(𝐶 Faith 𝐷)𝐺𝐹(𝐶 Func 𝐷)𝐺)
94, 8syl 18 . . . . . . . 8 (𝜑𝐹(𝐶 Func 𝐷)𝐺)
10 df-br 5108 . . . . . . . 8 (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
119, 10sylib 221 . . . . . . 7 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
12 funcrcl 17956 . . . . . . 7 (⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
1311, 12syl 18 . . . . . 6 (𝜑 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
1413simpld 500 . . . . 5 (𝜑𝐶 ∈ Cat)
15 fthsect.y . . . . 5 (𝜑𝑌𝐵)
16 fthsect.m . . . . 5 (𝜑𝑀 ∈ (𝑋𝐻𝑌))
17 fthsect.n . . . . 5 (𝜑𝑁 ∈ (𝑌𝐻𝑋))
181, 2, 6, 14, 5, 15, 5, 16, 17catcocl 17777 . . . 4 (𝜑 → (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) ∈ (𝑋𝐻𝑋))
19 eqid 2762 . . . . 5 (Id‘𝐶) = (Id‘𝐶)
201, 2, 19, 14, 5catidcl 17774 . . . 4 (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋𝐻𝑋))
211, 2, 3, 4, 5, 5, 18, 20fthi 18013 . . 3 (𝜑 → (((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) ↔ (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋)))
22 eqid 2762 . . . . 5 (comp‘𝐷) = (comp‘𝐷)
231, 2, 6, 22, 9, 5, 15, 5, 16, 17funcco 17964 . . . 4 (𝜑 → ((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)))
24 eqid 2762 . . . . 5 (Id‘𝐷) = (Id‘𝐷)
251, 19, 24, 9, 5funcid 17963 . . . 4 (𝜑 → ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) = ((Id‘𝐷)‘(𝐹𝑋)))
2623, 25eqeq12d 2778 . . 3 (𝜑 → (((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) ↔ (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)) = ((Id‘𝐷)‘(𝐹𝑋))))
2721, 26bitr3d 284 . 2 (𝜑 → ((𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋) ↔ (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)) = ((Id‘𝐷)‘(𝐹𝑋))))
28 fthsect.s . . 3 𝑆 = (Sect‘𝐶)
291, 2, 6, 19, 28, 14, 5, 15, 16, 17issect2 17847 . 2 (𝜑 → (𝑀(𝑋𝑆𝑌)𝑁 ↔ (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋)))
30 eqid 2762 . . 3 (Base‘𝐷) = (Base‘𝐷)
31 fthsect.t . . 3 𝑇 = (Sect‘𝐷)
3213simprd 501 . . 3 (𝜑𝐷 ∈ Cat)
331, 30, 9funcf1 17959 . . . 4 (𝜑𝐹:𝐵⟶(Base‘𝐷))
3433, 5ffvelcdmd 7081 . . 3 (𝜑 → (𝐹𝑋) ∈ (Base‘𝐷))
3533, 15ffvelcdmd 7081 . . 3 (𝜑 → (𝐹𝑌) ∈ (Base‘𝐷))
361, 2, 3, 9, 5, 15funcf2 17961 . . . 4 (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶((𝐹𝑋)(Hom ‘𝐷)(𝐹𝑌)))
3736, 16ffvelcdmd 7081 . . 3 (𝜑 → ((𝑋𝐺𝑌)‘𝑀) ∈ ((𝐹𝑋)(Hom ‘𝐷)(𝐹𝑌)))
381, 2, 3, 9, 15, 5funcf2 17961 . . . 4 (𝜑 → (𝑌𝐺𝑋):(𝑌𝐻𝑋)⟶((𝐹𝑌)(Hom ‘𝐷)(𝐹𝑋)))
3938, 17ffvelcdmd 7081 . . 3 (𝜑 → ((𝑌𝐺𝑋)‘𝑁) ∈ ((𝐹𝑌)(Hom ‘𝐷)(𝐹𝑋)))
4030, 3, 22, 24, 31, 32, 34, 35, 37, 39issect2 17847 . 2 (𝜑 → (((𝑋𝐺𝑌)‘𝑀)((𝐹𝑋)𝑇(𝐹𝑌))((𝑌𝐺𝑋)‘𝑁) ↔ (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)) = ((Id‘𝐷)‘(𝐹𝑋))))
4127, 29, 403bitr4d 314 1 (𝜑 → (𝑀(𝑋𝑆𝑌)𝑁 ↔ ((𝑋𝐺𝑌)‘𝑀)((𝐹𝑋)𝑇(𝐹𝑌))((𝑌𝐺𝑋)‘𝑁)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  cop 4593   class class class wbr 5107  cfv 6537  (class class class)co 7416  Basecbs 17305  Hom chom 17357  compcco 17358  Catccat 17756  Idccid 17757  Sectcsect 17837   Func cfunc 17947   Faith cfth 17998
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-map 8831  df-ixp 8908  df-cat 17760  df-cid 17761  df-sect 17840  df-func 17951  df-fth 18000
This theorem is used by:  fthinv  18021
  Copyright terms: Public domain W3C validator