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

Theorem fullfo 17872
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 17871 . . . 4 (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
65simprbi 497 . . 3 (𝐹(𝐶 Full 𝐷)𝐺 → ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)))
71, 6syl 17 . 2 (𝜑 → ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)))
8 fullfo.x . . 3 (𝜑𝑋𝐵)
9 fullfo.y . . . . 5 (𝜑𝑌𝐵)
109adantr 480 . . . 4 ((𝜑𝑥 = 𝑋) → 𝑌𝐵)
11 simplr 769 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑥 = 𝑋)
12 simpr 484 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌)
1311, 12oveq12d 7378 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐺𝑦) = (𝑋𝐺𝑌))
1411, 12oveq12d 7378 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
1511fveq2d 6838 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹𝑥) = (𝐹𝑋))
1612fveq2d 6838 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹𝑦) = (𝐹𝑌))
1715, 16oveq12d 7378 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝐹𝑥)𝐽(𝐹𝑦)) = ((𝐹𝑋)𝐽(𝐹𝑌)))
1813, 14, 17foeq123d 6767 . . . 4 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
1910, 18rspcdv 3557 . . 3 ((𝜑𝑥 = 𝑋) → (∀𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
208, 19rspcimdv 3555 . 2 (𝜑 → (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
217, 20mpd 15 1 (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052   class class class wbr 5086  ontowfo 6490  cfv 6492  (class class class)co 7360  Basecbs 17170  Hom chom 17222   Func cfunc 17812   Full cful 17862
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  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 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-map 8768  df-ixp 8839  df-func 17816  df-full 17864
This theorem is referenced by:  fulli  17873  ffthf1o  17879  fulloppc  17882  cofull  17894  imasubc  49638
  Copyright terms: Public domain W3C validator