| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfpr2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of a pair. Definition 5.1 of [TakeutiZaring] p. 15. (Contributed by NM, 24-Apr-1994.) |
| Ref | Expression |
|---|---|
| dfpr2 | ⊢ {𝐴, 𝐵} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-pr 4585 | . 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 2 | elun 4107 | . . . 4 ⊢ (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵})) | |
| 3 | velsn 4598 | . . . . 5 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
| 4 | velsn 4598 | . . . . 5 ⊢ (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵) | |
| 5 | 3, 4 | orbi12i 915 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵}) ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)) |
| 6 | 2, 5 | bitri 275 | . . 3 ⊢ (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)) |
| 7 | 6 | eqabi 2872 | . 2 ⊢ ({𝐴} ∪ {𝐵}) = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)} |
| 8 | 1, 7 | eqtri 2760 | 1 ⊢ {𝐴, 𝐵} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)} |
| Colors of variables: wff setvar class |
| Syntax hints: ∨ wo 848 = wceq 1542 ∈ wcel 2114 {cab 2715 ∪ cun 3901 {csn 4582 {cpr 4584 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-v 3444 df-un 3908 df-sn 4583 df-pr 4585 |
| This theorem is referenced by: dfsn2ALT 4604 elprg 4605 nfpr 4651 pwpw0 4771 pwsn 4858 zfpair 5368 grothprimlem 10756 nb3grprlem1 29465 rabsspr 32587 abpr 43759 |
| Copyright terms: Public domain | W3C validator |