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

Theorem dftr3 5223
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 5222 . 2 (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴)
2 dfss3 3902 . . 3 (𝑥 ⊆ 𝐴 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴)
32ralbii 3112 . 2 (∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴)
41, 3bitr4i 281 1 (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  Tr wtr 5218
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-v 3456  df-ss 3901  df-uni 4873  df-tr 5219
This theorem is used by:  trss  5228  trun  5229  trin  5230  triun  5233  triin  5235  tron  6411  ssorduni  7827  dfrecs3  8418  ordtypelem2  9550  tcwf  9937  itunitc  10538  wunex2  10862  wfgru  10940  axtco  37474  axtco1g  37479  ttciunun  37514  regsfromregtco  37541  nadd2rabtr  44647  trwf  46213
  Copyright terms: Public domain W3C validator