Theorem mptmpoopabovd 8082

Description: The operation value of a function value of a collection of ordered pairs of related elements. (Contributed by Alexander van der Vekens, 8-Nov-2017.) (Revised by AV, 15-Jan-2021.) Add disjoint variable condition on 𝐷, 𝑓, ℎ to remove hypotheses. (Revised by SN, 13-Dec-2024.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem mptmpoopabovd

Step	Hyp	Ref	Expression
1		mptmpoopabbrd.g	. 2 ⊢ (𝜑 → 𝐺 ∈ 𝑊)
2		mptmpoopabbrd.x	. 2 ⊢ (𝜑 → 𝑋 ∈ (𝐴‘𝐺))
3		mptmpoopabbrd.y	. 2 ⊢ (𝜑 → 𝑌 ∈ (𝐵‘𝐺))
4		oveq12 7423	. . 3 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑎(𝐶‘𝐺)𝑏) = (𝑋(𝐶‘𝐺)𝑌))
5	4	breqd 5114	. 2 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ ↔ 𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ))
6		fveq2 6879	. . . 4 ⊢ (𝑔 = 𝐺 → (𝐶‘𝑔) = (𝐶‘𝐺))
7	6	oveqd 7431	. . 3 ⊢ (𝑔 = 𝐺 → (𝑎(𝐶‘𝑔)𝑏) = (𝑎(𝐶‘𝐺)𝑏))
8	7	breqd 5114	. 2 ⊢ (𝑔 = 𝐺 → (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ↔ 𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ))
9		mptmpoopabovd.m	. 2 ⊢ 𝑀 = (𝑔 ∈ V ↦ (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {⟨𝑓, ℎ⟩ ∣ (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ∧ 𝑓(𝐷‘𝑔)ℎ)}))
10	1, 2, 3, 5, 8, 9	mptmpoopabbrd 8081	1 ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {⟨𝑓, ℎ⟩ ∣ (𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ ∧ 𝑓(𝐷‘𝐺)ℎ)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   class class class wbr 5103  {copab 5167   ↦ cmpt 5186  ‘cfv 6533  (class class class)co 7414   ∈ cmpo 7416

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988

This theorem is used by:  wksonproplem  30169  trlsonfval  30170  pthsonfval  30208  spthson  30209