Theorem dfop 4401

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

Syntax hints:   = wceq 1483   ∈ wcel 1990  Vcvv 3200  {csn 4177  {cpr 4179  ⟨cop 4183

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-dif 3577  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-op 4184

This theorem is referenced by:  opid  4421  elopOLD  4936  opi1  4937  opi2  4938  op1stb  4940  opeqsn  4967  opeqpr  4968  propssopi  4971  uniop  4977  xpsspw  5233  relop  5272  funopg  5922