MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  predss Structured version   Visualization version   GIF version

Theorem predss 6285
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
StepHypRef Expression
1 df-pred 6277 . 2 Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (𝑅 “ {𝑋}))
2 inss1 4203 . 2 (𝐴 ∩ (𝑅 “ {𝑋})) ⊆ 𝐴
31, 2eqsstri 3996 1 Pred(𝑅, 𝐴, 𝑋) ⊆ 𝐴
Colors of variables: wff setvar class
Syntax hints:  cin 3916  wss 3917  {csn 4592  ccnv 5640  cima 5644  Predcpred 6276
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-v 3452  df-in 3924  df-ss 3934  df-pred 6277
This theorem is referenced by:  frpoins3xpg  8122  frpoins3xp3g  8123  xpord2pred  8127  xpord3pred  8134  fpr3g  8267  frrlem4  8271  frrlem13  8280  fpr1  8285  wfr3g  8301  ttrclselem1  9685  frmin  9709  frr3g  9716  frr1  9719  nummin  35088  wsuclem  35820
  Copyright terms: Public domain W3C validator