| 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 7399 | . . 3 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑎(𝐶‘𝐺)𝑏) = (𝑋(𝐶‘𝐺)𝑌)) | |
| 5 | 4 | breqd 5121 | . 2 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ ↔ 𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ)) |
| 6 | fveq2 6861 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝐶‘𝑔) = (𝐶‘𝐺)) | |
| 7 | 6 | oveqd 7407 | . . 3 ⊢ (𝑔 = 𝐺 → (𝑎(𝐶‘𝑔)𝑏) = (𝑎(𝐶‘𝐺)𝑏)) |
| 8 | 7 | breqd 5121 | . 2 ⊢ (𝑔 = 𝐺 → (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ↔ 𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ)) |
| 9 | mptmpoopabovd.m | . 2 ⊢ 𝑀 = (𝑔 ∈ V ↦ (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {〈𝑓, ℎ〉 ∣ (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ∧ 𝑓(𝐷‘𝑔)ℎ)})) | |
| 10 | 1, 2, 3, 5, 8, 9 | mptmpoopabbrd 8062 | 1 ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {〈𝑓, ℎ〉 ∣ (𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ ∧ 𝑓(𝐷‘𝐺)ℎ)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 Vcvv 3450 class class class wbr 5110 {copab 5172 ↦ cmpt 5191 ‘cfv 6514 (class class class)co 7390 ∈ cmpo 7392 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-fv 6522 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7971 df-2nd 7972 |
| This theorem is referenced by: wksonproplem 29639 trlsonfval 29641 pthsonfval 29677 spthson 29678 |
| Copyright terms: Public domain | W3C validator |