| 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 18072 | . . . 4 ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)))) |
| 6 | 5 | simprbi 503 | . . 3 ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦))) |
| 7 | 1, 6 | syl 18 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦))) |
| 8 | fthf1.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 9 | fthf1.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 𝑌 ∈ 𝐵) |
| 11 | simplr 781 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑥 = 𝑋) | |
| 12 | simpr 490 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌) | |
| 13 | 11, 12 | oveq12d 7430 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐺𝑦) = (𝑋𝐺𝑌)) |
| 14 | 11, 12 | oveq12d 7430 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌)) |
| 15 | 11 | fveq2d 6881 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑥) = (𝐹‘𝑋)) |
| 16 | 12 | fveq2d 6881 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑦) = (𝐹‘𝑌)) |
| 17 | 15, 16 | oveq12d 7430 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ((𝐹‘𝑋)𝐽(𝐹‘𝑌))) |
| 18 | 13, 14, 17 | f1eq123d 6808 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ (𝑋𝐺𝑌):(𝑋𝐻𝑌)–1-1→((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 19 | 10, 18 | rspcdv 3569 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–1-1→((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 20 | 8, 19 | rspcimdv 3567 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–1-1→((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 21 | 7, 20 | mpd 16 | 1 ⊢ (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)–1-1→((𝐹‘𝑋)𝐽(𝐹‘𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 class class class wbr 5103 –1-1→wf1 6528 ‘cfv 6531 (class class class)co 7412 Basecbs 17367 Hom chom 17419 Func cfunc 18009 Faith cfth 18060 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7990 df-2nd 7991 df-map 8833 df-ixp 8910 df-func 18013 df-fth 18062 |
| This theorem is used by: fthi 18075 ffthf1o 18076 fthoppc 18080 cofth 18092 |
| Copyright terms: Public domain | W3C validator |