Theorem cofull 18111

Description: The composition of two full functors is full. Proposition 3.30(d) in [Adamek] p. 35. (Contributed by Mario Carneiro, 28-Jan-2017.)

Hypotheses

Ref	Expression
cofull.f	⊢ (𝜑 → 𝐹 ∈ (𝐶 Full 𝐷))
cofull.g	⊢ (𝜑 → 𝐺 ∈ (𝐷 Full 𝐸))

Assertion

Ref	Expression
cofull	⊢ (𝜑 → (𝐺 ∘func 𝐹) ∈ (𝐶 Full 𝐸))

Proof of Theorem cofull

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relfunc 18037	. . 3 ⊢ Rel (𝐶 Func 𝐸)
2		fullfunc 18083	. . . . 5 ⊢ (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)
3		cofull.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Full 𝐷))
4	2, 3	sselid 3929	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
5		fullfunc 18083	. . . . 5 ⊢ (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
6		cofull.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ (𝐷 Full 𝐸))
7	5, 6	sselid 3929	. . . 4 ⊢ (𝜑 → 𝐺 ∈ (𝐷 Func 𝐸))
8	4, 7	cofucl 18063	. . 3 ⊢ (𝜑 → (𝐺 ∘func 𝐹) ∈ (𝐶 Func 𝐸))
9		1st2nd 8050	. . 3 ⊢ ((Rel (𝐶 Func 𝐸) ∧ (𝐺 ∘func 𝐹) ∈ (𝐶 Func 𝐸)) → (𝐺 ∘func 𝐹) = ⟨(1st ‘(𝐺 ∘func 𝐹)), (2nd ‘(𝐺 ∘func 𝐹))⟩)
10	1, 8, 9	sylancr 599	. 2 ⊢ (𝜑 → (𝐺 ∘func 𝐹) = ⟨(1st ‘(𝐺 ∘func 𝐹)), (2nd ‘(𝐺 ∘func 𝐹))⟩)
11		1st2ndbr 8053	. . . . 5 ⊢ ((Rel (𝐶 Func 𝐸) ∧ (𝐺 ∘func 𝐹) ∈ (𝐶 Func 𝐸)) → (1st ‘(𝐺 ∘func 𝐹))(𝐶 Func 𝐸)(2nd ‘(𝐺 ∘func 𝐹)))
12	1, 8, 11	sylancr 599	. . . 4 ⊢ (𝜑 → (1st ‘(𝐺 ∘func 𝐹))(𝐶 Func 𝐸)(2nd ‘(𝐺 ∘func 𝐹)))
13		eqid 2761	. . . . . . . 8 ⊢ (Base‘𝐷) = (Base‘𝐷)
14		eqid 2761	. . . . . . . 8 ⊢ (Hom ‘𝐸) = (Hom ‘𝐸)
15		eqid 2761	. . . . . . . 8 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
16		relfull 18085	. . . . . . . . 9 ⊢ Rel (𝐷 Full 𝐸)
17	6	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝐺 ∈ (𝐷 Full 𝐸))
18		1st2ndbr 8053	. . . . . . . . 9 ⊢ ((Rel (𝐷 Full 𝐸) ∧ 𝐺 ∈ (𝐷 Full 𝐸)) → (1st ‘𝐺)(𝐷 Full 𝐸)(2nd ‘𝐺))
19	16, 17, 18	sylancr 599	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (1st ‘𝐺)(𝐷 Full 𝐸)(2nd ‘𝐺))
20		eqid 2761	. . . . . . . . . 10 ⊢ (Base‘𝐶) = (Base‘𝐶)
21		relfunc 18037	. . . . . . . . . . 11 ⊢ Rel (𝐶 Func 𝐷)
22	4	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝐹 ∈ (𝐶 Func 𝐷))
23		1st2ndbr 8053	. . . . . . . . . . 11 ⊢ ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
24	21, 22, 23	sylancr 599	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
25	20, 13, 24	funcf1 18041	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (1st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷))
26		simprl 783	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑥 ∈ (Base‘𝐶))
27	25, 26	ffvelcdmd 7085	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st ‘𝐹)‘𝑥) ∈ (Base‘𝐷))
28		simprr 785	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑦 ∈ (Base‘𝐶))
29	25, 28	ffvelcdmd 7085	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st ‘𝐹)‘𝑦) ∈ (Base‘𝐷))
30	13, 14, 15, 19, 27, 29	fullfo 18089	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)):(((1st ‘𝐹)‘𝑥)(Hom ‘𝐷)((1st ‘𝐹)‘𝑦))–onto→(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))))
31		eqid 2761	. . . . . . . 8 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
32		relfull 18085	. . . . . . . . 9 ⊢ Rel (𝐶 Full 𝐷)
33	3	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝐹 ∈ (𝐶 Full 𝐷))
34		1st2ndbr 8053	. . . . . . . . 9 ⊢ ((Rel (𝐶 Full 𝐷) ∧ 𝐹 ∈ (𝐶 Full 𝐷)) → (1st ‘𝐹)(𝐶 Full 𝐷)(2nd ‘𝐹))
35	32, 33, 34	sylancr 599	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (1st ‘𝐹)(𝐶 Full 𝐷)(2nd ‘𝐹))
36	20, 15, 31, 35, 26, 28	fullfo 18089	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(2nd ‘𝐹)𝑦):(𝑥(Hom ‘𝐶)𝑦)–onto→(((1st ‘𝐹)‘𝑥)(Hom ‘𝐷)((1st ‘𝐹)‘𝑦)))
37		foco 6810	. . . . . . 7 ⊢ (((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)):(((1st ‘𝐹)‘𝑥)(Hom ‘𝐷)((1st ‘𝐹)‘𝑦))–onto→(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))) ∧ (𝑥(2nd ‘𝐹)𝑦):(𝑥(Hom ‘𝐶)𝑦)–onto→(((1st ‘𝐹)‘𝑥)(Hom ‘𝐷)((1st ‘𝐹)‘𝑦))) → ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)):(𝑥(Hom ‘𝐶)𝑦)–onto→(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))))
38	30, 36, 37	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)):(𝑥(Hom ‘𝐶)𝑦)–onto→(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))))
39	7	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝐺 ∈ (𝐷 Func 𝐸))
40	20, 22, 39, 26, 28	cofu2nd 18060	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦) = ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))
41		eqidd 2762	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(Hom ‘𝐶)𝑦) = (𝑥(Hom ‘𝐶)𝑦))
42	20, 22, 39, 26	cofu1 18059	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st ‘(𝐺 ∘func 𝐹))‘𝑥) = ((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥)))
43	20, 22, 39, 28	cofu1 18059	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st ‘(𝐺 ∘func 𝐹))‘𝑦) = ((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦)))
44	42, 43	oveq12d 7438	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦)) = (((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦))))
45	40, 41, 44	foeq123d 6817	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦):(𝑥(Hom ‘𝐶)𝑦)–onto→(((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦)) ↔ ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)):(𝑥(Hom ‘𝐶)𝑦)–onto→(((1st ‘𝐺)‘((1st ‘𝐹)‘𝑥))(Hom ‘𝐸)((1st ‘𝐺)‘((1st ‘𝐹)‘𝑦)))))
46	38, 45	mpbird 260	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦):(𝑥(Hom ‘𝐶)𝑦)–onto→(((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦)))
47	46	ralrimivva 3206	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)(𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦):(𝑥(Hom ‘𝐶)𝑦)–onto→(((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦)))
48	20, 14, 31	isfull2 18088	. . . 4 ⊢ ((1st ‘(𝐺 ∘func 𝐹))(𝐶 Full 𝐸)(2nd ‘(𝐺 ∘func 𝐹)) ↔ ((1st ‘(𝐺 ∘func 𝐹))(𝐶 Func 𝐸)(2nd ‘(𝐺 ∘func 𝐹)) ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)(𝑥(2nd ‘(𝐺 ∘func 𝐹))𝑦):(𝑥(Hom ‘𝐶)𝑦)–onto→(((1st ‘(𝐺 ∘func 𝐹))‘𝑥)(Hom ‘𝐸)((1st ‘(𝐺 ∘func 𝐹))‘𝑦))))
49	12, 47, 48	sylanbrc 595	. . 3 ⊢ (𝜑 → (1st ‘(𝐺 ∘func 𝐹))(𝐶 Full 𝐸)(2nd ‘(𝐺 ∘func 𝐹)))
50		df-br 5104	. . 3 ⊢ ((1st ‘(𝐺 ∘func 𝐹))(𝐶 Full 𝐸)(2nd ‘(𝐺 ∘func 𝐹)) ↔ ⟨(1st ‘(𝐺 ∘func 𝐹)), (2nd ‘(𝐺 ∘func 𝐹))⟩ ∈ (𝐶 Full 𝐸))
51	49, 50	sylib 221	. 2 ⊢ (𝜑 → ⟨(1st ‘(𝐺 ∘func 𝐹)), (2nd ‘(𝐺 ∘func 𝐹))⟩ ∈ (𝐶 Full 𝐸))
52	10, 51	eqeltrd 2861	1 ⊢ (𝜑 → (𝐺 ∘func 𝐹) ∈ (𝐶 Full 𝐸))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ⟨cop 4590   class class class wbr 5103   ∘ ccom 5655  Rel wrel 5656  –onto→wfo 6536  ‘cfv 6538  (class class class)co 7420  1^st c1st 7999  2^nd c2nd 8000  Basecbs 17387  Hom chom 17439   Func cfunc 18029   ∘_func ccofu 18031   Full cful 18079

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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8849  df-ixp 8926  df-cat 17842  df-cid 17843  df-func 18033  df-cofu 18035  df-full 18081

This theorem is used by:  coffth  18113