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

Theorem predeq123 6254
Description: Equality theorem for the predecessor class. (Contributed by Scott Fenton, 13-Jun-2018.)
Assertion
Ref Expression
predeq123 ((𝑅 = 𝑆𝐴 = 𝐵𝑋 = 𝑌) → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑆, 𝐵, 𝑌))

Proof of Theorem predeq123
StepHypRef Expression
1 simp2 1143 . . 3 ((𝑅 = 𝑆𝐴 = 𝐵𝑋 = 𝑌) → 𝐴 = 𝐵)
2 cnveq 5816 . . . . 5 (𝑅 = 𝑆𝑅 = 𝑆)
323ad2ant1 1139 . . . 4 ((𝑅 = 𝑆𝐴 = 𝐵𝑋 = 𝑌) → 𝑅 = 𝑆)
4 sneq 4566 . . . . 5 (𝑋 = 𝑌 → {𝑋} = {𝑌})
543ad2ant3 1141 . . . 4 ((𝑅 = 𝑆𝐴 = 𝐵𝑋 = 𝑌) → {𝑋} = {𝑌})
63, 5imaeq12d 6014 . . 3 ((𝑅 = 𝑆𝐴 = 𝐵𝑋 = 𝑌) → (𝑅 “ {𝑋}) = (𝑆 “ {𝑌}))
71, 6ineq12d 4151 . 2 ((𝑅 = 𝑆𝐴 = 𝐵𝑋 = 𝑌) → (𝐴 ∩ (𝑅 “ {𝑋})) = (𝐵 ∩ (𝑆 “ {𝑌})))
8 df-pred 6253 . 2 Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (𝑅 “ {𝑋}))
9 df-pred 6253 . 2 Pred(𝑆, 𝐵, 𝑌) = (𝐵 ∩ (𝑆 “ {𝑌}))
107, 8, 93eqtr4g 2799 1 ((𝑅 = 𝑆𝐴 = 𝐵𝑋 = 𝑌) → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑆, 𝐵, 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1092   = wceq 1547  cin 3882  {csn 4556  ccnv 5618  cima 5622  Predcpred 6252
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4263  df-if 4456  df-sn 4557  df-pr 4559  df-op 4563  df-br 5074  df-opab 5136  df-xp 5625  df-cnv 5627  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253
This theorem is referenced by:  predeq1  6255  predeq2  6256  predeq3  6257  frecseq123  8223  wsuceq123  36049  wlimeq12  36054
  Copyright terms: Public domain W3C validator