Theorem dfop 4839

Description: Value of an ordered pair when the arguments are sets, with the conclusion corresponding to Kuratowski's original definition. (Contributed by NM, 25-Jun-1998.) (Avoid depending on this detail.)

Hypotheses

Ref	Expression
dfop.1	⊢ 𝐴 ∈ V
dfop.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
dfop	⊢ ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}}

Proof of Theorem dfop

Step	Hyp	Ref	Expression
1		dfop.1	. 2 ⊢ 𝐴 ∈ V
2		dfop.2	. 2 ⊢ 𝐵 ∈ V
3		dfopg 4838	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}})
4	1, 2, 3	mp2an 705	1 ⊢ ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}}

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2146  Vcvv 3457  {csn 4591  {cpr 4593  ⟨cop 4597

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459  df-dif 3909  df-ss 3923  df-nul 4287  df-if 4490  df-op 4598

This theorem is used by:  opi1  5452  opi2  5453  op1stb  5455  opeqpr  5490  propssopi  5493  uniop  5500  xpsspw  5798  relop  5838  funopg  6574