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

Theorem fullfo 17838
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.
StepHypRef Expression
1 fullfo.f . . 3 (𝜑𝐹(𝐶 Full 𝐷)𝐺)
2 isfull.b . . . . 5 𝐵 = (Base‘𝐶)
3 isfull.j . . . . 5 𝐽 = (Hom ‘𝐷)
4 isfull.h . . . . 5 𝐻 = (Hom ‘𝐶)
52, 3, 4isfull2 17837 . . . 4 (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
65simprbi 496 . . 3 (𝐹(𝐶 Full 𝐷)𝐺 → ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)))
71, 6syl 17 . 2 (𝜑 → ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)))
8 fullfo.x . . 3 (𝜑𝑋𝐵)
9 fullfo.y . . . . 5 (𝜑𝑌𝐵)
109adantr 480 . . . 4 ((𝜑𝑥 = 𝑋) → 𝑌𝐵)
11 simplr 768 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑥 = 𝑋)
12 simpr 484 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌)
1311, 12oveq12d 7376 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐺𝑦) = (𝑋𝐺𝑌))
1411, 12oveq12d 7376 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
1511fveq2d 6838 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹𝑥) = (𝐹𝑋))
1612fveq2d 6838 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹𝑦) = (𝐹𝑌))
1715, 16oveq12d 7376 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝐹𝑥)𝐽(𝐹𝑦)) = ((𝐹𝑋)𝐽(𝐹𝑌)))
1813, 14, 17foeq123d 6767 . . . 4 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
1910, 18rspcdv 3568 . . 3 ((𝜑𝑥 = 𝑋) → (∀𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
208, 19rspcimdv 3566 . 2 (𝜑 → (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
217, 20mpd 15 1 (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  wral 3051   class class class wbr 5098  ontowfo 6490  cfv 6492  (class class class)co 7358  Basecbs 17136  Hom chom 17188   Func cfunc 17778   Full cful 17828
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fo 6498  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-map 8765  df-ixp 8836  df-func 17782  df-full 17830
This theorem is referenced by:  fulli  17839  ffthf1o  17845  fulloppc  17848  cofull  17860  imasubc  49392
  Copyright terms: Public domain W3C validator