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

Theorem fullfo 17850
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 17849 . . . 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 7386 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐺𝑦) = (𝑋𝐺𝑌))
1411, 12oveq12d 7386 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
1511fveq2d 6846 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹𝑥) = (𝐹𝑋))
1612fveq2d 6846 . . . . . 6 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹𝑦) = (𝐹𝑌))
1715, 16oveq12d 7386 . . . . 5 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝐹𝑥)𝐽(𝐹𝑦)) = ((𝐹𝑋)𝐽(𝐹𝑌)))
1813, 14, 17foeq123d 6775 . . . 4 (((𝜑𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
1910, 18rspcdv 3570 . . 3 ((𝜑𝑥 = 𝑋) → (∀𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹𝑋)𝐽(𝐹𝑌))))
208, 19rspcimdv 3568 . 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 5100  ontowfo 6498  cfv 6500  (class class class)co 7368  Basecbs 17148  Hom chom 17200   Func cfunc 17790   Full cful 17840
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fo 6506  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-map 8777  df-ixp 8848  df-func 17794  df-full 17842
This theorem is referenced by:  fulli  17851  ffthf1o  17857  fulloppc  17860  cofull  17872  imasubc  49504
  Copyright terms: Public domain W3C validator