| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > predeq2 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the predecessor class. (Contributed by Scott Fenton, 2-Feb-2011.) |
| Ref | Expression |
|---|---|
| predeq2 | ⊢ (𝐴 = 𝐵 → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑅, 𝐵, 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2765 | . 2 ⊢ 𝑅 = 𝑅 | |
| 2 | eqid 2765 | . 2 ⊢ 𝑋 = 𝑋 | |
| 3 | predeq123 6307 | . 2 ⊢ ((𝑅 = 𝑅 ∧ 𝐴 = 𝐵 ∧ 𝑋 = 𝑋) → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑅, 𝐵, 𝑋)) | |
| 4 | 1, 2, 3 | mp3an13 1481 | 1 ⊢ (𝐴 = 𝐵 → Pred(𝑅, 𝐴, 𝑋) = Pred(𝑅, 𝐵, 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 Predcpred 6305 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| 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 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5112 df-opab 5176 df-xp 5669 df-cnv 5671 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 |
| This theorem is used by: fprlem1 8303 frmin 9728 frrlem15 9736 prednn 13700 prednn0 13701 dfpre 39187 |
| Copyright terms: Public domain | W3C validator |