Theorem trel 4236

Description: In a transitive class, the membership relation is transitive. (Contributed by NM, 19-Apr-1994.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)

Assertion

Ref	Expression
trel	⊢ (Tr 𝐴 → ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴))

Proof of Theorem trel

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dftr2 4231	. 2 ⊢ (Tr 𝐴 ↔ ∀𝑦∀𝑥((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐴))
2		eleq12 2303	. . . . . 6 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → (𝑦 ∈ 𝑥 ↔ 𝐵 ∈ 𝐶))
3		eleq1 2301	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
4	3	adantl 277	. . . . . 6 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → (𝑥 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
5	2, 4	anbi12d 477	. . . . 5 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) ↔ (𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)))
6		eleq1 2301	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
7	6	adantr 276	. . . . 5 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → (𝑦 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
8	5, 7	imbi12d 234	. . . 4 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → (((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐴) ↔ ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴)))
9	8	spc2gv 2916	. . 3 ⊢ ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (∀𝑦∀𝑥((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐴) → ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴)))
10	9	pm2.43b 52	. 2 ⊢ (∀𝑦∀𝑥((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐴) → ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴))
11	1, 10	sylbi 121	1 ⊢ (Tr 𝐴 → ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1400   = wceq 1402   ∈ wcel 2209  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-v 2823  df-in 3226  df-ss 3233  df-uni 3936  df-tr 4230

This theorem is used by:  trel3  4237  ordtr1  4533  suctr  4566  trsuc  4567  ordn2lp  4692