| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > opabssi | Structured version Visualization version GIF version | ||
| Description: Sufficient condition for a collection of ordered pairs to be a subclass of a relation. (Contributed by Peter Mazsa, 21-Oct-2019.) (Revised by Thierry Arnoux, 18-Feb-2022.) |
| Ref | Expression |
|---|---|
| opabssi.1 | ⊢ (𝜑 → 〈𝑥, 𝑦〉 ∈ 𝐴) |
| Ref | Expression |
|---|---|
| opabssi | ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-opab 5175 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
| 2 | eleq1 2857 | . . . . . 6 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑧 ∈ 𝐴 ↔ 〈𝑥, 𝑦〉 ∈ 𝐴)) | |
| 3 | 2 | biimprd 251 | . . . . 5 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (〈𝑥, 𝑦〉 ∈ 𝐴 → 𝑧 ∈ 𝐴)) |
| 4 | opabssi.1 | . . . . 5 ⊢ (𝜑 → 〈𝑥, 𝑦〉 ∈ 𝐴) | |
| 5 | 3, 4 | impel 514 | . . . 4 ⊢ ((𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) → 𝑧 ∈ 𝐴) |
| 6 | 5 | exlimivv 1959 | . . 3 ⊢ (∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) → 𝑧 ∈ 𝐴) |
| 7 | 6 | abssi 4030 | . 2 ⊢ {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} ⊆ 𝐴 |
| 8 | 1, 7 | eqsstri 3991 | 1 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∃wex 1806 ∈ wcel 2149 {cab 2747 ⊆ wss 3913 〈cop 4597 {copab 5174 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ss 3930 df-opab 5175 |
| This theorem is referenced by: opabid2ss 32896 |
| Copyright terms: Public domain | W3C validator |