| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opabresex2 | Structured version Visualization version GIF version | ||
| Description: Restrictions of a collection of ordered pairs of related elements are sets. (Contributed by Alexander van der Vekens, 1-Nov-2017.) (Revised by AV, 15-Jan-2021.) Add disjoint variable conditions betweem 𝑊, 𝐺 and 𝑥, 𝑦 to remove hypotheses. (Revised by SN, 13-Dec-2024.) |
| Ref | Expression |
|---|---|
| opabresex2 | ⊢ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6844 | . 2 ⊢ (𝑊‘𝐺) ∈ V | |
| 2 | elopabran 5506 | . . 3 ⊢ (𝑧 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} → 𝑧 ∈ (𝑊‘𝐺)) | |
| 3 | 2 | ssriv 3921 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ⊆ (𝑊‘𝐺) |
| 4 | 1, 3 | ssexi 5253 | 1 ⊢ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 397 ∈ wcel 2121 Vcvv 3433 class class class wbr 5075 {copab 5137 ‘cfv 6489 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 ax-sep 5221 ax-nul 5231 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-ne 2937 df-rab 3394 df-v 3435 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-sn 4559 df-pr 4561 df-uni 4842 df-br 5076 df-opab 5138 df-iota 6445 df-fv 6497 |
| This theorem is referenced by: fvmptopab 7415 mptmpoopabbrd 8026 |
| Copyright terms: Public domain | W3C validator |