| 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 4149 | . 2 class {〈𝑥, 𝑦〉 ∣ 𝜑} |
| 5 | vz | . . . . . . . 8 setvar 𝑧 | |
| 6 | 5 | cv 1396 | . . . . . . 7 class 𝑧 |
| 7 | 2 | cv 1396 | . . . . . . . 8 class 𝑥 |
| 8 | 3 | cv 1396 | . . . . . . . 8 class 𝑦 |
| 9 | 7, 8 | cop 3672 | . . . . . . 7 class 〈𝑥, 𝑦〉 |
| 10 | 6, 9 | wceq 1397 | . . . . . 6 wff 𝑧 = 〈𝑥, 𝑦〉 |
| 11 | 10, 1 | wa 104 | . . . . 5 wff (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 12 | 11, 3 | wex 1540 | . . . 4 wff ∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 13 | 12, 2 | wex 1540 | . . 3 wff ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 14 | 13, 5 | cab 2217 | . 2 class {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| 15 | 4, 14 | wceq 1397 | 1 wff {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| Colors of variables: wff set class |
| This definition is referenced by: opabss 4153 opabbid 4154 nfopab 4157 nfopab1 4158 nfopab2 4159 cbvopab 4160 cbvopab1 4162 cbvopab2 4163 cbvopab1s 4164 cbvopab2v 4166 unopab 4168 opabid 4350 elopab 4352 ssopab2 4370 iunopab 4376 elxpi 4741 opabssxpd 4762 rabxp 4763 csbxpg 4807 relopabi 4855 opabbrex 6064 dfoprab2 6067 dmoprab 6101 dfopab2 6351 cnvoprab 6398 |
| Copyright terms: Public domain | W3C validator |