HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem dftr3 2689
Description: An alternate way of defining a transitive class. Definition 7.1 of [TakeutiZaring] p. 35.
Assertion
Ref Expression
dftr3 |- (Tr A <-> A.x e. A x (_ A)
Distinct variable group:   x,A

Proof of Theorem dftr3
StepHypRef Expression
1 dftr5 2688 . 2 |- (Tr A <-> A.x e. A A.y e. x y e. A)
2 dfss3 2062 . . 3 |- (x (_ A <-> A.y e. x y e. A)
32ralbii 1670 . 2 |- (A.x e. A x (_ A <-> A.x e. A A.y e. x y e. A)
41, 3bitr4 176 1 |- (Tr A <-> A.x e. A x (_ A)
Colors of variables: wff set class
Syntax hints:   <-> wb 146   e. wcel 960  A.wral 1648   (_ wss 2050  Tr wtr 2685
This theorem is referenced by:  dftr4 2690  trss 2694  trin 2695  ordon 2993  ssorduni 2999  suceloni 3068  r1tr 4664
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475  df-ral 1652  df-v 1815  df-in 2054  df-ss 2056  df-uni 2508  df-tr 2686
Copyright terms: Public domain