Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > prf1 | Structured version Visualization version GIF version |
Description: Value of the pairing functor on objects. (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 | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
Ref | Expression |
---|---|
prf1 | ⊢ (𝜑 → ((1st ‘𝑃)‘𝑋) = 〈((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prfval.k | . . . 4 ⊢ 𝑃 = (𝐹 〈,〉F 𝐺) | |
2 | prfval.b | . . . 4 ⊢ 𝐵 = (Base‘𝐶) | |
3 | prfval.h | . . . 4 ⊢ 𝐻 = (Hom ‘𝐶) | |
4 | prfval.c | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷)) | |
5 | prfval.d | . . . 4 ⊢ (𝜑 → 𝐺 ∈ (𝐶 Func 𝐸)) | |
6 | 1, 2, 3, 4, 5 | prfval 16839 | . . 3 ⊢ (𝜑 → 𝑃 = 〈(𝑥 ∈ 𝐵 ↦ 〈((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)〉), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ 〈((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)〉))〉) |
7 | fvex 6201 | . . . . . 6 ⊢ (Base‘𝐶) ∈ V | |
8 | 2, 7 | eqeltri 2697 | . . . . 5 ⊢ 𝐵 ∈ V |
9 | 8 | mptex 6486 | . . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ 〈((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)〉) ∈ V |
10 | 8, 8 | mpt2ex 7247 | . . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ 〈((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)〉)) ∈ V |
11 | 9, 10 | op1std 7178 | . . 3 ⊢ (𝑃 = 〈(𝑥 ∈ 𝐵 ↦ 〈((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)〉), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ 〈((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)〉))〉 → (1st ‘𝑃) = (𝑥 ∈ 𝐵 ↦ 〈((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)〉)) |
12 | 6, 11 | syl 17 | . 2 ⊢ (𝜑 → (1st ‘𝑃) = (𝑥 ∈ 𝐵 ↦ 〈((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)〉)) |
13 | simpr 477 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋) | |
14 | 13 | fveq2d 6195 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → ((1st ‘𝐹)‘𝑥) = ((1st ‘𝐹)‘𝑋)) |
15 | 13 | fveq2d 6195 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → ((1st ‘𝐺)‘𝑥) = ((1st ‘𝐺)‘𝑋)) |
16 | 14, 15 | opeq12d 4410 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 〈((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)〉 = 〈((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)〉) |
17 | prf1.x | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
18 | opex 4932 | . . 3 ⊢ 〈((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)〉 ∈ V | |
19 | 18 | a1i 11 | . 2 ⊢ (𝜑 → 〈((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)〉 ∈ V) |
20 | 12, 16, 17, 19 | fvmptd 6288 | 1 ⊢ (𝜑 → ((1st ‘𝑃)‘𝑋) = 〈((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 Vcvv 3200 〈cop 4183 ↦ cmpt 4729 ‘cfv 5888 (class class class)co 6650 ↦ cmpt2 6652 1st c1st 7166 2nd c2nd 7167 Basecbs 15857 Hom chom 15952 Func cfunc 16514 〈,〉F cprf 16811 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-1st 7168 df-2nd 7169 df-map 7859 df-ixp 7909 df-func 16518 df-prf 16815 |
This theorem is referenced by: prfcl 16843 uncf1 16876 uncf2 16877 yonedalem21 16913 yonedalem22 16918 |
Copyright terms: Public domain | W3C validator |