| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elpredgg | Structured version Visualization version GIF version | ||
| Description: Membership in a predecessor class. (Contributed by Scott Fenton, 17-Apr-2011.) Generalize to closed form. (Revised by BJ, 16-Oct-2024.) |
| Ref | Expression |
|---|---|
| elpredgg | ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-pred 6248 | . . 3 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
| 2 | 1 | elin2 4150 | . 2 ⊢ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ (◡𝑅 “ {𝑋}))) |
| 3 | elinisegg 6041 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊) → (𝑌 ∈ (◡𝑅 “ {𝑋}) ↔ 𝑌𝑅𝑋)) | |
| 4 | 3 | anbi2d 630 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊) → ((𝑌 ∈ 𝐴 ∧ 𝑌 ∈ (◡𝑅 “ {𝑋})) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋))) |
| 5 | 2, 4 | bitrid 283 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2111 {csn 4573 class class class wbr 5089 ◡ccnv 5613 “ cima 5617 Predcpred 6247 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-sn 4574 df-pr 4576 df-op 4580 df-br 5090 df-opab 5152 df-xp 5620 df-cnv 5622 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 |
| This theorem is referenced by: elpredg 6262 elpredimg 6263 elpred 6265 |
| Copyright terms: Public domain | W3C validator |