![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > predasetex | Structured version Visualization version GIF version |
Description: The predecessor class exists when 𝐴 does. (Contributed by Scott Fenton, 8-Feb-2011.) |
Ref | Expression |
---|---|
predasetex.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
predasetex | ⊢ Pred(𝑅, 𝐴, 𝑋) ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pred 6116 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
2 | predasetex.1 | . . 3 ⊢ 𝐴 ∈ V | |
3 | 2 | inex1 5185 | . 2 ⊢ (𝐴 ∩ (◡𝑅 “ {𝑋})) ∈ V |
4 | 1, 3 | eqeltri 2886 | 1 ⊢ Pred(𝑅, 𝐴, 𝑋) ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2111 Vcvv 3441 ∩ cin 3880 {csn 4525 ◡ccnv 5518 “ cima 5522 Predcpred 6115 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 ax-sep 5167 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-v 3443 df-in 3888 df-pred 6116 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |