Theorem trpred 6289

Description: The class of predecessors of an element of a transitive class for the membership relation is that element. (Contributed by BJ, 12-Oct-2024.)

Assertion

Ref	Expression
trpred	⊢ ((Tr 𝐴 ∧ 𝑋 ∈ 𝐴) → Pred( E , 𝐴, 𝑋) = 𝑋)

Proof of Theorem trpred

Step	Hyp	Ref	Expression
1		predep 6288	. . 3 ⊢ (𝑋 ∈ 𝐴 → Pred( E , 𝐴, 𝑋) = (𝐴 ∩ 𝑋))
2	1	adantl 481	. 2 ⊢ ((Tr 𝐴 ∧ 𝑋 ∈ 𝐴) → Pred( E , 𝐴, 𝑋) = (𝐴 ∩ 𝑋))
3		trss 5215	. . . 4 ⊢ (Tr 𝐴 → (𝑋 ∈ 𝐴 → 𝑋 ⊆ 𝐴))
4	3	imp 406	. . 3 ⊢ ((Tr 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ⊆ 𝐴)
5		sseqin2 4175	. . 3 ⊢ (𝑋 ⊆ 𝐴 ↔ (𝐴 ∩ 𝑋) = 𝑋)
6	4, 5	sylib 218	. 2 ⊢ ((Tr 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐴 ∩ 𝑋) = 𝑋)
7	2, 6	eqtrd 2771	1 ⊢ ((Tr 𝐴 ∧ 𝑋 ∈ 𝐴) → Pred( E , 𝐴, 𝑋) = 𝑋)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113   ∩ cin 3900   ⊆ wss 3901  Tr wtr 5205   E cep 5523  Predcpred 6258

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-tr 5206  df-eprel 5524  df-xp 5630  df-rel 5631  df-cnv 5632  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259

This theorem is referenced by:  predon  7731  omsinds  7829  trfr  45199