Metamath Proof Explorer


Theorem predonOLD

Description: Obsolete version of predon as of 16-Oct-2024. (Contributed by Scott Fenton, 27-Mar-2011) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion predonOLD ( 𝐴 ∈ On → Pred ( E , On , 𝐴 ) = 𝐴 )

Proof

Step Hyp Ref Expression
1 predep ( 𝐴 ∈ On → Pred ( E , On , 𝐴 ) = ( On ∩ 𝐴 ) )
2 onss ( 𝐴 ∈ On → 𝐴 ⊆ On )
3 sseqin2 ( 𝐴 ⊆ On ↔ ( On ∩ 𝐴 ) = 𝐴 )
4 2 3 sylib ( 𝐴 ∈ On → ( On ∩ 𝐴 ) = 𝐴 )
5 1 4 eqtrd ( 𝐴 ∈ On → Pred ( E , On , 𝐴 ) = 𝐴 )