| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > predel | Structured version Visualization version GIF version | ||
| Description: Membership in the predecessor class implies membership in the base class. (Contributed by Scott Fenton, 11-Feb-2011.) |
| Ref | Expression |
|---|---|
| predel | ⊢ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑌 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elinel1 4164 | . 2 ⊢ (𝑌 ∈ (𝐴 ∩ (◡𝑅 “ {𝑋})) → 𝑌 ∈ 𝐴) | |
| 2 | df-pred 6274 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
| 3 | 1, 2 | eleq2s 2846 | 1 ⊢ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑌 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2109 ∩ cin 3913 {csn 4589 ◡ccnv 5637 “ cima 5641 Predcpred 6273 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-v 3449 df-in 3921 df-pred 6274 |
| This theorem is referenced by: predtrss 6295 predpoirr 6306 predfrirr 6307 xpord2pred 8124 |
| Copyright terms: Public domain | W3C validator |