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

Theorem predeq1 6332
Description: Equality theorem for the predecessor class. (Contributed by Scott Fenton, 2-Feb-2011.)
Assertion
Ref Expression
predeq1 (𝑅 = 𝑆 → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑆, 𝐴, 𝑋))

Proof of Theorem predeq1
StepHypRef Expression
1 eqid 2763 . 2 𝐴 = 𝐴
2 eqid 2763 . 2 𝑋 = 𝑋
3 predeq123 6331 . 2 ((𝑅 = 𝑆 ∧ 𝐴 = 𝐴 ∧ 𝑋 = 𝑋) → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑆, 𝐴, 𝑋))
41, 2, 3mp3an23 1483 1 (𝑅 = 𝑆 → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑆, 𝐴, 𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  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: (None)
  Copyright terms: Public domain W3C validator