Theorem prnz 3834

Description: A pair containing a set is not empty. It is also inhabited (see prm 3835). (Contributed by NM, 9-Apr-1994.)

Hypothesis

Ref	Expression
prnz.1	|- A e. _V

Assertion

Ref	Expression
prnz	|- { A , B } =/= (/)

Proof of Theorem prnz

Step	Hyp	Ref	Expression
1		prnz.1	. . 3 |- A e. _V
2	1	prid1 3816	. 2 |- A e. { A , B }
3		ne0i 3528	. 2 |- ( A e. { A , B } -> { A , B } =/= (/) )
4	2, 3	ax-mp 5	1 |- { A , B } =/= (/)

Syntax hints:   e. wcel 2209   =/= wne 2420   _Vcvv 2821   (/)c0 3520   {cpr 3709

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-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-v 2823  df-dif 3222  df-un 3224  df-nul 3521  df-sn 3714  df-pr 3715

This theorem is referenced by:  prnzg  3836