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

Theorem pred0 6238
Description: The predecessor class over is always . (Contributed by Scott Fenton, 16-Apr-2011.) (Proof shortened by AV, 11-Jun-2021.)
Assertion
Ref Expression
pred0 Pred(𝑅, ∅, 𝑋) = ∅

Proof of Theorem pred0
StepHypRef Expression
1 df-pred 6202 . 2 Pred(𝑅, ∅, 𝑋) = (∅ ∩ (𝑅 “ {𝑋}))
2 0in 4327 . 2 (∅ ∩ (𝑅 “ {𝑋})) = ∅
31, 2eqtri 2766 1 Pred(𝑅, ∅, 𝑋) = ∅
Colors of variables: wff setvar class
Syntax hints:   = wceq 1539  cin 3886  c0 4256  {csn 4561  ccnv 5588  cima 5592  Predcpred 6201
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-rab 3073  df-v 3434  df-dif 3890  df-in 3894  df-nul 4257  df-pred 6202
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator