Theorem trel 4107

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 4102	. 2 ⊢ (Tr 𝐴 ↔ ∀𝑦∀𝑥((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐴))
2		eleq12 2242	. . . . . 6 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → (𝑦 ∈ 𝑥 ↔ 𝐵 ∈ 𝐶))
3		eleq1 2240	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
4	3	adantl 277	. . . . . 6 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → (𝑥 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
5	2, 4	anbi12d 473	. . . . 5 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) ↔ (𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)))
6		eleq1 2240	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
7	6	adantr 276	. . . . 5 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → (𝑦 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
8	5, 7	imbi12d 234	. . . 4 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐶) → (((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐴) ↔ ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴)))
9	8	spc2gv 2828	. . 3 ⊢ ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (∀𝑦∀𝑥((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐴) → ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴)))
10	9	pm2.43b 52	. 2 ⊢ (∀𝑦∀𝑥((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐴) → ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴))
11	1, 10	sylbi 121	1 ⊢ (Tr 𝐴 → ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1351   = wceq 1353   ∈ wcel 2148  Tr wtr 4100

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-in 3135  df-ss 3142  df-uni 3810  df-tr 4101

This theorem is referenced by:  trel3  4108  ordtr1  4387  suctr  4420  trsuc  4421  ordn2lp  4543