| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prf2 | Structured version Visualization version GIF version | ||
| Description: Value of the pairing functor on morphisms. (Contributed by Mario Carneiro, 12-Jan-2017.) |
| Ref | Expression |
|---|---|
| prfval.k | ⊢ 𝑃 = (𝐹 〈,〉F 𝐺) |
| prfval.b | ⊢ 𝐵 = (Base‘𝐶) |
| prfval.h | ⊢ 𝐻 = (Hom ‘𝐶) |
| prfval.c | ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷)) |
| prfval.d | ⊢ (𝜑 → 𝐺 ∈ (𝐶 Func 𝐸)) |
| prf1.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| prf2.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| prf2.k | ⊢ (𝜑 → 𝐾 ∈ (𝑋𝐻𝑌)) |
| Ref | Expression |
|---|---|
| prf2 | ⊢ (𝜑 → ((𝑋(2nd ‘𝑃)𝑌)‘𝐾) = 〈((𝑋(2nd ‘𝐹)𝑌)‘𝐾), ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prfval.k | . . 3 ⊢ 𝑃 = (𝐹 〈,〉F 𝐺) | |
| 2 | prfval.b | . . 3 ⊢ 𝐵 = (Base‘𝐶) | |
| 3 | prfval.h | . . 3 ⊢ 𝐻 = (Hom ‘𝐶) | |
| 4 | prfval.c | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷)) | |
| 5 | prfval.d | . . 3 ⊢ (𝜑 → 𝐺 ∈ (𝐶 Func 𝐸)) | |
| 6 | prf1.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 7 | prf2.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | prf2fval 18336 | . 2 ⊢ (𝜑 → (𝑋(2nd ‘𝑃)𝑌) = (ℎ ∈ (𝑋𝐻𝑌) ↦ 〈((𝑋(2nd ‘𝐹)𝑌)‘ℎ), ((𝑋(2nd ‘𝐺)𝑌)‘ℎ)〉)) |
| 9 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ ℎ = 𝐾) → ℎ = 𝐾) | |
| 10 | 9 | fveq2d 6877 | . . 3 ⊢ ((𝜑 ∧ ℎ = 𝐾) → ((𝑋(2nd ‘𝐹)𝑌)‘ℎ) = ((𝑋(2nd ‘𝐹)𝑌)‘𝐾)) |
| 11 | 9 | fveq2d 6877 | . . 3 ⊢ ((𝜑 ∧ ℎ = 𝐾) → ((𝑋(2nd ‘𝐺)𝑌)‘ℎ) = ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)) |
| 12 | 10, 11 | opeq12d 4840 | . 2 ⊢ ((𝜑 ∧ ℎ = 𝐾) → 〈((𝑋(2nd ‘𝐹)𝑌)‘ℎ), ((𝑋(2nd ‘𝐺)𝑌)‘ℎ)〉 = 〈((𝑋(2nd ‘𝐹)𝑌)‘𝐾), ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)〉) |
| 13 | prf2.k | . 2 ⊢ (𝜑 → 𝐾 ∈ (𝑋𝐻𝑌)) | |
| 14 | opex 5431 | . . 3 ⊢ 〈((𝑋(2nd ‘𝐹)𝑌)‘𝐾), ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)〉 ∈ V | |
| 15 | 14 | a1i 11 | . 2 ⊢ (𝜑 → 〈((𝑋(2nd ‘𝐹)𝑌)‘𝐾), ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)〉 ∈ V) |
| 16 | 8, 12, 13, 15 | fvmptd 6989 | 1 ⊢ (𝜑 → ((𝑋(2nd ‘𝑃)𝑌)‘𝐾) = 〈((𝑋(2nd ‘𝐹)𝑌)‘𝐾), ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3450 〈cop 4589 ‘cfv 6527 (class class class)co 7408 2nd c2nd 7983 Basecbs 17348 Hom chom 17400 Func cfunc 17990 〈,〉F cprf 18306 |
| 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 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 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 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7984 df-2nd 7985 df-map 8827 df-ixp 8904 df-func 17994 df-prf 18310 |
| This theorem is used by: prfcl 18338 prf1st 18339 prf2nd 18340 uncf2 18372 yonedalem22 18413 |
| Copyright terms: Public domain | W3C validator |