| 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 7376 | . . 3 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑎(𝐶‘𝐺)𝑏) = (𝑋(𝐶‘𝐺)𝑌)) | |
| 5 | 4 | breqd 5096 | . 2 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ ↔ 𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ)) |
| 6 | fveq2 6840 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝐶‘𝑔) = (𝐶‘𝐺)) | |
| 7 | 6 | oveqd 7384 | . . 3 ⊢ (𝑔 = 𝐺 → (𝑎(𝐶‘𝑔)𝑏) = (𝑎(𝐶‘𝐺)𝑏)) |
| 8 | 7 | breqd 5096 | . 2 ⊢ (𝑔 = 𝐺 → (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ↔ 𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ)) |
| 9 | mptmpoopabovd.m | . 2 ⊢ 𝑀 = (𝑔 ∈ V ↦ (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {〈𝑓, ℎ〉 ∣ (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ∧ 𝑓(𝐷‘𝑔)ℎ)})) | |
| 10 | 1, 2, 3, 5, 8, 9 | mptmpoopabbrd 8033 | 1 ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {〈𝑓, ℎ〉 ∣ (𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ ∧ 𝑓(𝐷‘𝐺)ℎ)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3429 class class class wbr 5085 {copab 5147 ↦ cmpt 5166 ‘cfv 6498 (class class class)co 7367 ∈ cmpo 7369 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-1st 7942 df-2nd 7943 |
| This theorem is referenced by: wksonproplem 29771 trlsonfval 29772 pthsonfval 29808 spthson 29809 |
| Copyright terms: Public domain | W3C validator |