Theorem dfpred3 6160

Description: An alternate definition of predecessor class when 𝑋 is a set. (Contributed by Scott Fenton, 13-Jun-2018.)

Hypothesis

Ref	Expression
dfpred2.1	⊢ 𝑋 ∈ V

Assertion

Ref	Expression
dfpred3	⊢ Pred(𝑅, 𝐴, 𝑋) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}

Distinct variable groups:   𝑦,𝑅   𝑦,𝑋   𝑦,𝐴

Proof of Theorem dfpred3

Step	Hyp	Ref	Expression
1		incom 4180	. 2 ⊢ (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋}) = ({𝑦 ∣ 𝑦𝑅𝑋} ∩ 𝐴)
2		dfpred2.1	. . 3 ⊢ 𝑋 ∈ V
3	2	dfpred2 6159	. 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋})
4		dfrab2 4281	. 2 ⊢ {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋} = ({𝑦 ∣ 𝑦𝑅𝑋} ∩ 𝐴)
5	1, 3, 4	3eqtr4i 2856	1 ⊢ Pred(𝑅, 𝐴, 𝑋) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}

Syntax hints:   = wceq 1537   ∈ wcel 2114  {cab 2801  {crab 3144  Vcvv 3496   ∩ cin 3937   class class class wbr 5068  Predcpred 6149

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-br 5069  df-opab 5131  df-xp 5563  df-cnv 5565  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150

This theorem is referenced by:  dfpred3g  6161  frpomin2  33081