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

Theorem dftr5 2683
Description: An alternate way of defining a transitive class.
Assertion
Ref Expression
dftr5 |- (Tr A <-> A.x e. A A.y e. x y e. A)
Distinct variable group:   x,y,A

Proof of Theorem dftr5
StepHypRef Expression
1 dftr2 2682 . 2 |- (Tr A <-> A.yA.x((y e. x /\ x e. A) -> y e. A))
2 alcom 1032 . 2 |- (A.yA.x((y e. x /\ x e. A) -> y e. A) <-> A.xA.y((y e. x /\ x e. A) -> y e. A))
3 impexp 347 . . . . . 6 |- (((y e. x /\ x e. A) -> y e. A) <-> (y e. x -> (x e. A -> y e. A)))
43albii 999 . . . . 5 |- (A.y((y e. x /\ x e. A) -> y e. A) <-> A.y(y e. x -> (x e. A -> y e. A)))
5 df-ral 1649 . . . . 5 |- (A.y e. x (x e. A -> y e. A) <-> A.y(y e. x -> (x e. A -> y e. A)))
6 r19.21v 1716 . . . . 5 |- (A.y e. x (x e. A -> y e. A) <-> (x e. A -> A.y e. x y e. A))
74, 5, 63bitr2 179 . . . 4 |- (A.y((y e. x /\ x e. A) -> y e. A) <-> (x e. A -> A.y e. x y e. A))
87albii 999 . . 3 |- (A.xA.y((y e. x /\ x e. A) -> y e. A) <-> A.x(x e. A -> A.y e. x y e. A))
9 df-ral 1649 . . 3 |- (A.x e. A A.y e. x y e. A <-> A.x(x e. A -> A.y e. x y e. A))
108, 9bitr4 176 . 2 |- (A.xA.y((y e. x /\ x e. A) -> y e. A) <-> A.x e. A A.y e. x y e. A)
111, 2, 103bitr 177 1 |- (Tr A <-> A.x e. A A.y e. x y e. A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 954   e. wcel 958  A.wral 1645  Tr wtr 2680
This theorem is referenced by:  dftr3 2684
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ral 1649  df-v 1812  df-in 2051  df-ss 2053  df-uni 2504  df-tr 2681
Copyright terms: Public domain