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

Theorem opnzi 4157
Description: An ordered pair is nonempty if the arguments are sets (it is also inhabited; see opm 4156). (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 4156 . . 3  |-  ( E. x  x  e.  <. A ,  B >.  <->  ( A  e.  _V  /\  B  e. 
_V ) )
41, 2, 3mpbir2an 926 . 2  |-  E. x  x  e.  <. A ,  B >.
5 n0r 3376 . 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 1468    e. wcel 1480    =/= wne 2308   _Vcvv 2686   (/)c0 3363   <.cop 3530
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536
This theorem is referenced by:  0nelxp  4567  0neqopab  5816
  Copyright terms: Public domain W3C validator