MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opnzi Structured version   Visualization version   GIF version

Theorem opnzi 5419
Description: An ordered pair is nonempty if the arguments are sets. (Contributed by Mario Carneiro, 26-Apr-2015.)
Hypotheses
Ref Expression
opth1.1 𝐴 ∈ V
opth1.2 𝐵 ∈ V
Assertion
Ref Expression
opnzi 𝐴, 𝐵⟩ ≠ ∅

Proof of Theorem opnzi
StepHypRef Expression
1 opth1.1 . 2 𝐴 ∈ V
2 opth1.2 . 2 𝐵 ∈ V
3 opnz 5418 . 2 (⟨𝐴, 𝐵⟩ ≠ ∅ ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V))
41, 2, 3mpbir2an 711 1 𝐴, 𝐵⟩ ≠ ∅
Colors of variables: wff setvar class
Syntax hints:  wcel 2113  wne 2930  Vcvv 3438  c0 4284  cop 4583
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ne 2931  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584
This theorem is referenced by:  opelopabsb  5475  0nelopab  5510  0nelxp  5655  unixp0  6238  funopsn  7090  cnfldfun  21315  cnfldfunOLD  21328  fmlaomn0  35445  finxpreclem2  37445  finxp0  37446  finxpreclem6  37451
  Copyright terms: Public domain W3C validator