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 5203	. . . 4 ⊢ (Tr 𝐴 → (𝑋 ∈ 𝐴 → 𝑋 ⊆ 𝐴))
4	3	imp 406	. . 3 ⊢ ((Tr 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ⊆ 𝐴)
5		sseqin2 4164	. . 3 ⊢ (𝑋 ⊆ 𝐴 ↔ (𝐴 ∩ 𝑋) = 𝑋)
6	4, 5	sylib 218	. 2 ⊢ ((Tr 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐴 ∩ 𝑋) = 𝑋)
7	2, 6	eqtrd 2772	1 ⊢ ((Tr 𝐴 ∧ 𝑋 ∈ 𝐴) → Pred( E , 𝐴, 𝑋) = 𝑋)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ∩ cin 3889   ⊆ wss 3890  Tr wtr 5193   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 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-tr 5194  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  7733  omsinds  7831  trfr  45407