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

Theorem prfval 16839
Description: Value of the pairing functor. (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 𝐸))
Assertion
Ref Expression
prfval (𝜑𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
Distinct variable groups:   𝑥,,𝑦,𝐵   𝑥,𝐶,𝑦   ,𝐹,𝑥,𝑦   𝜑,,𝑥,𝑦   𝑥,𝐷,𝑦   ,𝐺,𝑥,𝑦   ,𝐻,𝑥,𝑦
Allowed substitution hints:   𝐶()   𝐷()   𝑃(𝑥,𝑦,)   𝐸(𝑥,𝑦,)

Proof of Theorem prfval
Dummy variables 𝑓 𝑏 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prfval.k . 2 𝑃 = (𝐹 ⟨,⟩F 𝐺)
2 df-prf 16815 . . . 4 ⟨,⟩F = (𝑓 ∈ V, 𝑔 ∈ V ↦ dom (1st𝑓) / 𝑏⟨(𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩), (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))⟩)
32a1i 11 . . 3 (𝜑 → ⟨,⟩F = (𝑓 ∈ V, 𝑔 ∈ V ↦ dom (1st𝑓) / 𝑏⟨(𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩), (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))⟩))
4 fvex 6201 . . . . . 6 (1st𝑓) ∈ V
54dmex 7099 . . . . 5 dom (1st𝑓) ∈ V
65a1i 11 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) ∈ V)
7 simprl 794 . . . . . . 7 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → 𝑓 = 𝐹)
87fveq2d 6195 . . . . . 6 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → (1st𝑓) = (1st𝐹))
98dmeqd 5326 . . . . 5 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) = dom (1st𝐹))
10 prfval.b . . . . . . . 8 𝐵 = (Base‘𝐶)
11 eqid 2622 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
12 relfunc 16522 . . . . . . . . 9 Rel (𝐶 Func 𝐷)
13 prfval.c . . . . . . . . 9 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
14 1st2ndbr 7217 . . . . . . . . 9 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
1512, 13, 14sylancr 695 . . . . . . . 8 (𝜑 → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
1610, 11, 15funcf1 16526 . . . . . . 7 (𝜑 → (1st𝐹):𝐵⟶(Base‘𝐷))
17 fdm 6051 . . . . . . 7 ((1st𝐹):𝐵⟶(Base‘𝐷) → dom (1st𝐹) = 𝐵)
1816, 17syl 17 . . . . . 6 (𝜑 → dom (1st𝐹) = 𝐵)
1918adantr 481 . . . . 5 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝐹) = 𝐵)
209, 19eqtrd 2656 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) = 𝐵)
21 simpr 477 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
22 simplrl 800 . . . . . . . . 9 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑓 = 𝐹)
2322fveq2d 6195 . . . . . . . 8 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (1st𝑓) = (1st𝐹))
2423fveq1d 6193 . . . . . . 7 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ((1st𝑓)‘𝑥) = ((1st𝐹)‘𝑥))
25 simplrr 801 . . . . . . . . 9 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑔 = 𝐺)
2625fveq2d 6195 . . . . . . . 8 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (1st𝑔) = (1st𝐺))
2726fveq1d 6193 . . . . . . 7 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ((1st𝑔)‘𝑥) = ((1st𝐺)‘𝑥))
2824, 27opeq12d 4410 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩ = ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩)
2921, 28mpteq12dv 4733 . . . . 5 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩) = (𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩))
30 eqidd 2623 . . . . . . 7 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩) = ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))
3121, 21, 30mpt2eq123dv 6717 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)))
3222ad2antrr 762 . . . . . . . . . . . . 13 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑓 = 𝐹)
3332fveq2d 6195 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (2nd𝑓) = (2nd𝐹))
3433oveqd 6667 . . . . . . . . . . 11 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(2nd𝑓)𝑦) = (𝑥(2nd𝐹)𝑦))
3534dmeqd 5326 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → dom (𝑥(2nd𝑓)𝑦) = dom (𝑥(2nd𝐹)𝑦))
36 prfval.h . . . . . . . . . . . 12 𝐻 = (Hom ‘𝐶)
37 eqid 2622 . . . . . . . . . . . 12 (Hom ‘𝐷) = (Hom ‘𝐷)
3815ad4antr 768 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
39 simplr 792 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑥𝐵)
40 simpr 477 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑦𝐵)
4110, 36, 37, 38, 39, 40funcf2 16528 . . . . . . . . . . 11 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(2nd𝐹)𝑦):(𝑥𝐻𝑦)⟶(((1st𝐹)‘𝑥)(Hom ‘𝐷)((1st𝐹)‘𝑦)))
42 fdm 6051 . . . . . . . . . . 11 ((𝑥(2nd𝐹)𝑦):(𝑥𝐻𝑦)⟶(((1st𝐹)‘𝑥)(Hom ‘𝐷)((1st𝐹)‘𝑦)) → dom (𝑥(2nd𝐹)𝑦) = (𝑥𝐻𝑦))
4341, 42syl 17 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → dom (𝑥(2nd𝐹)𝑦) = (𝑥𝐻𝑦))
4435, 43eqtrd 2656 . . . . . . . . 9 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → dom (𝑥(2nd𝑓)𝑦) = (𝑥𝐻𝑦))
4534fveq1d 6193 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ((𝑥(2nd𝑓)𝑦)‘) = ((𝑥(2nd𝐹)𝑦)‘))
4625ad2antrr 762 . . . . . . . . . . . . 13 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑔 = 𝐺)
4746fveq2d 6195 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (2nd𝑔) = (2nd𝐺))
4847oveqd 6667 . . . . . . . . . . 11 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(2nd𝑔)𝑦) = (𝑥(2nd𝐺)𝑦))
4948fveq1d 6193 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ((𝑥(2nd𝑔)𝑦)‘) = ((𝑥(2nd𝐺)𝑦)‘))
5045, 49opeq12d 4410 . . . . . . . . 9 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩ = ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)
5144, 50mpteq12dv 4733 . . . . . . . 8 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩) = ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))
52513impa 1259 . . . . . . 7 ((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵𝑦𝐵) → ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩) = ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))
5352mpt2eq3dva 6719 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
5431, 53eqtrd 2656 . . . . 5 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
5529, 54opeq12d 4410 . . . 4 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ⟨(𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩), (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))⟩ = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
566, 20, 55csbied2 3561 . . 3 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) / 𝑏⟨(𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩), (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))⟩ = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
57 elex 3212 . . . 4 (𝐹 ∈ (𝐶 Func 𝐷) → 𝐹 ∈ V)
5813, 57syl 17 . . 3 (𝜑𝐹 ∈ V)
59 prfval.d . . . 4 (𝜑𝐺 ∈ (𝐶 Func 𝐸))
60 elex 3212 . . . 4 (𝐺 ∈ (𝐶 Func 𝐸) → 𝐺 ∈ V)
6159, 60syl 17 . . 3 (𝜑𝐺 ∈ V)
62 opex 4932 . . . 4 ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩ ∈ V
6362a1i 11 . . 3 (𝜑 → ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩ ∈ V)
643, 56, 58, 61, 63ovmpt2d 6788 . 2 (𝜑 → (𝐹 ⟨,⟩F 𝐺) = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
651, 64syl5eq 2668 1 (𝜑𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1483  wcel 1990  Vcvv 3200  csb 3533  cop 4183   class class class wbr 4653  cmpt 4729  dom cdm 5114  Rel wrel 5119  wf 5884  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:  prf1  16840  prf2fval  16841  prfcl  16843  prf1st  16844  prf2nd  16845  1st2ndprf  16846
  Copyright terms: Public domain W3C validator