Theorem mptmpoopabbrd 8087

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 5243. (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 6888	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝐴‘𝑔) = (𝐴‘𝐺))
3		fveq2 6888	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝐵‘𝑔) = (𝐵‘𝐺))
4		mptmpoopabbrd.2	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝜒 ↔ 𝜏))
5		fveq2 6888	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝐷‘𝑔) = (𝐷‘𝐺))
6	5	breqd 5125	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝑓(𝐷‘𝑔)ℎ ↔ 𝑓(𝐷‘𝐺)ℎ))
7	4, 6	anbi12d 644	. . . . . 6 ⊢ (𝑔 = 𝐺 → ((𝜒 ∧ 𝑓(𝐷‘𝑔)ℎ) ↔ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)))
8	7	opabbidv 5182	. . . . 5 ⊢ (𝑔 = 𝐺 → {⟨𝑓, ℎ⟩ ∣ (𝜒 ∧ 𝑓(𝐷‘𝑔)ℎ)} = {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})
9	2, 3, 8	mpoeq123dv 7498	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜒 ∧ 𝑓(𝐷‘𝑔)ℎ)}) = (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}))
10		mptmpoopabbrd.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ 𝑊)
11	10	elexd 3481	. . . 4 ⊢ (𝜑 → 𝐺 ∈ V)
12		fvex 6901	. . . . . 6 ⊢ (𝐴‘𝐺) ∈ V
13		fvex 6901	. . . . . 6 ⊢ (𝐵‘𝐺) ∈ V
14		fvex 6901	. . . . . . 7 ⊢ (𝐷‘𝐺) ∈ V
15	14	pwex 5356	. . . . . 6 ⊢ 𝒫 (𝐷‘𝐺) ∈ V
16		simpr 490	. . . . . . . . . 10 ⊢ ((𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ) → 𝑓(𝐷‘𝐺)ℎ)
17	16	ssopab2i 5540	. . . . . . . . 9 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} ⊆ {⟨𝑓, ℎ⟩ ∣ 𝑓(𝐷‘𝐺)ℎ}
18		opabss 5180	. . . . . . . . 9 ⊢ {⟨𝑓, ℎ⟩ ∣ 𝑓(𝐷‘𝐺)ℎ} ⊆ (𝐷‘𝐺)
19	17, 18	sstri 3949	. . . . . . . 8 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} ⊆ (𝐷‘𝐺)
20	14, 19	elpwi2 5311	. . . . . . 7 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} ∈ 𝒫 (𝐷‘𝐺)
21	20	rgen2w 3087	. . . . . 6 ⊢ ∀𝑎 ∈ (𝐴‘𝐺)∀𝑏 ∈ (𝐵‘𝐺){⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} ∈ 𝒫 (𝐷‘𝐺)
22	12, 13, 15, 21	mpoexw 8084	. . . . 5 ⊢ (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}) ∈ V
23	22	a1i 11	. . . 4 ⊢ (𝜑 → (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}) ∈ V)
24	1, 9, 11, 23	fvmptd3 7020	. . 3 ⊢ (𝜑 → (𝑀‘𝐺) = (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}))
25	24	oveqd 7440	. 2 ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = (𝑋(𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})𝑌))
26		mptmpoopabbrd.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝐴‘𝐺))
27		mptmpoopabbrd.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ (𝐵‘𝐺))
28		mptmpoopabbrd.1	. . . . . 6 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝜏 ↔ 𝜃))
29	28	anbi1d 643	. . . . 5 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → ((𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ) ↔ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)))
30	29	opabbidv 5182	. . . 4 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)} = {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)})
31		eqid 2766	. . . 4 ⊢ (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)}) = (𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})
32		ancom 466	. . . . . 6 ⊢ ((𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ) ↔ (𝑓(𝐷‘𝐺)ℎ ∧ 𝜃))
33	32	opabbii 5183	. . . . 5 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)} = {⟨𝑓, ℎ⟩ ∣ (𝑓(𝐷‘𝐺)ℎ ∧ 𝜃)}
34		opabresex2 7477	. . . . 5 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝑓(𝐷‘𝐺)ℎ ∧ 𝜃)} ∈ V
35	33, 34	eqeltri 2862	. . . 4 ⊢ {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)} ∈ V
36	30, 31, 35	ovmpoa 7578	. . 3 ⊢ ((𝑋 ∈ (𝐴‘𝐺) ∧ 𝑌 ∈ (𝐵‘𝐺)) → (𝑋(𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})𝑌) = {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)})
37	26, 27, 36	syl2anc 596	. 2 ⊢ (𝜑 → (𝑋(𝑎 ∈ (𝐴‘𝐺), 𝑏 ∈ (𝐵‘𝐺) ↦ {⟨𝑓, ℎ⟩ ∣ (𝜏 ∧ 𝑓(𝐷‘𝐺)ℎ)})𝑌) = {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)})
38	25, 37	eqtrd 2801	1 ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {⟨𝑓, ℎ⟩ ∣ (𝜃 ∧ 𝑓(𝐷‘𝐺)ℎ)})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3458  𝒫 cpw 4567   class class class wbr 5114  {copab 5178   ↦ cmpt 5197  ‘cfv 6543  (class class class)co 7423   ∈ cmpo 7425

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996

This theorem is used by:  mptmpoopabovd  8088  wlkson  30041