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

Theorem prfval 16662
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 16638 . . . 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 6113 . . . . . 6 (1st𝑓) ∈ V
54dmex 6991 . . . . 5 dom (1st𝑓) ∈ V
65a1i 11 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) ∈ V)
7 simprl 790 . . . . . . 7 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → 𝑓 = 𝐹)
87fveq2d 6107 . . . . . 6 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → (1st𝑓) = (1st𝐹))
98dmeqd 5248 . . . . 5 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) = dom (1st𝐹))
10 prfval.b . . . . . . . 8 𝐵 = (Base‘𝐶)
11 eqid 2610 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
12 relfunc 16345 . . . . . . . . 9 Rel (𝐶 Func 𝐷)
13 prfval.c . . . . . . . . 9 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
14 1st2ndbr 7108 . . . . . . . . 9 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
1512, 13, 14sylancr 694 . . . . . . . 8 (𝜑 → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
1610, 11, 15funcf1 16349 . . . . . . 7 (𝜑 → (1st𝐹):𝐵⟶(Base‘𝐷))
17 fdm 5964 . . . . . . 7 ((1st𝐹):𝐵⟶(Base‘𝐷) → dom (1st𝐹) = 𝐵)
1816, 17syl 17 . . . . . 6 (𝜑 → dom (1st𝐹) = 𝐵)
1918adantr 480 . . . . 5 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝐹) = 𝐵)
209, 19eqtrd 2644 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) = 𝐵)
21 simpr 476 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
22 simplrl 796 . . . . . . . . 9 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑓 = 𝐹)
2322fveq2d 6107 . . . . . . . 8 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (1st𝑓) = (1st𝐹))
2423fveq1d 6105 . . . . . . 7 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ((1st𝑓)‘𝑥) = ((1st𝐹)‘𝑥))
25 simplrr 797 . . . . . . . . 9 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → 𝑔 = 𝐺)
2625fveq2d 6107 . . . . . . . 8 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (1st𝑔) = (1st𝐺))
2726fveq1d 6105 . . . . . . 7 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ((1st𝑔)‘𝑥) = ((1st𝐺)‘𝑥))
2824, 27opeq12d 4348 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩ = ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩)
2921, 28mpteq12dv 4663 . . . . 5 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩) = (𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩))
30 eqidd 2611 . . . . . . 7 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩) = ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))
3121, 21, 30mpt2eq123dv 6615 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)))
3222ad2antrr 758 . . . . . . . . . . . . 13 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑓 = 𝐹)
3332fveq2d 6107 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (2nd𝑓) = (2nd𝐹))
3433oveqd 6566 . . . . . . . . . . 11 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(2nd𝑓)𝑦) = (𝑥(2nd𝐹)𝑦))
3534dmeqd 5248 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → dom (𝑥(2nd𝑓)𝑦) = dom (𝑥(2nd𝐹)𝑦))
36 prfval.h . . . . . . . . . . . 12 𝐻 = (Hom ‘𝐶)
37 eqid 2610 . . . . . . . . . . . 12 (Hom ‘𝐷) = (Hom ‘𝐷)
3815ad4antr 764 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
39 simplr 788 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑥𝐵)
40 simpr 476 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑦𝐵)
4110, 36, 37, 38, 39, 40funcf2 16351 . . . . . . . . . . 11 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(2nd𝐹)𝑦):(𝑥𝐻𝑦)⟶(((1st𝐹)‘𝑥)(Hom ‘𝐷)((1st𝐹)‘𝑦)))
42 fdm 5964 . . . . . . . . . . 11 ((𝑥(2nd𝐹)𝑦):(𝑥𝐻𝑦)⟶(((1st𝐹)‘𝑥)(Hom ‘𝐷)((1st𝐹)‘𝑦)) → dom (𝑥(2nd𝐹)𝑦) = (𝑥𝐻𝑦))
4341, 42syl 17 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → dom (𝑥(2nd𝐹)𝑦) = (𝑥𝐻𝑦))
4435, 43eqtrd 2644 . . . . . . . . 9 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → dom (𝑥(2nd𝑓)𝑦) = (𝑥𝐻𝑦))
4534fveq1d 6105 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ((𝑥(2nd𝑓)𝑦)‘) = ((𝑥(2nd𝐹)𝑦)‘))
4625ad2antrr 758 . . . . . . . . . . . . 13 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → 𝑔 = 𝐺)
4746fveq2d 6107 . . . . . . . . . . . 12 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (2nd𝑔) = (2nd𝐺))
4847oveqd 6566 . . . . . . . . . . 11 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(2nd𝑔)𝑦) = (𝑥(2nd𝐺)𝑦))
4948fveq1d 6105 . . . . . . . . . 10 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ((𝑥(2nd𝑔)𝑦)‘) = ((𝑥(2nd𝐺)𝑦)‘))
5045, 49opeq12d 4348 . . . . . . . . 9 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩ = ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)
5144, 50mpteq12dv 4663 . . . . . . . 8 (((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵) ∧ 𝑦𝐵) → ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩) = ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))
52513impa 1251 . . . . . . 7 ((((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) ∧ 𝑥𝐵𝑦𝐵) → ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩) = ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))
5352mpt2eq3dva 6617 . . . . . 6 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
5431, 53eqtrd 2644 . . . . 5 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩)) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
5529, 54opeq12d 4348 . . . 4 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ 𝑏 = 𝐵) → ⟨(𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩), (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))⟩ = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
566, 20, 55csbied2 3527 . . 3 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → dom (1st𝑓) / 𝑏⟨(𝑥𝑏 ↦ ⟨((1st𝑓)‘𝑥), ((1st𝑔)‘𝑥)⟩), (𝑥𝑏, 𝑦𝑏 ↦ ( ∈ dom (𝑥(2nd𝑓)𝑦) ↦ ⟨((𝑥(2nd𝑓)𝑦)‘), ((𝑥(2nd𝑔)𝑦)‘)⟩))⟩ = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
57 elex 3185 . . . 4 (𝐹 ∈ (𝐶 Func 𝐷) → 𝐹 ∈ V)
5813, 57syl 17 . . 3 (𝜑𝐹 ∈ V)
59 prfval.d . . . 4 (𝜑𝐺 ∈ (𝐶 Func 𝐸))
60 elex 3185 . . . 4 (𝐺 ∈ (𝐶 Func 𝐸) → 𝐺 ∈ V)
6159, 60syl 17 . . 3 (𝜑𝐺 ∈ V)
62 opex 4859 . . . 4 ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩ ∈ V
6362a1i 11 . . 3 (𝜑 → ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩ ∈ V)
643, 56, 58, 61, 63ovmpt2d 6686 . 2 (𝜑 → (𝐹 ⟨,⟩F 𝐺) = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
651, 64syl5eq 2656 1 (𝜑𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wcel 1977  Vcvv 3173  csb 3499  cop 4131   class class class wbr 4583  cmpt 4643  dom cdm 5038  Rel wrel 5043  wf 5800  cfv 5804  (class class class)co 6549  cmpt2 6551  1st c1st 7057  2nd c2nd 7058  Basecbs 15695  Hom chom 15779   Func cfunc 16337   ⟨,⟩F cprf 16634
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-map 7746  df-ixp 7795  df-func 16341  df-prf 16638
This theorem is referenced by:  prf1  16663  prf2fval  16664  prfcl  16666  prf1st  16667  prf2nd  16668  1st2ndprf  16669
  Copyright terms: Public domain W3C validator