| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isfth2 | Structured version Visualization version GIF version | ||
| Description: Equivalent condition for a faithful functor. (Contributed by Mario Carneiro, 27-Jan-2017.) |
| Ref | Expression |
|---|---|
| isfth.b | ⊢ 𝐵 = (Base‘𝐶) |
| isfth.h | ⊢ 𝐻 = (Hom ‘𝐶) |
| isfth.j | ⊢ 𝐽 = (Hom ‘𝐷) |
| Ref | Expression |
|---|---|
| isfth2 | ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isfth.b | . . 3 ⊢ 𝐵 = (Base‘𝐶) | |
| 2 | 1 | isfth 17949 | . 2 ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 Fun ◡(𝑥𝐺𝑦))) |
| 3 | isfth.h | . . . . . . 7 ⊢ 𝐻 = (Hom ‘𝐶) | |
| 4 | isfth.j | . . . . . . 7 ⊢ 𝐽 = (Hom ‘𝐷) | |
| 5 | simpll 776 | . . . . . . 7 ⊢ (((𝐹(𝐶 Func 𝐷)𝐺 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝐹(𝐶 Func 𝐷)𝐺) | |
| 6 | simplr 778 | . . . . . . 7 ⊢ (((𝐹(𝐶 Func 𝐷)𝐺 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 7 | simpr 488 | . . . . . . 7 ⊢ (((𝐹(𝐶 Func 𝐷)𝐺 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵) | |
| 8 | 1, 3, 4, 5, 6, 7 | funcf2 17901 | . . . . . 6 ⊢ (((𝐹(𝐶 Func 𝐷)𝐺 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶((𝐹‘𝑥)𝐽(𝐹‘𝑦))) |
| 9 | df-f1 6526 | . . . . . . 7 ⊢ ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ ((𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ Fun ◡(𝑥𝐺𝑦))) | |
| 10 | 9 | baib 543 | . . . . . 6 ⊢ ((𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ Fun ◡(𝑥𝐺𝑦))) |
| 11 | 8, 10 | syl 17 | . . . . 5 ⊢ (((𝐹(𝐶 Func 𝐷)𝐺 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ Fun ◡(𝑥𝐺𝑦))) |
| 12 | 11 | ralbidva 3183 | . . . 4 ⊢ ((𝐹(𝐶 Func 𝐷)𝐺 ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 Fun ◡(𝑥𝐺𝑦))) |
| 13 | 12 | ralbidva 3183 | . . 3 ⊢ (𝐹(𝐶 Func 𝐷)𝐺 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 Fun ◡(𝑥𝐺𝑦))) |
| 14 | 13 | pm5.32i 582 | . 2 ⊢ ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦))) ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 Fun ◡(𝑥𝐺𝑦))) |
| 15 | 2, 14 | bitr4i 280 | 1 ⊢ (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹‘𝑥)𝐽(𝐹‘𝑦)))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ∀wral 3076 class class class wbr 5100 ◡ccnv 5646 Fun wfun 6515 ⟶wf 6517 –1-1→wf1 6518 ‘cfv 6521 (class class class)co 7396 Basecbs 17245 Hom chom 17297 Func cfunc 17887 Faith cfth 17938 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fv 6529 df-ov 7399 df-oprab 7400 df-mpo 7401 df-1st 7970 df-2nd 7971 df-map 8810 df-ixp 8880 df-func 17891 df-fth 17940 |
| This theorem is referenced by: isffth2 17951 fthf1 17952 cofth 17970 fthestrcsetc 18182 fthsetcestrc 18197 cofidfth 49783 thincfth 50073 |
| Copyright terms: Public domain | W3C validator |