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

Theorem mptmpoopabovd 8095
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
StepHypRef Expression
1 mptmpoopabbrd.g . 2 (𝜑 → 𝐺 ∈ 𝑊)
2 mptmpoopabbrd.x . 2 (𝜑 → 𝑋 ∈ (𝐴‘𝐺))
3 mptmpoopabbrd.y . 2 (𝜑 → 𝑌 ∈ (𝐵‘𝐺))
4 oveq12 7429 . . 3 ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑎(𝐶‘𝐺)𝑏) = (𝑋(𝐶‘𝐺)𝑌))
54breqd 5113 . 2 ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ ↔ 𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ))
6 fveq2 6885 . . . 4 (𝑔 = 𝐺 → (𝐶‘𝑔) = (𝐶‘𝐺))
76oveqd 7437 . . 3 (𝑔 = 𝐺 → (𝑎(𝐶‘𝑔)𝑏) = (𝑎(𝐶‘𝐺)𝑏))
87breqd 5113 . 2 (𝑔 = 𝐺 → (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ↔ 𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ))
9 mptmpoopabovd.m . 2 𝑀 = (𝑔 ∈ V ↦ (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {⟨𝑓, ℎ⟩ ∣ (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ∧ 𝑓(𝐷‘𝑔)ℎ)}))
101, 2, 3, 5, 8, 9mptmpoopabbrd 8094 1 (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {⟨𝑓, ℎ⟩ ∣ (𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ ∧ 𝑓(𝐷‘𝐺)ℎ)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   class class class wbr 5102  {copab 5166   ↦ cmpt 5185  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002
This theorem is used by:  wksonproplem  30292  trlsonfval  30293  pthsonfval  30331  spthson  30332
  Copyright terms: Public domain W3C validator