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

Theorem dftr2 5209
Description: An alternate way of defining a transitive class. Exercise 7 of [TakeutiZaring] p. 40. Using dftr2c 5210 instead may avoid dependences on ax-11 2163. (Contributed by NM, 24-Apr-1994.)
Assertion
Ref Expression
dftr2 (Tr 𝐴 ↔ ∀𝑥𝑦((𝑥𝑦𝑦𝐴) → 𝑥𝐴))
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem dftr2
StepHypRef Expression
1 df-ss 3920 . 2 ( 𝐴𝐴 ↔ ∀𝑥(𝑥 𝐴𝑥𝐴))
2 df-tr 5208 . 2 (Tr 𝐴 𝐴𝐴)
3 19.23v 1944 . . . 4 (∀𝑦((𝑥𝑦𝑦𝐴) → 𝑥𝐴) ↔ (∃𝑦(𝑥𝑦𝑦𝐴) → 𝑥𝐴))
4 eluni 4868 . . . . 5 (𝑥 𝐴 ↔ ∃𝑦(𝑥𝑦𝑦𝐴))
54imbi1i 349 . . . 4 ((𝑥 𝐴𝑥𝐴) ↔ (∃𝑦(𝑥𝑦𝑦𝐴) → 𝑥𝐴))
63, 5bitr4i 278 . . 3 (∀𝑦((𝑥𝑦𝑦𝐴) → 𝑥𝐴) ↔ (𝑥 𝐴𝑥𝐴))
76albii 1821 . 2 (∀𝑥𝑦((𝑥𝑦𝑦𝐴) → 𝑥𝐴) ↔ ∀𝑥(𝑥 𝐴𝑥𝐴))
81, 2, 73bitr4i 303 1 (Tr 𝐴 ↔ ∀𝑥𝑦((𝑥𝑦𝑦𝐴) → 𝑥𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wal 1540  wex 1781  wcel 2114  wss 3903   cuni 4865  Tr wtr 5207
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
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-v 3444  df-ss 3920  df-uni 4866  df-tr 5208
This theorem is referenced by:  dftr2c  5210  trel  5215  ordelord  6347  suctr  6413  trom  7827  hartogs  9461  card2on  9471  trcl  9649  tskwe  9874  ondomon  10485  nosupno  27683  noinfno  27698  bdayons  28284  dftr6  35964  elpotr  35992  hftr  36395  dford4  43380  mnutrd  44630  tratrb  44886  trsbc  44890  truniALT  44891  sspwtr  45170  sspwtrALT  45171  sspwtrALT2  45172  pwtrVD  45173  pwtrrVD  45174  suctrALT  45175  suctrALT2VD  45185  suctrALT2  45186  tratrbVD  45210  trsbcVD  45226  truniALTVD  45227  trintALTVD  45229  trintALT  45230  suctrALTcf  45271  suctrALTcfVD  45272  suctrALT3  45273
  Copyright terms: Public domain W3C validator