| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > predeq1 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the predecessor class. (Contributed by Scott Fenton, 2-Feb-2011.) |
| Ref | Expression |
|---|---|
| predeq1 | ⊢ (𝑅 = 𝑆 → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑆, 𝐴, 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2739 | . 2 ⊢ 𝐴 = 𝐴 | |
| 2 | eqid 2739 | . 2 ⊢ 𝑋 = 𝑋 | |
| 3 | predeq123 6254 | . 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐴 ∧ 𝑋 = 𝑋) → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑆, 𝐴, 𝑋)) | |
| 4 | 1, 2, 3 | mp3an23 1461 | 1 ⊢ (𝑅 = 𝑆 → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑆, 𝐴, 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 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: (None) |
| Copyright terms: Public domain | W3C validator |