Theorem predep 6285

Description: The predecessor under the membership relation is equivalent to an intersection. (Contributed by Scott Fenton, 27-Mar-2011.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
predep	⊢ (𝑋 ∈ 𝐵 → Pred( E , 𝐴, 𝑋) = (𝐴 ∩ 𝑋))

Proof of Theorem predep

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-pred 6256	. 2 ⊢ Pred( E , 𝐴, 𝑋) = (𝐴 ∩ (◡ E “ {𝑋}))
2		relcnv 6060	. . . . 5 ⊢ Rel ◡ E
3		relimasn 6041	. . . . 5 ⊢ (Rel ◡ E → (◡ E “ {𝑋}) = {𝑦 ∣ 𝑋◡ E 𝑦})
4	2, 3	ax-mp 5	. . . 4 ⊢ (◡ E “ {𝑋}) = {𝑦 ∣ 𝑋◡ E 𝑦}
5		brcnvg 5825	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑦 ∈ V) → (𝑋◡ E 𝑦 ↔ 𝑦 E 𝑋))
6	5	elvd 3443	. . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (𝑋◡ E 𝑦 ↔ 𝑦 E 𝑋))
7		epelg 5522	. . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (𝑦 E 𝑋 ↔ 𝑦 ∈ 𝑋))
8	6, 7	bitrd 279	. . . . 5 ⊢ (𝑋 ∈ 𝐵 → (𝑋◡ E 𝑦 ↔ 𝑦 ∈ 𝑋))
9	8	eqabcdv 2867	. . . 4 ⊢ (𝑋 ∈ 𝐵 → {𝑦 ∣ 𝑋◡ E 𝑦} = 𝑋)
10	4, 9	eqtrid 2780	. . 3 ⊢ (𝑋 ∈ 𝐵 → (◡ E “ {𝑋}) = 𝑋)
11	10	ineq2d 4169	. 2 ⊢ (𝑋 ∈ 𝐵 → (𝐴 ∩ (◡ E “ {𝑋})) = (𝐴 ∩ 𝑋))
12	1, 11	eqtrid 2780	1 ⊢ (𝑋 ∈ 𝐵 → Pred( E , 𝐴, 𝑋) = (𝐴 ∩ 𝑋))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1541   ∈ wcel 2113  {cab 2711  Vcvv 3437   ∩ cin 3897  {csn 4577   class class class wbr 5095   E cep 5520  ^◡ccnv 5620   “ cima 5624  Rel wrel 5626  Predcpred 6255

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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-br 5096  df-opab 5158  df-eprel 5521  df-xp 5627  df-rel 5628  df-cnv 5629  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256

This theorem is referenced by:  trpred  6286