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

Theorem predin 6164
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 4201 . 2 ((𝐴𝐵) ∩ (𝑅 “ {𝑋})) = ((𝐴 ∩ (𝑅 “ {𝑋})) ∩ (𝐵 ∩ (𝑅 “ {𝑋})))
2 df-pred 6141 . 2 Pred(𝑅, (𝐴𝐵), 𝑋) = ((𝐴𝐵) ∩ (𝑅 “ {𝑋}))
3 df-pred 6141 . . 3 Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (𝑅 “ {𝑋}))
4 df-pred 6141 . . 3 Pred(𝑅, 𝐵, 𝑋) = (𝐵 ∩ (𝑅 “ {𝑋}))
53, 4ineq12i 4184 . 2 (Pred(𝑅, 𝐴, 𝑋) ∩ Pred(𝑅, 𝐵, 𝑋)) = ((𝐴 ∩ (𝑅 “ {𝑋})) ∩ (𝐵 ∩ (𝑅 “ {𝑋})))
61, 2, 53eqtr4i 2851 1 Pred(𝑅, (𝐴𝐵), 𝑋) = (Pred(𝑅, 𝐴, 𝑋) ∩ Pred(𝑅, 𝐵, 𝑋))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1528  cin 3932  {csn 4557  ccnv 5547  cima 5551  Predcpred 6140
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-rab 3144  df-v 3494  df-in 3940  df-pred 6141
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator