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

Theorem fthsect 17852
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 2729 . . . 4 (Hom ‘𝐷) = (Hom ‘𝐷)
4 fthsect.f . . . 4 (𝜑𝐹(𝐶 Faith 𝐷)𝐺)
5 fthsect.x . . . 4 (𝜑𝑋𝐵)
6 eqid 2729 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
7 fthfunc 17834 . . . . . . . . . 10 (𝐶 Faith 𝐷) ⊆ (𝐶 Func 𝐷)
87ssbri 5140 . . . . . . . . 9 (𝐹(𝐶 Faith 𝐷)𝐺𝐹(𝐶 Func 𝐷)𝐺)
94, 8syl 17 . . . . . . . 8 (𝜑𝐹(𝐶 Func 𝐷)𝐺)
10 df-br 5096 . . . . . . . 8 (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
119, 10sylib 218 . . . . . . 7 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
12 funcrcl 17788 . . . . . . 7 (⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
1311, 12syl 17 . . . . . 6 (𝜑 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
1413simpld 494 . . . . 5 (𝜑𝐶 ∈ Cat)
15 fthsect.y . . . . 5 (𝜑𝑌𝐵)
16 fthsect.m . . . . 5 (𝜑𝑀 ∈ (𝑋𝐻𝑌))
17 fthsect.n . . . . 5 (𝜑𝑁 ∈ (𝑌𝐻𝑋))
181, 2, 6, 14, 5, 15, 5, 16, 17catcocl 17609 . . . 4 (𝜑 → (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) ∈ (𝑋𝐻𝑋))
19 eqid 2729 . . . . 5 (Id‘𝐶) = (Id‘𝐶)
201, 2, 19, 14, 5catidcl 17606 . . . 4 (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋𝐻𝑋))
211, 2, 3, 4, 5, 5, 18, 20fthi 17845 . . 3 (𝜑 → (((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) ↔ (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋)))
22 eqid 2729 . . . . 5 (comp‘𝐷) = (comp‘𝐷)
231, 2, 6, 22, 9, 5, 15, 5, 16, 17funcco 17796 . . . 4 (𝜑 → ((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)))
24 eqid 2729 . . . . 5 (Id‘𝐷) = (Id‘𝐷)
251, 19, 24, 9, 5funcid 17795 . . . 4 (𝜑 → ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) = ((Id‘𝐷)‘(𝐹𝑋)))
2623, 25eqeq12d 2745 . . 3 (𝜑 → (((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) ↔ (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)) = ((Id‘𝐷)‘(𝐹𝑋))))
2721, 26bitr3d 281 . 2 (𝜑 → ((𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋) ↔ (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)) = ((Id‘𝐷)‘(𝐹𝑋))))
28 fthsect.s . . 3 𝑆 = (Sect‘𝐶)
291, 2, 6, 19, 28, 14, 5, 15, 16, 17issect2 17679 . 2 (𝜑 → (𝑀(𝑋𝑆𝑌)𝑁 ↔ (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋)))
30 eqid 2729 . . 3 (Base‘𝐷) = (Base‘𝐷)
31 fthsect.t . . 3 𝑇 = (Sect‘𝐷)
3213simprd 495 . . 3 (𝜑𝐷 ∈ Cat)
331, 30, 9funcf1 17791 . . . 4 (𝜑𝐹:𝐵⟶(Base‘𝐷))
3433, 5ffvelcdmd 7023 . . 3 (𝜑 → (𝐹𝑋) ∈ (Base‘𝐷))
3533, 15ffvelcdmd 7023 . . 3 (𝜑 → (𝐹𝑌) ∈ (Base‘𝐷))
361, 2, 3, 9, 5, 15funcf2 17793 . . . 4 (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶((𝐹𝑋)(Hom ‘𝐷)(𝐹𝑌)))
3736, 16ffvelcdmd 7023 . . 3 (𝜑 → ((𝑋𝐺𝑌)‘𝑀) ∈ ((𝐹𝑋)(Hom ‘𝐷)(𝐹𝑌)))
381, 2, 3, 9, 15, 5funcf2 17793 . . . 4 (𝜑 → (𝑌𝐺𝑋):(𝑌𝐻𝑋)⟶((𝐹𝑌)(Hom ‘𝐷)(𝐹𝑋)))
3938, 17ffvelcdmd 7023 . . 3 (𝜑 → ((𝑌𝐺𝑋)‘𝑁) ∈ ((𝐹𝑌)(Hom ‘𝐷)(𝐹𝑋)))
4030, 3, 22, 24, 31, 32, 34, 35, 37, 39issect2 17679 . 2 (𝜑 → (((𝑋𝐺𝑌)‘𝑀)((𝐹𝑋)𝑇(𝐹𝑌))((𝑌𝐺𝑋)‘𝑁) ↔ (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)) = ((Id‘𝐷)‘(𝐹𝑋))))
4127, 29, 403bitr4d 311 1 (𝜑 → (𝑀(𝑋𝑆𝑌)𝑁 ↔ ((𝑋𝐺𝑌)‘𝑀)((𝐹𝑋)𝑇(𝐹𝑌))((𝑌𝐺𝑋)‘𝑁)))
Colors of variables: wff setvar class
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  compcco 17191  Catccat 17588  Idccid 17589  Sectcsect 17669   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-func 17783  df-fth 17832
This theorem is referenced by:  fthinv  17853
  Copyright terms: Public domain W3C validator