Theorem elpredim 6341

Description: Membership in a predecessor class - implicative version. (Contributed by Scott Fenton, 9-May-2012.) (Proof shortened by BJ, 16-Oct-2024.)

Hypothesis

Ref	Expression
elpredim.1	⊢ 𝑋 ∈ V

Assertion

Ref	Expression
elpredim	⊢ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑌𝑅𝑋)

Proof of Theorem elpredim

Step	Hyp	Ref	Expression
1		elpredim.1	. 2 ⊢ 𝑋 ∈ V
2		elpredimg 6340	. 2 ⊢ ((𝑋 ∈ V ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋)) → 𝑌𝑅𝑋)
3	1, 2	mpan 703	1 ⊢ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑌𝑅𝑋)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2147  Vcvv 3454   class class class wbr 5106  Predcpred 6324

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5253  ax-pr 5396

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-xp 5662  df-cnv 5664  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325

This theorem is used by:  preddowncl  6356