| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mptmpoopabovd | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| mptmpoopabbrd.g | ⊢ (𝜑 → 𝐺 ∈ 𝑊) |
| mptmpoopabbrd.x | ⊢ (𝜑 → 𝑋 ∈ (𝐴‘𝐺)) |
| mptmpoopabbrd.y | ⊢ (𝜑 → 𝑌 ∈ (𝐵‘𝐺)) |
| mptmpoopabovd.m | ⊢ 𝑀 = (𝑔 ∈ V ↦ (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {〈𝑓, ℎ〉 ∣ (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ∧ 𝑓(𝐷‘𝑔)ℎ)})) |
| Ref | Expression |
|---|---|
| mptmpoopabovd | ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {〈𝑓, ℎ〉 ∣ (𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ ∧ 𝑓(𝐷‘𝐺)ℎ)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mptmpoopabbrd.g | . 2 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 2 | mptmpoopabbrd.x | . 2 ⊢ (𝜑 → 𝑋 ∈ (𝐴‘𝐺)) | |
| 3 | mptmpoopabbrd.y | . 2 ⊢ (𝜑 → 𝑌 ∈ (𝐵‘𝐺)) | |
| 4 | oveq12 7367 | . . 3 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑎(𝐶‘𝐺)𝑏) = (𝑋(𝐶‘𝐺)𝑌)) | |
| 5 | 4 | breqd 5109 | . 2 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ ↔ 𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ)) |
| 6 | fveq2 6834 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝐶‘𝑔) = (𝐶‘𝐺)) | |
| 7 | 6 | oveqd 7375 | . . 3 ⊢ (𝑔 = 𝐺 → (𝑎(𝐶‘𝑔)𝑏) = (𝑎(𝐶‘𝐺)𝑏)) |
| 8 | 7 | breqd 5109 | . 2 ⊢ (𝑔 = 𝐺 → (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ↔ 𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ)) |
| 9 | mptmpoopabovd.m | . 2 ⊢ 𝑀 = (𝑔 ∈ V ↦ (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {〈𝑓, ℎ〉 ∣ (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ∧ 𝑓(𝐷‘𝑔)ℎ)})) | |
| 10 | 1, 2, 3, 5, 8, 9 | mptmpoopabbrd 8024 | 1 ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {〈𝑓, ℎ〉 ∣ (𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ ∧ 𝑓(𝐷‘𝐺)ℎ)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 Vcvv 3440 class class class wbr 5098 {copab 5160 ↦ cmpt 5179 ‘cfv 6492 (class class class)co 7358 ∈ cmpo 7360 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 |
| This theorem is referenced by: wksonproplem 29776 trlsonfval 29777 pthsonfval 29813 spthson 29814 |
| Copyright terms: Public domain | W3C validator |