Theorem predss 6307

Description: The predecessor class of 𝐴 is a subset of 𝐴. (Contributed by Scott Fenton, 2-Feb-2011.)

Assertion

Ref	Expression
predss	⊢ Pred(𝑅, 𝐴, 𝑋) ⊆ 𝐴

Proof of Theorem predss

Step	Hyp	Ref	Expression
1		df-pred 6299	. 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋}))
2		inss1 4182	. 2 ⊢ (𝐴 ∩ (◡𝑅 “ {𝑋})) ⊆ 𝐴
3	1, 2	eqsstri 3977	1 ⊢ Pred(𝑅, 𝐴, 𝑋) ⊆ 𝐴

This proof depends on syntax axioms:   ∩ cin 3898   ⊆ wss 3899  {csn 4584  ^◡ccnv 5654   “ cima 5658  Predcpred 6298

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 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-in 3906  df-ss 3916  df-pred 6299

This theorem is used by:  frpoins3xpg  8139  frpoins3xp3g  8140  xpord2pred  8144  xpord3pred  8151  fpr3g  8285  frrlem4  8289  frrlem13  8298  fpr1  8303  wfr3g  8319  ttrclselem1  9707  frmin  9734  frr3g  9741  frr1  9744  nummin  35601  wsuclem  36405