MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  prf1 Structured version   Visualization version   GIF version

Theorem prf1 18426
Description: Value of the pairing functor on objects. (Contributed by Mario Carneiro, 12-Jan-2017.)
Hypotheses
Ref Expression
prfval.k 𝑃 = (𝐹 ⟨,⟩F 𝐺)
prfval.b 𝐵 = (Base‘𝐶)
prfval.h 𝐻 = (Hom ‘𝐶)
prfval.c (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
prfval.d (𝜑 → 𝐺 ∈ (𝐶 Func 𝐸))
prf1.x (𝜑 → 𝑋 ∈ 𝐵)
Assertion
Ref Expression
prf1 (𝜑 → ((1st ‘𝑃)‘𝑋) = ⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)⟩)

Proof of Theorem prf1
Dummy variables ℎ 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef 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 𝐸))
61, 2, 3, 4, 5prfval 18425 . . 3 (𝜑 → 𝑃 = ⟨(𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))⟩)
72fvexi 6929 . . . . 5 𝐵 ∈ V
87mptex 7259 . . . 4 (𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩) ∈ V
97, 7mpoex 8126 . . . 4 (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩)) ∈ V
108, 9op1std 8044 . . 3 (𝑃 = ⟨(𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (ℎ ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd ‘𝐹)𝑦)‘ℎ), ((𝑥(2nd ‘𝐺)𝑦)‘ℎ)⟩))⟩ → (1st ‘𝑃) = (𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩))
116, 10syl 18 . 2 (𝜑 → (1st ‘𝑃) = (𝑥 ∈ 𝐵 ↦ ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩))
12 simpr 490 . . . 4 ((𝜑 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
1312fveq2d 6919 . . 3 ((𝜑 ∧ 𝑥 = 𝑋) → ((1st ‘𝐹)‘𝑥) = ((1st ‘𝐹)‘𝑋))
1412fveq2d 6919 . . 3 ((𝜑 ∧ 𝑥 = 𝑋) → ((1st ‘𝐺)‘𝑥) = ((1st ‘𝐺)‘𝑋))
1513, 14opeq12d 4852 . 2 ((𝜑 ∧ 𝑥 = 𝑋) → ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ = ⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)⟩)
16 prf1.x . 2 (𝜑 → 𝑋 ∈ 𝐵)
17 opex 5438 . . 3 ⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)⟩ ∈ V
1817a1i 11 . 2 (𝜑 → ⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)⟩ ∈ V)
1911, 15, 16, 18fvmptd 7031 1 (𝜑 → ((1st ‘𝑃)‘𝑋) = ⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐺)‘𝑋)⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  Vcvv 3453  ⟨cop 4839   ↦ cmpt 5191  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452  1st c1st 8032  2nd c2nd 8033  Basecbs 17433  Hom chom 17485   Func cfunc 18081   ⟨,⟩F cprf 18397
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-map 8886  df-ixp 8963  df-func 18085  df-prf 18401
This theorem is used by:  prfcl  18429  uncf1  18462  uncf2  18463  yonedalem21  18499  yonedalem22  18504
  Copyright terms: Public domain W3C validator