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

Theorem fullfo 17927
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 17926 . . . 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 7423 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐺𝑦) = (𝑋𝐺𝑌))
1411, 12oveq12d 7423 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
1511fveq2d 6880 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹𝑥) = (𝐹𝑋))
1612fveq2d 6880 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹𝑦) = (𝐹𝑌))
1715, 16oveq12d 7423 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝐹𝑥)𝐽(𝐹𝑦)) = ((𝐹𝑋)𝐽(𝐹𝑌)))
1813, 14, 17foeq123d 6811 . . . 4 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
1910, 18rspcdv 3593 . . 3 ((𝜑𝑥 = 𝑋) → (∀𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
208, 19rspcimdv 3591 . 2 (𝜑 → (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
217, 20mpd 15 1 (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wral 3051   class class class wbr 5119  ontowfo 6529  cfv 6531  (class class class)co 7405  Basecbs 17228  Hom chom 17282   Func cfunc 17867   Full cful 17917
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-fo 6537  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7988  df-2nd 7989  df-map 8842  df-ixp 8912  df-func 17871  df-full 17919
This theorem is referenced by:  fulli  17928  ffthf1o  17934  fulloppc  17937  cofull  17949  imasubc  49091
  Copyright terms: Public domain W3C validator