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

Theorem prfval 18087
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 18063 . . . 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 6855 . . . . . 6 (1st𝑓) ∈ V
54dmex 7848 . . . . 5 dom (1st𝑓) ∈ V
65a1i 11 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) ∈ V)
7 simprl 769 . . . . . . 7 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → 𝑓 = 𝐹)
87fveq2d 6846 . . . . . 6 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → (1st𝑓) = (1st𝐹))
98dmeqd 5861 . . . . 5 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) = dom (1st𝐹))
10 prfval.b . . . . . . . 8 𝐵 = (Base‘𝐶)
11 eqid 2736 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
12 relfunc 17748 . . . . . . . . 9 Rel (𝐶 Func 𝐷)
13 prfval.c . . . . . . . . 9 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
14 1st2ndbr 7974 . . . . . . . . 9 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
1512, 13, 14sylancr 587 . . . . . . . 8 (𝜑 → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
1610, 11, 15funcf1 17752 . . . . . . 7 (𝜑 → (1st𝐹):𝐵⟶(Base‘𝐷))
1716fdmd 6679 . . . . . 6 (𝜑 → dom (1st𝐹) = 𝐵)
1817adantr 481 . . . . 5 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝐹) = 𝐵)
199, 18eqtrd 2776 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) = 𝐵)
20 simpr 485 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
21 simplrl 775 . . . . . . . . 9 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑓 = 𝐹)
2221fveq2d 6846 . . . . . . . 8 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (1st𝑓) = (1st𝐹))
2322fveq1d 6844 . . . . . . 7 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ((1st𝑓)‘𝑥) = ((1st𝐹)‘𝑥))
24 simplrr 776 . . . . . . . . 9 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑔 = 𝐺)
2524fveq2d 6846 . . . . . . . 8 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (1st𝑔) = (1st𝐺))
2625fveq1d 6844 . . . . . . 7 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ((1st𝑔)‘𝑥) = ((1st𝐺)‘𝑥))
2723, 26opeq12d 4838 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩ = ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩)
2820, 27mpteq12dv 5196 . . . . 5 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩) = (𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩))
29 eqidd 2737 . . . . . . 7 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩) = ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))
3020, 20, 29mpoeq123dv 7432 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)))
3121ad2antrr 724 . . . . . . . . . . . . 13 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑓 = 𝐹)
3231fveq2d 6846 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (2nd𝑓) = (2nd𝐹))
3332oveqd 7374 . . . . . . . . . . 11 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(2nd𝑓)𝑦) = (𝑥(2nd𝐹)𝑦))
3433dmeqd 5861 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → dom (𝑥(2nd𝑓)𝑦) = dom (𝑥(2nd𝐹)𝑦))
35 prfval.h . . . . . . . . . . . 12 𝐻 = (Hom ‘𝐶)
36 eqid 2736 . . . . . . . . . . . 12 (Hom ‘𝐷) = (Hom ‘𝐷)
3715ad4antr 730 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
38 simplr 767 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑥𝐵)
39 simpr 485 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑦𝐵)
4010, 35, 36, 37, 38, 39funcf2 17754 . . . . . . . . . . 11 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(2nd𝐹)𝑦):(𝑥𝐻𝑦)⟶(((1st𝐹)‘𝑥)(Hom ‘𝐷)((1st𝐹)‘𝑦)))
4140fdmd 6679 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → dom (𝑥(2nd𝐹)𝑦) = (𝑥𝐻𝑦))
4234, 41eqtrd 2776 . . . . . . . . 9 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → dom (𝑥(2nd𝑓)𝑦) = (𝑥𝐻𝑦))
4333fveq1d 6844 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ((𝑥(2nd𝑓)𝑦)‘) = ((𝑥(2nd𝐹)𝑦)‘))
4424ad2antrr 724 . . . . . . . . . . . . 13 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑔 = 𝐺)
4544fveq2d 6846 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (2nd𝑔) = (2nd𝐺))
4645oveqd 7374 . . . . . . . . . . 11 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(2nd𝑔)𝑦) = (𝑥(2nd𝐺)𝑦))
4746fveq1d 6844 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ((𝑥(2nd𝑔)𝑦)‘) = ((𝑥(2nd𝐺)𝑦)‘))
4843, 47opeq12d 4838 . . . . . . . . 9 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩ = ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)
4942, 48mpteq12dv 5196 . . . . . . . 8 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩) = ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))
50493impa 1110 . . . . . . 7 ((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵𝑦𝐵) → ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩) = ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))
5150mpoeq3dva 7434 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
5230, 51eqtrd 2776 . . . . 5 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
5328, 52opeq12d 4838 . . . 4 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ⟨(𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩), (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))⟩ = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
546, 19, 53csbied2 3895 . . 3 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) / 𝑏⟨(𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩), (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))⟩ = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
5513elexd 3465 . . 3 (𝜑𝐹 ∈ V)
56 prfval.d . . . 4 (𝜑𝐺 ∈ (𝐶 Func 𝐸))
5756elexd 3465 . . 3 (𝜑𝐺 ∈ V)
58 opex 5421 . . . 4 ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩ ∈ V
5958a1i 11 . . 3 (𝜑 → ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩ ∈ V)
603, 54, 55, 57, 59ovmpod 7507 . 2 (𝜑 → (𝐹 ⟨,⟩F 𝐺) = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
611, 60eqtrid 2788 1 (𝜑𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106  Vcvv 3445  csb 3855  cop 4592   class class class wbr 5105  cmpt 5188  dom cdm 5633  Rel wrel 5638  cfv 6496  (class class class)co 7357  cmpo 7359  1st c1st 7919  2nd c2nd 7920  Basecbs 17083  Hom chom 17144   Func cfunc 17740   ⟨,⟩F cprf 18059
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-1st 7921  df-2nd 7922  df-map 8767  df-ixp 8836  df-func 17744  df-prf 18063
This theorem is referenced by:  prf1  18088  prf2fval  18089  prfcl  18091  prf1st  18092  prf2nd  18093  1st2ndprf  18094
  Copyright terms: Public domain W3C validator