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

Theorem opnz 5422
Description: An ordered pair is nonempty iff the arguments are sets. (Contributed by NM, 24-Jan-2004.) (Revised by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
opnz (⟨𝐴, 𝐵⟩ ≠ ∅ ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V))

Proof of Theorem opnz
StepHypRef Expression
1 opprc 4853 . . 3 (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = ∅)
21necon1ai 2960 . 2 (⟨𝐴, 𝐵⟩ ≠ ∅ → (𝐴 ∈ V ∧ 𝐵 ∈ V))
3 dfopg 4828 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}})
4 snex 5382 . . . . 5 {𝐴} ∈ V
54prnz 4735 . . . 4 {{𝐴}, {𝐴, 𝐵}} ≠ ∅
65a1i 11 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {{𝐴}, {𝐴, 𝐵}} ≠ ∅)
73, 6eqnetrd 3000 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ ≠ ∅)
82, 7impbii 209 1 (⟨𝐴, 𝐵⟩ ≠ ∅ ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wcel 2114  wne 2933  Vcvv 3441  c0 4286  {csn 4581  {cpr 4583  cop 4587
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-v 3443  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588
This theorem is referenced by:  opnzi  5423  opeqex  5447  opelopabsb  5479  setsfun0  17103  fmlaomn0  35565
  Copyright terms: Public domain W3C validator