| 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 4175 | . 2 class {〈𝑥, 𝑦〉 ∣ 𝜑} |
| 5 | vz | . . . . . . . 8 setvar 𝑧 | |
| 6 | 5 | cv 1397 | . . . . . . 7 class 𝑧 |
| 7 | 2 | cv 1397 | . . . . . . . 8 class 𝑥 |
| 8 | 3 | cv 1397 | . . . . . . . 8 class 𝑦 |
| 9 | 7, 8 | cop 3697 | . . . . . . 7 class 〈𝑥, 𝑦〉 |
| 10 | 6, 9 | wceq 1398 | . . . . . 6 wff 𝑧 = 〈𝑥, 𝑦〉 |
| 11 | 10, 1 | wa 104 | . . . . 5 wff (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 12 | 11, 3 | wex 1541 | . . . 4 wff ∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 13 | 12, 2 | wex 1541 | . . 3 wff ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 14 | 13, 5 | cab 2220 | . 2 class {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| 15 | 4, 14 | wceq 1398 | 1 wff {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| Colors of variables: wff set class |
| This definition is referenced by: opabss 4179 opabbid 4180 nfopab 4183 nfopab1 4184 nfopab2 4185 cbvopab 4186 cbvopab1 4188 cbvopab2 4189 cbvopab1s 4190 cbvopab2v 4192 unopab 4194 opabid 4379 elopab 4381 ssopab2 4399 iunopab 4405 elxpi 4770 opabssxpd 4791 rabxp 4792 csbxpg 4836 relopabi 4885 opabbrex 6105 dfoprab2 6108 dmoprab 6142 dfopab2 6396 cnvoprab 6443 |
| Copyright terms: Public domain | W3C validator |