| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opabbrex | Structured version Visualization version GIF version | ||
| Description: A collection of ordered pairs with an extension of a binary relation is a set. (Contributed by Alexander van der Vekens, 1-Nov-2017.) (Revised by BJ/AV, 20-Jun-2019.) (Proof shortened by OpenAI, 25-Mar-2020.) |
| Ref | Expression |
|---|---|
| opabbrex | ⊢ ((∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝜑) ∧ {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ 𝑉) → {〈𝑥, 𝑦〉 ∣ (𝑥𝑅𝑦 ∧ 𝜓)} ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 484 | . 2 ⊢ ((∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝜑) ∧ {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ 𝑉) → {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ 𝑉) | |
| 2 | pm3.41 492 | . . . . 5 ⊢ ((𝑥𝑅𝑦 → 𝜑) → ((𝑥𝑅𝑦 ∧ 𝜓) → 𝜑)) | |
| 3 | 2 | 2alimi 1814 | . . . 4 ⊢ (∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝜑) → ∀𝑥∀𝑦((𝑥𝑅𝑦 ∧ 𝜓) → 𝜑)) |
| 4 | 3 | adantr 480 | . . 3 ⊢ ((∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝜑) ∧ {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ 𝑉) → ∀𝑥∀𝑦((𝑥𝑅𝑦 ∧ 𝜓) → 𝜑)) |
| 5 | ssopab2 5504 | . . 3 ⊢ (∀𝑥∀𝑦((𝑥𝑅𝑦 ∧ 𝜓) → 𝜑) → {〈𝑥, 𝑦〉 ∣ (𝑥𝑅𝑦 ∧ 𝜓)} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜑}) | |
| 6 | 4, 5 | syl 17 | . 2 ⊢ ((∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝜑) ∧ {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ 𝑉) → {〈𝑥, 𝑦〉 ∣ (𝑥𝑅𝑦 ∧ 𝜓)} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜑}) |
| 7 | 1, 6 | ssexd 5273 | 1 ⊢ ((∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝜑) ∧ {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ 𝑉) → {〈𝑥, 𝑦〉 ∣ (𝑥𝑅𝑦 ∧ 𝜓)} ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∀wal 1540 ∈ wcel 2114 Vcvv 3442 ⊆ wss 3903 class class class wbr 5100 {copab 5162 |
| 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-ext 2709 ax-sep 5245 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-3an 1089 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-in 3910 df-ss 3920 df-opab 5163 |
| This theorem is referenced by: sprmpod 8178 opabresex0d 47674 |
| Copyright terms: Public domain | W3C validator |