Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  untelirr Structured version   Visualization version   GIF version

Theorem untelirr 30839
Description: We call a class "untanged" if all its members are not members of themselves. The term originates from Isbell (see citation in dfon2 30941). Using this concept, we can avoid a lot of the uses of the Axiom of Regularity. Here, we prove a series of properties of untanged classes. First, we prove that an untangled class is not a member of itself. (Contributed by Scott Fenton, 28-Feb-2011.)
Assertion
Ref Expression
untelirr (∀𝑥𝐴 ¬ 𝑥𝑥 → ¬ 𝐴𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem untelirr
StepHypRef Expression
1 eleq1 2676 . . . . 5 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝑥))
2 eleq2 2677 . . . . 5 (𝑥 = 𝐴 → (𝐴𝑥𝐴𝐴))
31, 2bitrd 267 . . . 4 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝐴))
43notbid 307 . . 3 (𝑥 = 𝐴 → (¬ 𝑥𝑥 ↔ ¬ 𝐴𝐴))
54rspccv 3279 . 2 (∀𝑥𝐴 ¬ 𝑥𝑥 → (𝐴𝐴 → ¬ 𝐴𝐴))
65pm2.01d 180 1 (∀𝑥𝐴 ¬ 𝑥𝑥 → ¬ 𝐴𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1475  wcel 1977  wral 2896
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-v 3175
This theorem is referenced by:  untsucf  30841  untangtr  30845  dfon2lem3  30934  dfon2lem7  30938  dfon2lem8  30939  dfon2lem9  30940
  Copyright terms: Public domain W3C validator