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

Theorem fthsect 17932
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 2752 . . . 4 (Hom ‘𝐷) = (Hom ‘𝐷)
4 fthsect.f . . . 4 (𝜑𝐹(𝐶 Faith 𝐷)𝐺)
5 fthsect.x . . . 4 (𝜑𝑋𝐵)
6 eqid 2752 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
7 fthfunc 17914 . . . . . . . . . 10 (𝐶 Faith 𝐷) ⊆ (𝐶 Func 𝐷)
87ssbri 5135 . . . . . . . . 9 (𝐹(𝐶 Faith 𝐷)𝐺𝐹(𝐶 Func 𝐷)𝐺)
94, 8syl 17 . . . . . . . 8 (𝜑𝐹(𝐶 Func 𝐷)𝐺)
10 df-br 5091 . . . . . . . 8 (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
119, 10sylib 220 . . . . . . 7 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
12 funcrcl 17868 . . . . . . 7 (⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
1311, 12syl 17 . . . . . 6 (𝜑 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
1413simpld 497 . . . . 5 (𝜑𝐶 ∈ Cat)
15 fthsect.y . . . . 5 (𝜑𝑌𝐵)
16 fthsect.m . . . . 5 (𝜑𝑀 ∈ (𝑋𝐻𝑌))
17 fthsect.n . . . . 5 (𝜑𝑁 ∈ (𝑌𝐻𝑋))
181, 2, 6, 14, 5, 15, 5, 16, 17catcocl 17689 . . . 4 (𝜑 → (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) ∈ (𝑋𝐻𝑋))
19 eqid 2752 . . . . 5 (Id‘𝐶) = (Id‘𝐶)
201, 2, 19, 14, 5catidcl 17686 . . . 4 (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋𝐻𝑋))
211, 2, 3, 4, 5, 5, 18, 20fthi 17925 . . 3 (𝜑 → (((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) ↔ (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋)))
22 eqid 2752 . . . . 5 (comp‘𝐷) = (comp‘𝐷)
231, 2, 6, 22, 9, 5, 15, 5, 16, 17funcco 17876 . . . 4 (𝜑 → ((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)))
24 eqid 2752 . . . . 5 (Id‘𝐷) = (Id‘𝐷)
251, 19, 24, 9, 5funcid 17875 . . . 4 (𝜑 → ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) = ((Id‘𝐷)‘(𝐹𝑋)))
2623, 25eqeq12d 2768 . . 3 (𝜑 → (((𝑋𝐺𝑋)‘(𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀)) = ((𝑋𝐺𝑋)‘((Id‘𝐶)‘𝑋)) ↔ (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)) = ((Id‘𝐷)‘(𝐹𝑋))))
2721, 26bitr3d 283 . 2 (𝜑 → ((𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋) ↔ (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)) = ((Id‘𝐷)‘(𝐹𝑋))))
28 fthsect.s . . 3 𝑆 = (Sect‘𝐶)
291, 2, 6, 19, 28, 14, 5, 15, 16, 17issect2 17759 . 2 (𝜑 → (𝑀(𝑋𝑆𝑌)𝑁 ↔ (𝑁(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝑀) = ((Id‘𝐶)‘𝑋)))
30 eqid 2752 . . 3 (Base‘𝐷) = (Base‘𝐷)
31 fthsect.t . . 3 𝑇 = (Sect‘𝐷)
3213simprd 498 . . 3 (𝜑𝐷 ∈ Cat)
331, 30, 9funcf1 17871 . . . 4 (𝜑𝐹:𝐵⟶(Base‘𝐷))
3433, 5ffvelcdmd 7051 . . 3 (𝜑 → (𝐹𝑋) ∈ (Base‘𝐷))
3533, 15ffvelcdmd 7051 . . 3 (𝜑 → (𝐹𝑌) ∈ (Base‘𝐷))
361, 2, 3, 9, 5, 15funcf2 17873 . . . 4 (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶((𝐹𝑋)(Hom ‘𝐷)(𝐹𝑌)))
3736, 16ffvelcdmd 7051 . . 3 (𝜑 → ((𝑋𝐺𝑌)‘𝑀) ∈ ((𝐹𝑋)(Hom ‘𝐷)(𝐹𝑌)))
381, 2, 3, 9, 15, 5funcf2 17873 . . . 4 (𝜑 → (𝑌𝐺𝑋):(𝑌𝐻𝑋)⟶((𝐹𝑌)(Hom ‘𝐷)(𝐹𝑋)))
3938, 17ffvelcdmd 7051 . . 3 (𝜑 → ((𝑌𝐺𝑋)‘𝑁) ∈ ((𝐹𝑌)(Hom ‘𝐷)(𝐹𝑋)))
4030, 3, 22, 24, 31, 32, 34, 35, 37, 39issect2 17759 . 2 (𝜑 → (((𝑋𝐺𝑌)‘𝑀)((𝐹𝑋)𝑇(𝐹𝑌))((𝑌𝐺𝑋)‘𝑁) ↔ (((𝑌𝐺𝑋)‘𝑁)(⟨(𝐹𝑋), (𝐹𝑌)⟩(comp‘𝐷)(𝐹𝑋))((𝑋𝐺𝑌)‘𝑀)) = ((Id‘𝐷)‘(𝐹𝑋))))
4127, 29, 403bitr4d 313 1 (𝜑 → (𝑀(𝑋𝑆𝑌)𝑁 ↔ ((𝑋𝐺𝑌)‘𝑀)((𝐹𝑋)𝑇(𝐹𝑌))((𝑌𝐺𝑋)‘𝑁)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1550  wcel 2132  cop 4578   class class class wbr 5090  cfv 6506  (class class class)co 7381  Basecbs 17217  Hom chom 17269  compcco 17270  Catccat 17668  Idccid 17669  Sectcsect 17749   Func cfunc 17859   Faith cfth 17910
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pow 5312  ax-pr 5380  ax-un 7703
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-rmo 3357  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-id 5531  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-riota 7338  df-ov 7384  df-oprab 7385  df-mpo 7386  df-1st 7955  df-2nd 7956  df-map 8794  df-ixp 8865  df-cat 17672  df-cid 17673  df-sect 17752  df-func 17863  df-fth 17912
This theorem is referenced by:  fthinv  17933
  Copyright terms: Public domain W3C validator