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

Theorem opnzi 5473
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 5472 . 2 (⟨𝐴, 𝐵⟩ ≠ ∅ ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V))
41, 2, 3mpbir2an 707 1 𝐴, 𝐵⟩ ≠ ∅
Colors of variables: wff setvar class
Syntax hints:  wcel 2104  wne 2938  Vcvv 3472  c0 4321  cop 4633
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pr 5426
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2722  df-clel 2808  df-ne 2939  df-v 3474  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634
This theorem is referenced by:  opelopabsb  5529  0nelopab  5566  0nelopabOLD  5567  0nelxp  5709  unixp0  6281  funopsn  7147  cnfldfun  21156  fmlaomn0  34679  gg-cnfldfun  35483  finxpreclem2  36574  finxp0  36575  finxpreclem6  36580
  Copyright terms: Public domain W3C validator