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.) |
Ref | Expression |
---|---|
elpred.1 | ⊢ 𝑌 ∈ V |
Ref | Expression |
---|---|
elpred | ⊢ (𝑋 ∈ 𝐷 → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pred 6143 | . . 3 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
2 | 1 | elin2 4174 | . 2 ⊢ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ (◡𝑅 “ {𝑋}))) |
3 | elpred.1 | . . . 4 ⊢ 𝑌 ∈ V | |
4 | 3 | eliniseg 5953 | . . 3 ⊢ (𝑋 ∈ 𝐷 → (𝑌 ∈ (◡𝑅 “ {𝑋}) ↔ 𝑌𝑅𝑋)) |
5 | 4 | anbi2d 630 | . 2 ⊢ (𝑋 ∈ 𝐷 → ((𝑌 ∈ 𝐴 ∧ 𝑌 ∈ (◡𝑅 “ {𝑋})) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋))) |
6 | 2, 5 | syl5bb 285 | 1 ⊢ (𝑋 ∈ 𝐷 → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2110 Vcvv 3495 {csn 4561 class class class wbr 5059 ◡ccnv 5549 “ cima 5553 Predcpred 6142 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pr 5322 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-br 5060 df-opab 5122 df-xp 5556 df-cnv 5558 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 |
This theorem is referenced by: predpo 6161 setlikespec 6164 preddowncl 6170 wfrlem10 7958 preduz 13023 predfz 13026 wzel 33106 wsuclem 33107 fprlem2 33133 |
Copyright terms: Public domain | W3C validator |