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

Theorem fthsect 18131
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 2763 . . . 4 (Hom ‘𝐷) = (Hom ‘𝐷)
4 fthsect.f . . . 4 (𝜑 → 𝐹(𝐶 Faith 𝐷)𝐺)
5 fthsect.x . . . 4 (𝜑 → 𝑋 ∈ 𝐵)
6 eqid 2763 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
7 fthfunc 18113 . . . . . . . . . 10 (𝐶 Faith 𝐷) ⊆ (𝐶 Func 𝐷)
87ssbri 5153 . . . . . . . . 9 (𝐹(𝐶 Faith 𝐷)𝐺 → 𝐹(𝐶 Func 𝐷)𝐺)
94, 8syl 18 . . . . . . . 8 (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺)
10 df-br 5107 . . . . . . . 8 (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
119, 10sylib 221 . . . . . . 7 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
12 funcrcl 18067 . . . . . . 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 17888 . . . 4 (𝜑 → (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) ∈ (𝑋𝐻𝑋))
19 eqid 2763 . . . . 5 (Id‘𝐶) = (Id‘𝐶)
201, 2, 19, 14, 5catidcl 17885 . . . 4 (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋𝐻𝑋))
211, 2, 3, 4, 5, 5, 18, 20fthi 18124 . . 3 (𝜑 → (((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) ↔ (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋)))
22 eqid 2763 . . . . 5 (comp‘𝐷) = (comp‘𝐷)
231, 2, 6, 22, 9, 5, 15, 5, 16, 17funcco 18075 . . . 4 (𝜑 → ((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩(comp‘𝐷)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀)))
24 eqid 2763 . . . . 5 (Id‘𝐷) = (Id‘𝐷)
251, 19, 24, 9, 5funcid 18074 . . . 4 (𝜑 → ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) = ((Id‘𝐷)‘(𝐹‘𝑋)))
2623, 25eqeq12d 2779 . . 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 17958 . 2 (𝜑 → (𝑀(𝑋𝑆𝑌)𝑁 ↔ (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋)))
30 eqid 2763 . . 3 (Base‘𝐷) = (Base‘𝐷)
31 fthsect.t . . 3 𝑇 = (Sect‘𝐷)
3213simprd 501 . . 3 (𝜑 → 𝐷 ∈ Cat)
331, 30, 9funcf1 18070 . . . 4 (𝜑 → 𝐹:𝐵⟶(Base‘𝐷))
3433, 5ffvelcdmd 7109 . . 3 (𝜑 → (𝐹‘𝑋) ∈ (Base‘𝐷))
3533, 15ffvelcdmd 7109 . . 3 (𝜑 → (𝐹‘𝑌) ∈ (Base‘𝐷))
361, 2, 3, 9, 5, 15funcf2 18072 . . . 4 (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶((𝐹‘𝑋)(Hom ‘𝐷)(𝐹‘𝑌)))
3736, 16ffvelcdmd 7109 . . 3 (𝜑 → ((𝑋𝐺𝑌)‘𝑀) ∈ ((𝐹‘𝑋)(Hom ‘𝐷)(𝐹‘𝑌)))
381, 2, 3, 9, 15, 5funcf2 18072 . . . 4 (𝜑 → (𝑌𝐺𝑋):(𝑌𝐻𝑋)⟶((𝐹‘𝑌)(Hom ‘𝐷)(𝐹‘𝑋)))
3938, 17ffvelcdmd 7109 . . 3 (𝜑 → ((𝑌𝐺𝑋)‘𝑁) ∈ ((𝐹‘𝑌)(Hom ‘𝐷)(𝐹‘𝑋)))
4030, 3, 22, 24, 31, 32, 34, 35, 37, 39issect2 17958 . 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 2147  ⟨cop 4838   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  Basecbs 17416  Hom chom 17468  compcco 17469  Catccat 17867  Idccid 17868  Sectcsect 17948   Func cfunc 18058   Faith cfth 18109
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-map 8877  df-ixp 8954  df-cat 17871  df-cid 17872  df-sect 17951  df-func 18062  df-fth 18111
This theorem is used by:  fthinv  18132
  Copyright terms: Public domain W3C validator