Theorem mptmpoopabbrd 8121

Description: The operation value of a function value of a collection of ordered pairs of elements related in two ways. (Contributed by Alexander van Vekens, 8-Nov-2017.) (Revised by AV, 15-Jan-2021.) Add disjoint variable condition on 𝐷, 𝑓, ℎ to remove hypotheses; avoid ax-rep 5303. (Revised by SN, 7-Apr-2025.)

Hypotheses

Ref	Expression
mptmpoopabbrd.g	⊢ (𝜑 → 𝐺 ∈ 𝑊)
mptmpoopabbrd.x	⊢ (𝜑 → 𝑋 ∈ (𝐴‘𝐺))
mptmpoopabbrd.y	⊢ (𝜑 → 𝑌 ∈ (𝐵‘𝐺))
mptmpoopabbrd.1	⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝜏 ↔ 𝜃))
mptmpoopabbrd.2	⊢ (𝑔 = 𝐺 → (𝜒 ↔ 𝜏))
mptmpoopabbrd.m	⊢ 𝑀 = (𝑔 ∈ V ↦ (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜒 ∧ 𝑓(𝐷‘𝑔)ℎ)}))

Assertion

Ref	Expression
mptmpoopabbrd	⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)})

Distinct variable groups:   𝐴,𝑎,𝑏,𝑔   𝐵,𝑎,𝑏,𝑔   𝐷,𝑎,𝑏,𝑓,𝑔,ℎ   𝐺,𝑎,𝑏,𝑓,𝑔,ℎ   𝑔,𝑊   𝑋,𝑎,𝑏,𝑓,𝑔,ℎ   𝑌,𝑎,𝑏,𝑓,𝑔,ℎ   𝜑,𝑓,ℎ   𝜏,𝑔   𝜃,𝑎,𝑏

Allowed substitution hints:   𝜑(𝑔,𝑎,𝑏)   𝜒(𝑓,𝑔,ℎ,𝑎,𝑏)   𝜃(𝑓,𝑔,ℎ)   𝜏(𝑓,ℎ,𝑎,𝑏)   𝐴(𝑓,ℎ)   𝐵(𝑓,ℎ)   𝑀(𝑓,𝑔,ℎ,𝑎,𝑏)   𝑊(𝑓,ℎ,𝑎,𝑏)

Proof of Theorem mptmpoopabbrd

Step	Hyp	Ref	Expression
1		mptmpoopabbrd.m	. . . 4 ⊢ 𝑀 = (𝑔 ∈ V ↦ (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜒 ∧ 𝑓(𝐷‘𝑔)ℎ)}))
2		fveq2 6920	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝐴‘𝑔) = (𝐴‘𝐺))
3		fveq2 6920	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝐵‘𝑔) = (𝐵‘𝐺))
4		mptmpoopabbrd.2	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝜒 ↔ 𝜏))
5		fveq2 6920	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝐷‘𝑔) = (𝐷‘𝐺))
6	5	breqd 5177	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝑓(𝐷‘𝑔)ℎ ↔ 𝑓(𝐷‘𝐺)ℎ))
7	4, 6	anbi12d 631	. . . . . 6 ⊢ (𝑔 = 𝐺 → ((𝜒 ∧ 𝑓(𝐷‘𝑔)ℎ) ↔ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)))
8	7	opabbidv 5232	. . . . 5 ⊢ (𝑔 = 𝐺 → {⟨𝑓, ℎ⟩ ∣ (𝜒 ∧ 𝑓(𝐷‘𝑔)ℎ)} = {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})
9	2, 3, 8	mpoeq123dv 7525	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜒 ∧ 𝑓(𝐷‘𝑔)ℎ)}) = (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}))
10		mptmpoopabbrd.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ 𝑊)
11	10	elexd 3512	. . . 4 ⊢ (𝜑 → 𝐺 ∈ V)
12		fvex 6933	. . . . . 6 ⊢ (𝐴‘𝐺) ∈ V
13		fvex 6933	. . . . . 6 ⊢ (𝐵‘𝐺) ∈ V
14		fvex 6933	. . . . . . 7 ⊢ (𝐷‘𝐺) ∈ V
15	14	pwex 5398	. . . . . 6 ⊢ 𝒫 (𝐷‘𝐺) ∈ V
16		simpr 484	. . . . . . . . . 10 ⊢ ((𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ) → 𝑓(𝐷‘𝐺)ℎ)
17	16	ssopab2i 5569	. . . . . . . . 9 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} ⊆ {⟨𝑓, ℎ⟩ ∣ 𝑓(𝐷‘𝐺)ℎ}
18		opabss 5230	. . . . . . . . 9 ⊢ {⟨𝑓, ℎ⟩ ∣ 𝑓(𝐷‘𝐺)ℎ} ⊆ (𝐷‘𝐺)
19	17, 18	sstri 4018	. . . . . . . 8 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} ⊆ (𝐷‘𝐺)
20	14, 19	elpwi2 5353	. . . . . . 7 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} ∈ 𝒫 (𝐷‘𝐺)
21	20	rgen2w 3072	. . . . . 6 ⊢ ∀𝑎 ∈ (𝐴‘𝐺)∀𝑏 ∈ (𝐵‘𝐺){⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} ∈ 𝒫 (𝐷‘𝐺)
22	12, 13, 15, 21	mpoexw 8119	. . . . 5 ⊢ (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}) ∈ V
23	22	a1i 11	. . . 4 ⊢ (𝜑 → (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}) ∈ V)
24	1, 9, 11, 23	fvmptd3 7052	. . 3 ⊢ (𝜑 → (𝑀‘𝐺) = (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}))
25	24	oveqd 7465	. 2 ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = (𝑋(𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})𝑌))
26		mptmpoopabbrd.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝐴‘𝐺))
27		mptmpoopabbrd.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ (𝐵‘𝐺))
28		mptmpoopabbrd.1	. . . . . 6 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝜏 ↔ 𝜃))
29	28	anbi1d 630	. . . . 5 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → ((𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ) ↔ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)))
30	29	opabbidv 5232	. . . 4 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} = {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)})
31		eqid 2740	. . . 4 ⊢ (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}) = (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})
32		ancom 460	. . . . . 6 ⊢ ((𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ) ↔ (𝑓(𝐷‘𝐺)ℎ ∧ 𝜃))
33	32	opabbii 5233	. . . . 5 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)} = {⟨𝑓, ℎ⟩ ∣ (𝑓(𝐷‘𝐺)ℎ ∧ 𝜃)}
34		opabresex2 7502	. . . . 5 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝑓(𝐷‘𝐺)ℎ ∧ 𝜃)} ∈ V
35	33, 34	eqeltri 2840	. . . 4 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)} ∈ V
36	30, 31, 35	ovmpoa 7605	. . 3 ⊢ ((𝑋 ∈ (𝐴‘𝐺) ∧ 𝑌 ∈ (𝐵‘𝐺)) → (𝑋(𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})𝑌) = {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)})
37	26, 27, 36	syl2anc 583	. 2 ⊢ (𝜑 → (𝑋(𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})𝑌) = {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)})
38	25, 37	eqtrd 2780	1 ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108  Vcvv 3488  𝒫 cpw 4622   class class class wbr 5166  {copab 5228   ↦ cmpt 5249  ‘cfv 6573  (class class class)co 7448   ∈ cmpo 7450

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031

This theorem is referenced by:  mptmpoopabovd  8123  wlkson  29692