| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > df-pr | Structured version Visualization version GIF version | ||
| Description: Define unordered pair of classes. Definition 7.1 of [Quine] p. 48. For example, 𝐴 ∈ {1, -1} → (𝐴↑2) = 1 (ex-pr 26679). They are unordered, so {𝐴, 𝐵} = {𝐵, 𝐴} as proven by prcom 4211. For a more traditional definition, but requiring a dummy variable, see dfpr2 4143. (Contributed by NM, 21-Jun-1993.) |
| Ref | Expression |
|---|---|
| df-pr | ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cA | . . 3 class 𝐴 | |
| 2 | cB | . . 3 class 𝐵 | |
| 3 | 1, 2 | cpr 4127 | . 2 class {𝐴, 𝐵} |
| 4 | 1 | csn 4125 | . . 3 class {𝐴} |
| 5 | 2 | csn 4125 | . . 3 class {𝐵} |
| 6 | 4, 5 | cun 3538 | . 2 class ({𝐴} ∪ {𝐵}) |
| 7 | 3, 6 | wceq 1475 | 1 wff {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) |
| Copyright terms: Public domain | W3C validator |