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

Theorem cofth 18162
Description: The composition of two faithful functors is faithful. Proposition 3.30(c) in [Adamek] p. 35. (Contributed by Mario Carneiro, 28-Jan-2017.)
Hypotheses
Ref Expression
cofth.f (𝜑 → 𝐹 ∈ (𝐶 Faith 𝐷))
cofth.g (𝜑 → 𝐺 ∈ (𝐷 Faith 𝐸))
Assertion
Ref Expression
cofth (𝜑 → (𝐺 ∘func 𝐹) ∈ (𝐶 Faith 𝐸))

Proof of Theorem cofth
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relfunc 18087 . . 3 Rel (𝐶 Func 𝐸)
2 fthfunc 18134 . . . . 5 (𝐶 Faith 𝐷) ⊆ (𝐶 Func 𝐷)
3 cofth.f . . . . 5 (𝜑 → 𝐹 ∈ (𝐶 Faith 𝐷))
42, 3sselid 3911 . . . 4 (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
5 fthfunc 18134 . . . . 5 (𝐷 Faith 𝐸) ⊆ (𝐷 Func 𝐸)
6 cofth.g . . . . 5 (𝜑 → 𝐺 ∈ (𝐷 Faith 𝐸))
75, 6sselid 3911 . . . 4 (𝜑 → 𝐺 ∈ (𝐷 Func 𝐸))
84, 7cofucl 18113 . . 3 (𝜑 → (𝐺 ∘func 𝐹) ∈ (𝐶 Func 𝐸))
9 1st2nd 8084 . . 3 ((Rel (𝐶 Func 𝐸) ∧ (𝐺 ∘func 𝐹) ∈ (𝐶 Func 𝐸)) → (𝐺 ∘func 𝐹) = ⟨(1st ‘(𝐺 ∘func 𝐹)), (2nd ‘(𝐺 ∘func 𝐹))⟩)
101, 8, 9sylancr 599 . 2 (𝜑 → (𝐺 ∘func 𝐹) = ⟨(1st ‘(𝐺 ∘func 𝐹)), (2nd ‘(𝐺 ∘func 𝐹))⟩)
11 1st2ndbr 8087 . . . . 5 ((Rel (𝐶 Func 𝐸) ∧ (𝐺 ∘func 𝐹) ∈ (𝐶 Func 𝐸)) → (1st ‘(𝐺 ∘func 𝐹))(𝐶 Func 𝐸)(2nd ‘(𝐺 ∘func 𝐹)))
121, 8, 11sylancr 599 . . . 4 (𝜑 → (1st ‘(𝐺 ∘func 𝐹))(𝐶 Func 𝐸)(2nd ‘(𝐺 ∘func 𝐹)))
13 eqid 2763 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
14 eqid 2763 . . . . . . . 8 (Hom ‘𝐷) = (Hom ‘𝐷)
15 eqid 2763 . . . . . . . 8 (Hom ‘𝐸) = (Hom ‘𝐸)
16 relfth 18136 . . . . . . . . 9 Rel (𝐷 Faith 𝐸)
176adantr 486 . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝐺 ∈ (𝐷 Faith 𝐸))
18 1st2ndbr 8087 . . . . . . . . 9 ((Rel (𝐷 Faith 𝐸) ∧ 𝐺 ∈ (𝐷 Faith 𝐸)) → (1st ‘𝐺)(𝐷 Faith 𝐸)(2nd ‘𝐺))
1916, 17, 18sylancr 599 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (1st ‘𝐺)(𝐷 Faith 𝐸)(2nd ‘𝐺))
20 eqid 2763 . . . . . . . . . 10 (Base‘𝐶) = (Base‘𝐶)
21 relfunc 18087 . . . . . . . . . . 11 Rel (𝐶 Func 𝐷)
224adantr 486 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝐹 ∈ (𝐶 Func 𝐷))
23 1st2ndbr 8087 . . . . . . . . . . 11 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
2421, 22, 23sylancr 599 . . . . . . . . . 10 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
2520, 13, 24funcf1 18091 . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (1st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷))
26 simprl 783 . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑥 ∈ (Base‘𝐶))
2725, 26ffvelcdmd 7117 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st ‘𝐹)‘𝑥) ∈ (Base‘𝐷))
28 simprr 785 . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑦 ∈ (Base‘𝐶))
2925, 28ffvelcdmd 7117 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st ‘𝐹)‘𝑦) ∈ (Base‘𝐷))
3013, 14, 15, 19, 27, 29fthf1 18144 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)):(((1st ‘𝐹)‘𝑥)(Hom ‘𝐷)((1st ‘𝐹)‘𝑦))⟶1-1(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))))
31 eqid 2763 . . . . . . . 8 (Hom ‘𝐶) = (Hom ‘𝐶)
32 relfth 18136 . . . . . . . . 9 Rel (𝐶 Faith 𝐷)
333adantr 486 . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝐹 ∈ (𝐶 Faith 𝐷))
34 1st2ndbr 8087 . . . . . . . . 9 ((Rel (𝐶 Faith 𝐷) ∧ 𝐹 ∈ (𝐶 Faith 𝐷)) → (1st ‘𝐹)(𝐶 Faith 𝐷)(2nd ‘𝐹))
3532, 33, 34sylancr 599 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (1st ‘𝐹)(𝐶 Faith 𝐷)(2nd ‘𝐹))
3620, 31, 14, 35, 26, 28fthf1 18144 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(2nd ‘𝐹)𝑦):(𝑥(Hom ‘𝐶)𝑦)⟶1-1(((1st ‘𝐹)‘𝑥)(Hom ‘𝐷)((1st ‘𝐹)‘𝑦)))
37 f1co 6821 . . . . . . 7 (((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)):(((1st ‘𝐹)‘𝑥)(Hom ‘𝐷)((1st ‘𝐹)‘𝑦))⟶1-1(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))) ∧ (𝑥(2nd ‘𝐹)𝑦):(𝑥(Hom ‘𝐶)𝑦)⟶1-1(((1st ‘𝐹)‘𝑥)(Hom ‘𝐷)((1st ‘𝐹)‘𝑦))) → ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)):(𝑥(Hom ‘𝐶)𝑦)⟶1-1(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))))
3830, 36, 37syl2anc 596 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)):(𝑥(Hom ‘𝐶)𝑦)⟶1-1(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))))
397adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝐺 ∈ (𝐷 Func 𝐸))
4020, 22, 39, 26, 28cofu2nd 18110 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦) = ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))
41 eqidd 2764 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(Hom ‘𝐶)𝑦) = (𝑥(Hom ‘𝐶)𝑦))
4220, 22, 39, 26cofu1 18109 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st ‘(𝐺 ∘func 𝐹))‘𝑥) = ((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥)))
4320, 22, 39, 28cofu1 18109 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st ‘(𝐺 ∘func 𝐹))‘𝑦) = ((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦)))
4442, 43oveq12d 7469 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦)) = (((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))))
4540, 41, 44f1eq123d 6846 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦):(𝑥(Hom ‘𝐶)𝑦)⟶1-1(((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦)) ↔ ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)):(𝑥(Hom ‘𝐶)𝑦)⟶1-1(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦)))))
4638, 45mpbird 260 . . . . 5 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦):(𝑥(Hom ‘𝐶)𝑦)⟶1-1(((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦)))
4746ralrimivva 3209 . . . 4 (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)(𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦):(𝑥(Hom ‘𝐶)𝑦)⟶1-1(((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦)))
4820, 31, 15isfth2 18142 . . . 4 ((1st ‘(𝐺 ∘func 𝐹))(𝐶 Faith 𝐸)(2nd ‘(𝐺 ∘func 𝐹)) ↔ ((1st ‘(𝐺 ∘func 𝐹))(𝐶 Func 𝐸)(2nd ‘(𝐺 ∘func 𝐹)) ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)(𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦):(𝑥(Hom ‘𝐶)𝑦)⟶1-1(((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦))))
4912, 47, 48sylanbrc 595 . . 3 (𝜑 → (1st ‘(𝐺 ∘func 𝐹))(𝐶 Faith 𝐸)(2nd ‘(𝐺 ∘func 𝐹)))
50 df-br 5109 . . 3 ((1st ‘(𝐺 ∘func 𝐹))(𝐶 Faith 𝐸)(2nd ‘(𝐺 ∘func 𝐹)) ↔ ⟨(1st ‘(𝐺 ∘func 𝐹)), (2nd ‘(𝐺 ∘func 𝐹))⟩ ∈ (𝐶 Faith 𝐸))
5149, 50sylib 221 . 2 (𝜑 → ⟨(1st ‘(𝐺 ∘func 𝐹)), (2nd ‘(𝐺 ∘func 𝐹))⟩ ∈ (𝐶 Faith 𝐸))
5210, 51eqeltrd 2864 1 (𝜑 → (𝐺 ∘func 𝐹) ∈ (𝐶 Faith 𝐸))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ⟨cop 4840   class class class wbr 5108   ∘ ccom 5662  Rel wrel 5663  ⟶1-1wf1 6563  ‘cfv 6566  (class class class)co 7451  1st c1st 8033  2nd c2nd 8034  Basecbs 17431  Hom chom 17483   Func cfunc 18079   ∘func ccofu 18081   Faith cfth 18130
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-ixp 8964  df-cat 17892  df-cid 17893  df-func 18083  df-cofu 18085  df-fth 18132
This theorem is used by:  coffth  18163
  Copyright terms: Public domain W3C validator