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

Theorem dftr3 5140
Description: An alternate way of defining a transitive class. Definition 7.1 of [TakeutiZaring] p. 35. (Contributed by NM, 29-Aug-1993.)
Assertion
Ref Expression
dftr3 (Tr 𝐴 ↔ ∀𝑥𝐴 𝑥𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem dftr3
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dftr5 5139 . 2 (Tr 𝐴 ↔ ∀𝑥𝐴𝑦𝑥 𝑦𝐴)
2 dfss3 3903 . . 3 (𝑥𝐴 ↔ ∀𝑦𝑥 𝑦𝐴)
32ralbii 3133 . 2 (∀𝑥𝐴 𝑥𝐴 ↔ ∀𝑥𝐴𝑦𝑥 𝑦𝐴)
41, 3bitr4i 281 1 (Tr 𝐴 ↔ ∀𝑥𝐴 𝑥𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 209  wcel 2111  wral 3106  wss 3881  Tr wtr 5136
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-11 2158  ax-ext 2770
This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-v 3443  df-in 3888  df-ss 3898  df-uni 4801  df-tr 5137
This theorem is referenced by:  trss  5145  trin  5146  triun  5149  triin  5151  tron  6182  ssorduni  7480  suceloni  7508  dfrecs3  7992  ordtypelem2  8967  tcwf  9296  itunitc  9832  wunex2  10149  wfgru  10227
  Copyright terms: Public domain W3C validator