ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elsuci GIF version

Theorem elsuci 4293
Description: Membership in a successor. This one-way implication does not require that either 𝐴 or 𝐵 be sets. (Contributed by NM, 6-Jun-1994.)
Assertion
Ref Expression
elsuci (𝐴 ∈ suc 𝐵 → (𝐴𝐵𝐴 = 𝐵))

Proof of Theorem elsuci
StepHypRef Expression
1 df-suc 4261 . . . 4 suc 𝐵 = (𝐵 ∪ {𝐵})
21eleq2i 2182 . . 3 (𝐴 ∈ suc 𝐵𝐴 ∈ (𝐵 ∪ {𝐵}))
3 elun 3185 . . 3 (𝐴 ∈ (𝐵 ∪ {𝐵}) ↔ (𝐴𝐵𝐴 ∈ {𝐵}))
42, 3bitri 183 . 2 (𝐴 ∈ suc 𝐵 ↔ (𝐴𝐵𝐴 ∈ {𝐵}))
5 elsni 3513 . . 3 (𝐴 ∈ {𝐵} → 𝐴 = 𝐵)
65orim2i 733 . 2 ((𝐴𝐵𝐴 ∈ {𝐵}) → (𝐴𝐵𝐴 = 𝐵))
74, 6sylbi 120 1 (𝐴 ∈ suc 𝐵 → (𝐴𝐵𝐴 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wo 680   = wceq 1314  wcel 1463  cun 3037  {csn 3495  suc csuc 4255
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097
This theorem depends on definitions:  df-bi 116  df-tru 1317  df-nf 1420  df-sb 1719  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-v 2660  df-un 3043  df-sn 3501  df-suc 4261
This theorem is referenced by:  trsucss  4313  onsucelsucexmid  4413  ordsoexmid  4445  ordsuc  4446  ordpwsucexmid  4453  nnsucelsuc  6353  nntri3or  6355  nnmordi  6378  nnaordex  6389  phplem3  6714
  Copyright terms: Public domain W3C validator