| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > df-opab | GIF version | ||
| Description: Define the class abstraction of a collection of ordered pairs. Definition 3.3 of [Monk1] p. 34. Usually 𝑥 and 𝑦 are distinct, although the definition doesn't strictly require it. The brace notation is called "class abstraction" by Quine; it is also (more commonly) called a "class builder" in the literature. (Contributed by NM, 4-Jul-1994.) |
| Ref | Expression |
|---|---|
| df-opab | ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wph | . . 3 wff 𝜑 | |
| 2 | vx | . . 3 setvar 𝑥 | |
| 3 | vy | . . 3 setvar 𝑦 | |
| 4 | 1, 2, 3 | copab 4192 | . 2 class {〈𝑥, 𝑦〉 ∣ 𝜑} |
| 5 | vz | . . . . . . . 8 setvar 𝑧 | |
| 6 | 5 | cv 1401 | . . . . . . 7 class 𝑧 |
| 7 | 2 | cv 1401 | . . . . . . . 8 class 𝑥 |
| 8 | 3 | cv 1401 | . . . . . . . 8 class 𝑦 |
| 9 | 7, 8 | cop 3712 | . . . . . . 7 class 〈𝑥, 𝑦〉 |
| 10 | 6, 9 | wceq 1402 | . . . . . 6 wff 𝑧 = 〈𝑥, 𝑦〉 |
| 11 | 10, 1 | wa 104 | . . . . 5 wff (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 12 | 11, 3 | wex 1545 | . . . 4 wff ∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 13 | 12, 2 | wex 1545 | . . 3 wff ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 14 | 13, 5 | cab 2224 | . 2 class {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| 15 | 4, 14 | wceq 1402 | 1 wff {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| Colors of variables: wff set class |
| This definition is used by: opabss 4196 opabbid 4197 nfopab 4200 nfopab1 4201 nfopab2 4202 cbvopab 4203 cbvopab1 4205 cbvopab2 4206 cbvopab1s 4207 cbvopab2v 4209 unopab 4211 opabid 4400 elopab 4402 ssopab2 4420 iunopab 4426 elxpi 4792 opabssxpd 4813 rabxp 4814 csbxpg 4858 relopabi 4907 opabbrex 6135 dfoprab2 6138 dmoprab 6172 dfopab2 6427 cnvoprab 6474 |
| Copyright terms: Public domain | W3C validator |