Theorem prnz 3795

Description: A pair containing a set is not empty. It is also inhabited (see prm 3796). (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 3777	. 2 |- A e. { A , B }
3		ne0i 3501	. 2 |- ( A e. { A , B } -> { A , B } =/= (/) )
4	2, 3	ax-mp 5	1 |- { A , B } =/= (/)

Syntax hints:   e. wcel 2202   =/= wne 2402   _Vcvv 2802   (/)c0 3494   {cpr 3670

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-v 2804  df-dif 3202  df-un 3204  df-nul 3495  df-sn 3675  df-pr 3676

This theorem is referenced by:  prnzg  3797