Theorem dfop 3776

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.)

Hypotheses

Ref	Expression
dfop.1	|- A e. _V
dfop.2	|- B e. _V

Assertion

Ref	Expression
dfop	|- <. A , B >. = { { A } , { A , B } }

Proof of Theorem dfop

Step	Hyp	Ref	Expression
1		dfop.1	. 2 |- A e. _V
2		dfop.2	. 2 |- B e. _V
3		dfopg 3775	. 2 |- ( ( A e. _V /\ B e. _V ) -> <. A , B >. = { { A } , { A , B } } )
4	1, 2, 3	mp2an 426	1 |- <. A , B >. = { { A } , { A , B } }

Syntax hints:   = wceq 1353   e. wcel 2148   _Vcvv 2737   {csn 3592   {cpr 3593   <.cop 3595

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-11 1506  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-v 2739  df-op 3601

This theorem is referenced by:  opid  3795  elop  4229  opi1  4230  opi2  4231  opeqsn  4250  opeqpr  4251  uniop  4253  op1stb  4476  xpsspw  4736  relop  4774  funopg  5247