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

Theorem dif1o 8487
Description: Two ways to say that 𝐴 is a nonzero number of the set 𝐵. (Contributed by Mario Carneiro, 21-May-2015.)
Assertion
Ref Expression
dif1o (𝐴 ∈ (𝐵 ∖ 1o) ↔ (𝐴𝐵𝐴 ≠ ∅))

Proof of Theorem dif1o
StepHypRef Expression
1 df1o2 8462 . . . 4 1o = {∅}
21difeq2i 4071 . . 3 (𝐵 ∖ 1o) = (𝐵 ∖ {∅})
32eleq2i 2852 . 2 (𝐴 ∈ (𝐵 ∖ 1o) ↔ 𝐴 ∈ (𝐵 ∖ {∅}))
4 eldifsn 4748 . 2 (𝐴 ∈ (𝐵 ∖ {∅}) ↔ (𝐴𝐵𝐴 ≠ ∅))
53, 4bitri 278 1 (𝐴 ∈ (𝐵 ∖ 1o) ↔ (𝐴𝐵𝐴 ≠ ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 401  wcel 2145  wne 2955  cdif 3896  c0 4279  {csn 4584  1oc1o 8448
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-nul 4280  df-sn 4585  df-suc 6363  df-1o 8455
This theorem is used by:  ondif1  8488  brwitnlem  8494  oelim2  8583  oeeulem  8589  oeeui  8590  omabs  8639  cantnfp1lem3  9659  cantnfp1  9660  cantnflem1  9668  cantnflem3  9670  cantnflem4  9671  cnfcom3lem  9682
  Copyright terms: Public domain W3C validator