Theorem dfpr2 4668

Description: Alternate definition of a pair. Definition 5.1 of [TakeutiZaring] p. 15. (Contributed by NM, 24-Apr-1994.)

Assertion

Ref	Expression
dfpr2	⊢ {𝐴, 𝐵} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)}

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem dfpr2

Step	Hyp	Ref	Expression
1		df-pr 4651	. 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
2		elun 4176	. . . 4 ⊢ (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵}))
3		velsn 4664	. . . . 5 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
4		velsn 4664	. . . . 5 ⊢ (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵)
5	3, 4	orbi12i 913	. . . 4 ⊢ ((𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵}) ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
6	2, 5	bitri 275	. . 3 ⊢ (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
7	6	eqabi 2880	. 2 ⊢ ({𝐴} ∪ {𝐵}) = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)}
8	1, 7	eqtri 2768	1 ⊢ {𝐴, 𝐵} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)}

Syntax hints:   ∨ wo 846   = wceq 1537   ∈ wcel 2108  {cab 2717   ∪ cun 3974  {csn 4648  {cpr 4650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-v 3490  df-un 3981  df-sn 4649  df-pr 4651

This theorem is referenced by:  dfsn2ALT  4669  elprg  4670  nfpr  4715  pwpw0  4838  pwsn  4924  zfpair  5439  grothprimlem  10902  nb3grprlem1  29415  rabsspr  32529  abpr  43371