| 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 6894 | . 2 ⊢ (𝑊‘𝐺) ∈ V | |
| 2 | elopabran 5542 | . . 3 ⊢ (𝑧 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} → 𝑧 ∈ (𝑊‘𝐺)) | |
| 3 | 2 | ssriv 3967 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ⊆ (𝑊‘𝐺) |
| 4 | 1, 3 | ssexi 5297 | 1 ⊢ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 ∈ wcel 2109 Vcvv 3464 class class class wbr 5124 {copab 5186 ‘cfv 6536 |
| 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-ext 2708 ax-sep 5271 ax-nul 5281 |
| 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-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-ne 2934 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-sn 4607 df-pr 4609 df-uni 4889 df-br 5125 df-opab 5187 df-iota 6489 df-fv 6544 |
| This theorem is referenced by: fvmptopab 7466 mptmpoopabbrd 8084 mptmpoopabbrdOLD 8085 |
| Copyright terms: Public domain | W3C validator |