| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elpred | Structured version Visualization version GIF version | ||
| Description: Membership in a predecessor class. (Contributed by Scott Fenton, 4-Feb-2011.) (Proof shortened by BJ, 16-Oct-2024.) |
| Ref | Expression |
|---|---|
| elpred.1 | ⊢ 𝑌 ∈ V |
| Ref | Expression |
|---|---|
| elpred | ⊢ (𝑋 ∈ 𝐷 → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elpred.1 | . 2 ⊢ 𝑌 ∈ V | |
| 2 | elpredgg 6312 | . 2 ⊢ ((𝑋 ∈ 𝐷 ∧ 𝑌 ∈ V) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋))) | |
| 3 | 1, 2 | mpan2 704 | 1 ⊢ (𝑋 ∈ 𝐷 → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 Vcvv 3450 class class class wbr 5103 Predcpred 6298 |
| 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 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| 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 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5661 df-cnv 5663 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 |
| This theorem is used by: predtrss 6320 setlikespec 6323 preddowncl 6330 xpord2pred 8143 xpord3pred 8150 fprlem2 8300 ttrclselem2 9705 ttrclse 9706 preduz 13705 predfz 13708 onsis 28539 ons2ind 28540 wzel 36401 wsuclem 36402 |
| Copyright terms: Public domain | W3C validator |