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

Theorem predeq123 6331
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 1155 . . 3 ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑋 = 𝑌) → 𝐴 = 𝐵)
2 cnveq 5863 . . . . 5 (𝑅 = 𝑆 → ◡𝑅 = ◡𝑆)
323ad2ant1 1151 . . . 4 ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑋 = 𝑌) → ◡𝑅 = ◡𝑆)
4 sneq 4594 . . . . 5 (𝑋 = 𝑌 → {𝑋} = {𝑌})
543ad2ant3 1153 . . . 4 ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑋 = 𝑌) → {𝑋} = {𝑌})
63, 5imaeq12d 6071 . . 3 ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑋 = 𝑌) → (◡𝑅 “ {𝑋}) = (◡𝑆 “ {𝑌}))
71, 6ineq12d 4121 . 2 ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑋 = 𝑌) → (𝐴 ∩ (◡𝑅 “ {𝑋})) = (𝐵 ∩ (◡𝑆 “ {𝑌})))
8 df-pred 6330 . 2 Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋}))
9 df-pred 6330 . 2 Pred(𝑆, 𝐵, 𝑌) = (𝐵 ∩ (◡𝑆 “ {𝑌}))
107, 8, 93eqtr4g 2823 1 ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑋 = 𝑌) → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑆, 𝐵, 𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∩ cin 4092  {csn 4588  ◡ccnv 5657   “ cima 5661  Predcpred 6329
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330
This theorem is used by:  predeq1  6332  predeq2  6333  predeq3  6334  frecseq123  8338  wsuceq123  36791  wlimeq12  36796
  Copyright terms: Public domain W3C validator