ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  opnzi Unicode version

Theorem opnzi 4333
Description: An ordered pair is nonempty if the arguments are sets (it is also inhabited; see opm 4332). (Contributed by Mario Carneiro, 26-Apr-2015.)
Hypotheses
Ref Expression
opth1.1  |-  A  e. 
_V
opth1.2  |-  B  e. 
_V
Assertion
Ref Expression
opnzi  |-  <. A ,  B >.  =/=  (/)

Proof of Theorem opnzi
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 opth1.1 . . 3  |-  A  e. 
_V
2 opth1.2 . . 3  |-  B  e. 
_V
3 opm 4332 . . 3  |-  ( E. x  x  e.  <. A ,  B >.  <->  ( A  e.  _V  /\  B  e. 
_V ) )
41, 2, 3mpbir2an 951 . 2  |-  E. x  x  e.  <. A ,  B >.
5 n0r 3510 . 2  |-  ( E. x  x  e.  <. A ,  B >.  ->  <. A ,  B >.  =/=  (/) )
64, 5ax-mp 5 1  |-  <. A ,  B >.  =/=  (/)
Colors of variables: wff set class
Syntax hints:   E.wex 1541    e. wcel 2202    =/= wne 2403   _Vcvv 2803   (/)c0 3496   <.cop 3676
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682
This theorem is referenced by:  0nelxp  4759  0neqopab  6076
  Copyright terms: Public domain W3C validator