Theorem dfpred4 39188

Description: Alternate definition of the predecessor class when 𝑁 is a set. (Contributed by Peter Mazsa, 26-Jan-2026.)

Assertion

Ref	Expression
dfpred4	⊢ (𝑁 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑁) = [𝑁]◡(𝑅 ↾ 𝐴))

Proof of Theorem dfpred4

Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfpred3g 6318	. 2 ⊢ (𝑁 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑁) = {𝑚 ∈ 𝐴 ∣ 𝑚𝑅𝑁})
2		ec1cnvres 38985	. 2 ⊢ (𝑁 ∈ 𝑉 → [𝑁]◡(𝑅 ↾ 𝐴) = {𝑚 ∈ 𝐴 ∣ 𝑚𝑅𝑁})
3	1, 2	eqtr4d 2803	1 ⊢ (𝑁 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑁) = [𝑁]◡(𝑅 ↾ 𝐴))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  {crab 3418   class class class wbr 5111  ^◡ccnv 5662   ↾ cres 5665  Predcpred 6305  [cec 8698

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 2737  ax-sep 5259  ax-pr 5406

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 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-cnv 5671  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ec 8702

This theorem is used by:  dfpre4  39189