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

Theorem predin 6321
Description: Intersection law for predecessor classes. (Contributed by Scott Fenton, 29-Mar-2011.)
Assertion
Ref Expression
predin Pred(𝑅, (𝐴𝐵), 𝑋) = (Pred(𝑅, 𝐴, 𝑋) ∩ Pred(𝑅, 𝐵, 𝑋))

Proof of Theorem predin
StepHypRef Expression
1 inindir 4222 . 2 ((𝐴𝐵) ∩ (𝑅 “ {𝑋})) = ((𝐴 ∩ (𝑅 “ {𝑋})) ∩ (𝐵 ∩ (𝑅 “ {𝑋})))
2 df-pred 6293 . 2 Pred(𝑅, (𝐴𝐵), 𝑋) = ((𝐴𝐵) ∩ (𝑅 “ {𝑋}))
3 df-pred 6293 . . 3 Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (𝑅 “ {𝑋}))
4 df-pred 6293 . . 3 Pred(𝑅, 𝐵, 𝑋) = (𝐵 ∩ (𝑅 “ {𝑋}))
53, 4ineq12i 4205 . 2 (Pred(𝑅, 𝐴, 𝑋) ∩ Pred(𝑅, 𝐵, 𝑋)) = ((𝐴 ∩ (𝑅 “ {𝑋})) ∩ (𝐵 ∩ (𝑅 “ {𝑋})))
61, 2, 53eqtr4i 2764 1 Pred(𝑅, (𝐴𝐵), 𝑋) = (Pred(𝑅, 𝐴, 𝑋) ∩ Pred(𝑅, 𝐵, 𝑋))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1533  cin 3942  {csn 4623  ccnv 5668  cima 5672  Predcpred 6292
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2697
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1536  df-ex 1774  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-rab 3427  df-v 3470  df-in 3950  df-pred 6293
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator