Theorem dftr2 5194

Description: An alternate way of defining a transitive class. Exercise 7 of [TakeutiZaring] p. 40. Using dftr2c 5195 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

Step	Hyp	Ref	Expression
1		df-ss 3906	. 2 ⊢ (∪ 𝐴 ⊆ 𝐴 ↔ ∀𝑥(𝑥 ∈ ∪ 𝐴 → 𝑥 ∈ 𝐴))
2		df-tr 5193	. 2 ⊢ (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
3		19.23v 1944	. . . 4 ⊢ (∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑥 ∈ 𝐴) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑥 ∈ 𝐴))
4		eluni 4853	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴))
5	4	imbi1i 349	. . . 4 ⊢ ((𝑥 ∈ ∪ 𝐴 → 𝑥 ∈ 𝐴) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑥 ∈ 𝐴))
6	3, 5	bitr4i 278	. . 3 ⊢ (∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑥 ∈ 𝐴) ↔ (𝑥 ∈ ∪ 𝐴 → 𝑥 ∈ 𝐴))
7	6	albii 1821	. 2 ⊢ (∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑥 ∈ 𝐴) ↔ ∀𝑥(𝑥 ∈ ∪ 𝐴 → 𝑥 ∈ 𝐴))
8	1, 2, 7	3bitr4i 303	1 ⊢ (Tr 𝐴 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑥 ∈ 𝐴))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1540  ∃wex 1781   ∈ wcel 2114   ⊆ wss 3889  ∪ cuni 4850  Tr wtr 5192

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 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-v 3431  df-ss 3906  df-uni 4851  df-tr 5193

This theorem is referenced by:  dftr2c  5195  trel  5200  ordelord  6345  suctr  6411  trom  7826  hartogs  9459  card2on  9469  trcl  9649  tskwe  9874  ondomon  10485  nosupno  27667  noinfno  27682  bdayons  28268  dftr6  35933  elpotr  35961  hftr  36364  ttctr  36675  dfttc2g  36688  dfttc4lem2  36711  dford4  43457  mnutrd  44707  tratrb  44963  trsbc  44967  truniALT  44968  sspwtr  45247  sspwtrALT  45248  sspwtrALT2  45249  pwtrVD  45250  pwtrrVD  45251  suctrALT  45252  suctrALT2VD  45262  suctrALT2  45263  tratrbVD  45287  trsbcVD  45303  truniALTVD  45304  trintALTVD  45306  trintALT  45307  suctrALTcf  45348  suctrALTcfVD  45349  suctrALT3  45350