Theorem dftr3 4233

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.

Step	Hyp	Ref	Expression
1		dftr5 4232	. 2 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴)
2		dfss3 3236	. . 3 ⊢ (𝑥 ⊆ 𝐴 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴)
3	2	ralbii 2556	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴)
4	1, 3	bitr4i 187	1 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴)

This proof depends on syntax axioms:   ↔ wb 105   ∈ wcel 2209  ∀wral 2528   ⊆ wss 3220  Tr wtr 4229

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-in 3226  df-ss 3233  df-uni 3936  df-tr 4230

This theorem is used by:  trss  4238  trin  4239  triun  4242  trint  4244  tron  4527  ssorduni  4634  pw1on  7585  bj-nntrans2  16990  bj-omtrans2  16995