![]() |
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 7457 | . . 3 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑎(𝐶‘𝐺)𝑏) = (𝑋(𝐶‘𝐺)𝑌)) | |
5 | 4 | breqd 5177 | . 2 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝑌) → (𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ ↔ 𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ)) |
6 | fveq2 6920 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝐶‘𝑔) = (𝐶‘𝐺)) | |
7 | 6 | oveqd 7465 | . . 3 ⊢ (𝑔 = 𝐺 → (𝑎(𝐶‘𝑔)𝑏) = (𝑎(𝐶‘𝐺)𝑏)) |
8 | 7 | breqd 5177 | . 2 ⊢ (𝑔 = 𝐺 → (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ↔ 𝑓(𝑎(𝐶‘𝐺)𝑏)ℎ)) |
9 | mptmpoopabovd.m | . 2 ⊢ 𝑀 = (𝑔 ∈ V ↦ (𝑎 ∈ (𝐴‘𝑔), 𝑏 ∈ (𝐵‘𝑔) ↦ {〈𝑓, ℎ〉 ∣ (𝑓(𝑎(𝐶‘𝑔)𝑏)ℎ ∧ 𝑓(𝐷‘𝑔)ℎ)})) | |
10 | 1, 2, 3, 5, 8, 9 | mptmpoopabbrd 8121 | 1 ⊢ (𝜑 → (𝑋(𝑀‘𝐺)𝑌) = {〈𝑓, ℎ〉 ∣ (𝑓(𝑋(𝐶‘𝐺)𝑌)ℎ ∧ 𝑓(𝐷‘𝐺)ℎ)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 Vcvv 3488 class class class wbr 5166 {copab 5228 ↦ cmpt 5249 ‘cfv 6573 (class class class)co 7448 ∈ cmpo 7450 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-1st 8030 df-2nd 8031 |
This theorem is referenced by: wksonproplem 29740 trlsonfval 29742 pthsonfval 29776 spthson 29777 |
Copyright terms: Public domain | W3C validator |