| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fullfo | Structured version Visualization version GIF version | ||
| Description: The morphism map of a full functor is a surjection. (Contributed by Mario Carneiro, 27-Jan-2017.) |
| Ref | Expression |
|---|---|
| isfull.b | ⊢ 𝐵 = (Base‘𝐶) |
| isfull.j | ⊢ 𝐽 = (Hom ‘𝐷) |
| isfull.h | ⊢ 𝐻 = (Hom ‘𝐶) |
| fullfo.f | ⊢ (𝜑 → 𝐹(𝐶 Full 𝐷)𝐺) |
| fullfo.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| fullfo.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| fullfo | ⊢ (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹‘𝑋)𝐽(𝐹‘𝑌))) |
| 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 17880 | . . . 4 ⊢ (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹‘𝑥)𝐽(𝐹‘𝑦)))) |
| 6 | 5 | simprbi 497 | . . 3 ⊢ (𝐹(𝐶 Full 𝐷)𝐺 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹‘𝑥)𝐽(𝐹‘𝑦))) |
| 7 | 1, 6 | syl 17 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹‘𝑥)𝐽(𝐹‘𝑦))) |
| 8 | fullfo.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 9 | fullfo.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 10 | 9 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 𝑌 ∈ 𝐵) |
| 11 | simplr 769 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑥 = 𝑋) | |
| 12 | simpr 484 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌) | |
| 13 | 11, 12 | oveq12d 7385 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐺𝑦) = (𝑋𝐺𝑌)) |
| 14 | 11, 12 | oveq12d 7385 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌)) |
| 15 | 11 | fveq2d 6844 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑥) = (𝐹‘𝑋)) |
| 16 | 12 | fveq2d 6844 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑦) = (𝐹‘𝑌)) |
| 17 | 15, 16 | oveq12d 7385 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ((𝐹‘𝑋)𝐽(𝐹‘𝑌))) |
| 18 | 13, 14, 17 | foeq123d 6773 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 19 | 10, 18 | rspcdv 3556 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 20 | 8, 19 | rspcimdv 3554 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 21 | 7, 20 | mpd 15 | 1 ⊢ (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–onto→((𝐹‘𝑋)𝐽(𝐹‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3051 class class class wbr 5085 –onto→wfo 6496 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 Hom chom 17231 Func cfunc 17821 Full cful 17871 |
| 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 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fo 6504 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-1st 7942 df-2nd 7943 df-map 8775 df-ixp 8846 df-func 17825 df-full 17873 |
| This theorem is referenced by: fulli 17882 ffthf1o 17888 fulloppc 17891 cofull 17903 imasubc 49626 |
| Copyright terms: Public domain | W3C validator |