| 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 18124 | . . . 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 7464 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐺𝑦) = (𝑋𝐺𝑌)) |
| 14 | 11, 12 | oveq12d 7464 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌)) |
| 15 | 11 | fveq2d 6915 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑥) = (𝐹‘𝑋)) |
| 16 | 12 | fveq2d 6915 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (𝐹‘𝑦) = (𝐹‘𝑌)) |
| 17 | 15, 16 | oveq12d 7464 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ((𝐹‘𝑋)𝐽(𝐹‘𝑌))) |
| 18 | 13, 14, 17 | f1eq123d 6841 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶1-1((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶1-1((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 19 | 10, 18 | rspcdv 3572 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶1-1((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶1-1((𝐹‘𝑋)𝐽(𝐹‘𝑌)))) |
| 20 | 8, 19 | rspcimdv 3570 | . 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 2147 ∀wral 3080 class class class wbr 5106 ⟶1-1wf1 6558 ‘cfv 6561 (class class class)co 7446 Basecbs 17419 Hom chom 17471 Func cfunc 18061 Faith cfth 18112 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fv 6569 df-ov 7449 df-oprab 7450 df-mpo 7451 df-1st 8028 df-2nd 8029 df-map 8880 df-ixp 8957 df-func 18065 df-fth 18114 |
| This theorem is used by: fthi 18127 ffthf1o 18128 fthoppc 18132 cofth 18144 |
| Copyright terms: Public domain | W3C validator |