Theorem dfpred2 6319

Description: An alternate definition of predecessor class when 𝑋 is a set. (Contributed by Scott Fenton, 8-Feb-2011.)

Hypothesis

Ref	Expression
dfpred2.1	⊢ 𝑋 ∈ V

Assertion

Ref	Expression
dfpred2	⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋})

Distinct variable groups:   𝑦,𝑅   𝑦,𝑋

Allowed substitution hint:   𝐴(𝑦)

Proof of Theorem dfpred2

Step	Hyp	Ref	Expression
1		df-pred 6309	. 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋}))
2		dfpred2.1	. . . 4 ⊢ 𝑋 ∈ V
3		iniseg 6104	. . . 4 ⊢ (𝑋 ∈ V → (◡𝑅 “ {𝑋}) = {𝑦 ∣ 𝑦𝑅𝑋})
4	2, 3	ax-mp 5	. . 3 ⊢ (◡𝑅 “ {𝑋}) = {𝑦 ∣ 𝑦𝑅𝑋}
5	4	ineq2i 4173	. 2 ⊢ (𝐴 ∩ (◡𝑅 “ {𝑋})) = (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋})
6	1, 5	eqtri 2789	1 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋})

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2146  {cab 2744  Vcvv 3458   ∩ cin 3907  {csn 4594   class class class wbr 5114  ^◡ccnv 5665   “ cima 5669  Predcpred 6308

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-cnv 5674  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309

This theorem is used by:  dfpred3  6320