| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fthf1 | Structured version Visualization version GIF version | ||
| Description: The morphism map of a faithful functor is an injection. (Contributed by Mario Carneiro, 27-Jan-2017.) |
| Ref | Expression |
|---|---|
| isfth.b | ⊢ 𝐵 = (Base‘𝐶) |
| isfth.h | ⊢ 𝐻 = (Hom ‘𝐶) |
| isfth.j | ⊢ 𝐽 = (Hom ‘𝐷) |
| fthf1.f | ⊢ (𝜑 → 𝐹(𝐶 Faith 𝐷)𝐺) |
| fthf1.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| fthf1.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| fthf1 | ⊢ (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–1-1→((𝐹‘𝑋)𝐽(𝐹‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fthf1.f | . . 3 ⊢ (𝜑 → 𝐹(𝐶 Faith 𝐷)𝐺) | |
| 2 | isfth.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐶) | |
| 3 | isfth.h | . . . . 5 ⊢ 𝐻 = (Hom ‘𝐶) | |
| 4 | isfth.j | . . . . 5 ⊢ 𝐽 = (Hom ‘𝐷) | |
| 5 | 2, 3, 4 | isfth2 17882 | . . . 4 ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)))) |
| 6 | 5 | simprbi 498 | . . 3 ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦))) |
| 7 | 1, 6 | syl 17 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦))) |
| 8 | fthf1.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 9 | fthf1.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 10 | 9 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 𝑌 ∈ 𝐵) |
| 11 | simplr 774 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑥 = 𝑋) | |
| 12 | simpr 485 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌) | |
| 13 | 11, 12 | oveq12d 7381 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐺𝑦) = (𝑋𝐺𝑌)) |
| 14 | 11, 12 | oveq12d 7381 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌)) |
| 15 | 11 | fveq2d 6838 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑥) = (𝐹‘𝑋)) |
| 16 | 12 | fveq2d 6838 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑦) = (𝐹‘𝑌)) |
| 17 | 15, 16 | oveq12d 7381 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ((𝐹‘𝑋)𝐽(𝐹‘𝑌))) |
| 18 | 13, 14, 17 | f1eq123d 6766 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ (𝑋𝐺𝑌):(𝑋𝐻𝑌)–1-1→((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 19 | 10, 18 | rspcdv 3559 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–1-1→((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 20 | 8, 19 | rspcimdv 3557 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–1-1→((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 21 | 7, 20 | mpd 15 | 1 ⊢ (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–1-1→((𝐹‘𝑋)𝐽(𝐹‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3054 class class class wbr 5079 –1-1→wf1 6489 ‘cfv 6492 (class class class)co 7363 Basecbs 17177 Hom chom 17229 Func cfunc 17819 Faith cfth 17870 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fv 6500 df-ov 7366 df-oprab 7367 df-mpo 7368 df-1st 7938 df-2nd 7939 df-map 8772 df-ixp 8843 df-func 17823 df-fth 17872 |
| This theorem is referenced by: fthi 17885 ffthf1o 17886 fthoppc 17890 cofth 17902 |
| Copyright terms: Public domain | W3C validator |