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

Theorem inn0 4323
Description: A nonempty intersection. (Contributed by Glauco Siliprandi, 24-Dec-2020.)
Assertion
Ref Expression
inn0 ((𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝑥 ∈ 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem inn0
StepHypRef Expression
1 nfcv 2926 . 2 Ⅎ𝑥𝐴
2 nfcv 2926 . 2 Ⅎ𝑥𝐵
31, 2inn0f 4322 1 ((𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝑥 ∈ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090   ∩ cin 4092  ∅c0 4281
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-rex 3091  df-v 3456  df-dif 4050  df-in 4094  df-nul 4282
This theorem is used by:  tgaaddcpbl2  29383  ufdprmidl  34143  sswfaxreg  46172  qinioo  46752
  Copyright terms: Public domain W3C validator