Theorem dfop 4837

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 4836	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}})
4	1, 2, 3	mp2an 704	1 ⊢ ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}}

Syntax hints:   = wceq 1570   ∈ wcel 2143  Vcvv 3455  {csn 4589  {cpr 4591  ⟨cop 4595

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-dif 3908  df-ss 3922  df-nul 4287  df-if 4488  df-op 4596

This theorem is referenced by:  opi1  5450  opi2  5451  op1stb  5453  opeqpr  5488  propssopi  5491  uniop  5498  xpsspw  5796  relop  5836  funopg  6570