Theorem fullfo 18139

Description: The morphism map of a full functor is a surjection. (Contributed by Mario Carneiro, 27-Jan-2017.)

Hypotheses

Ref	Expression
isfull.b	⊢ 𝐵 = (Base‘𝐶)
isfull.j	⊢ 𝐽 = (Hom ‘𝐷)
isfull.h	⊢ 𝐻 = (Hom ‘𝐶)
fullfo.f	⊢ (𝜑 → 𝐹(𝐶 Full 𝐷)𝐺)
fullfo.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
fullfo.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)

Assertion

Ref	Expression
fullfo	⊢ (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶onto((𝐹‘𝑋)𝐽(𝐹‘𝑌)))

Proof of Theorem fullfo

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

Step	Hyp	Ref	Expression
1		fullfo.f	. . 3 ⊢ (𝜑 → 𝐹(𝐶 Full 𝐷)𝐺)
2		isfull.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐶)
3		isfull.j	. . . . 5 ⊢ 𝐽 = (Hom ‘𝐷)
4		isfull.h	. . . . 5 ⊢ 𝐻 = (Hom ‘𝐶)
5	2, 3, 4	isfull2 18138	. . . 4 ⊢ (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶onto((𝐹‘𝑥)𝐽(𝐹‘𝑦))))
6	5	simprbi 503	. . 3 ⊢ (𝐹(𝐶 Full 𝐷)𝐺 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶onto((𝐹‘𝑥)𝐽(𝐹‘𝑦)))
7	1, 6	syl 18	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶onto((𝐹‘𝑥)𝐽(𝐹‘𝑦)))
8		fullfo.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
9		fullfo.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
10	9	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 𝑌 ∈ 𝐵)
11		simplr 781	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑥 = 𝑋)
12		simpr 490	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌)
13	11, 12	oveq12d 7469	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐺𝑦) = (𝑋𝐺𝑌))
14	11, 12	oveq12d 7469	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
15	11	fveq2d 6920	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑥) = (𝐹‘𝑋))
16	12	fveq2d 6920	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑦) = (𝐹‘𝑌))
17	15, 16	oveq12d 7469	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ((𝐹‘𝑋)𝐽(𝐹‘𝑌)))
18	13, 14, 17	foeq123d 6847	. . . 4 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶onto((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶onto((𝐹‘𝑋)𝐽(𝐹‘𝑌))))
19	10, 18	rspcdv 3572	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶onto((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶onto((𝐹‘𝑋)𝐽(𝐹‘𝑌))))
20	8, 19	rspcimdv 3570	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶onto((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶onto((𝐹‘𝑋)𝐽(𝐹‘𝑌))))
21	7, 20	mpd 16	1 ⊢ (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶onto((𝐹‘𝑋)𝐽(𝐹‘𝑌)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   class class class wbr 5108  ⟶ontowfo 6564  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Hom chom 17483   Func cfunc 18079   Full cful 18129

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-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-fo 6572  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-ixp 8964  df-func 18083  df-full 18131

This theorem is used by:  fulli  18140  ffthf1o  18146  fulloppc  18149  cofull  18161  imasubc  50598